3 search results - page 1 / 1 » Bounds for Small-Error and Zero-Error Quantum Algorithms |
FOCS
1999
IEEE
13 years 11 months ago
1999
IEEE
FOCS
2000
IEEE
13 years 12 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...
COCO
2008
Springer
13 years 9 months ago
2008
Springer
r of Unentanglement (Extended Abstract) Scott Aaronson MIT Salman Beigi MIT Andrew Drucker MIT Bill Fefferman University of Chicago Peter Shor MIT The class QMA (k), introduced by...