8 search results - page 2 / 2 » Fault-Tolerant Quantum Computation With Constant Error |
FOCS
2000
IEEE
13 years 9 months ago
2000
IEEE
We give new bounds on the circuit complexity of the quantum Fourier transform (QFT). We give an upper bound of Ç´ÐÓ Ò · ÐÓ ÐÓ ´½ µµ on the circuit depth for computin...
STOC
2002
ACM
14 years 5 months ago
2002
ACM
The collision problem is to decide whether a function X : {1, . . . , n} {1, . . . , n} is one-to-one or two-to-one, given that one of these is the case. We show a lower bound of...
COCO
2009
Springer
13 years 11 months ago
2009
Springer
One of the strongest techniques available for showing lower bounds on quantum communication complexity is the logarithm of the approximation rank of the communication matrix— th...