4895 search results - page 15 / 979 » Functional Quantum Programming |
COCO
2001
Springer
14 years 1 months ago
2001
Springer
We present several applications of quantum amplitude amplification to finding claws and collisions in ordered or unordered functions. Our algorithms generalize those of Brassard...
EUROCRYPT
2001
Springer
14 years 1 months ago
2001
Springer
In this paper we show how to convert a statistically binding but computationally concealing quantum bit commitment scheme into a computationally binding but statistically concealin...
JACM
2006
13 years 8 months ago
2006
We revisit the problem of conveying classical messages by transmitting quantum states, and derive new, optimal bounds on the number of quantum bits required for this task. Much of...
CORR
2011
Springer
13 years 3 months ago
2011
Springer
We show that any quantum algorithm to decide whether a function f : [n] → [n] is a permutation or far from a permutation must make Ω n1/3 /w queries to f, even if the algorith...
CORR
2010
Springer
13 years 3 months ago
2010
Springer
In STOC 1999, Raz presented a (partial) function for which there is a quantum protocol communicating only O(log n) qubits, but for which any classical (randomized, bounded-error) ...