Quantum lower bound for recursive Fourier sampling

Quantum Information and Computation

Volumn 3, Issue 2, 2003, Pages 165-174

  Aaronson, Scott ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Lower bounds; Quantum computing; Query complexity

Indexed keywords

QUANTUM THEORY;

FOURIER SAMPLING; LOWER BOUNDS; QUANTUM ALGORITHMS; QUANTUM COMPUTING; QUANTUM LOWER BOUNDS; QUERY COMPLEXITY;

QUANTUM COMPUTERS;

EID: 0141865545     PISSN: 15337146     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (22)

1. P. Shor (1997), Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer, SIAM Journal on Computing 26(5), pp. 1484-1509. quant-ph/9508027 (Available at www.arxiv.org).
2. D. Simon (1994), On the power of quantum computation, Proceedings of IEEE FOCS'94, pp. 116-123.
3. D. Deutsch and R. Jozsa (1992), Rapid solution of problems by quantum computation, Proceedings of the Royal Society of London A439, pp. 553-558.
4. E. Bernstein and U. Vazirani (1997), Quantum complexity theory, SIAM Journal on Computing 26(5), pp. 1411-1473.
5. S. Aaronson, The Complexity Zoo. http://www.cs.berkeley.edu/̃aaronson/zoo.html.
6. R. Beals, H. Buhrman, R. Cleve, M. Mosca, and R. de Wolf (1998), Quantum lower bounds by polynomials, Proceedings of IEEE FOCS'98, pp. 352-361. quant-ph/9802049.
7. W. van Dam, S. Hallgren, and L. Ip (2003), Algorithms for hidden coset problems, Proceedings of SODA'2003, quant-ph/0211140.
8. D. Boneh and R. Lipton (1996), Algorithms for black box fields and their application to cryptography, Proceedings of CRYPTO'96, Lecture Notes in Computer Science Vol. 1109, Springer-Verlag, pp. 283-297.
9. J. Watrous (2000), Succinct quantum proofs for properties of finite groups, Proceedings of IEEE FOCS'2000, pp. 537-546. cs.CC/0009002.
10. NP, Information Processing Letters 80(5), pp. 257-260.
11. L. Babai (1992), Bounded round interactive proofs in finite groups, SIAM Journal on Discrete Math 5(1), pp. 88-111.
12. U. Vazirani (2001), personal communication.
13. A. A. Razborov (1987), Lower bounds for the size of circuits of bounded depth with basis {&, ⊕}, Mathematicheskie Zametki 41(4), pp. 598-607. English translation in Math. Notes. Acad. Sci. USSR 41(4), pp. 333-338, 1987.
14. A. A. Razborov (1987), Lower bounds for the size of circuits of bounded depth with basis {&, ⊕}, Mathematicheskie Zametki 41(4), pp. 598-607. English translation in Math. Notes. Acad. Sci. USSR 41(4), pp. 333-338, 1987.
15. R. Smolensky (1987), Algebraic methods in the theory of lower bounds for Boolean circuit complexity, Proceedings of ACM STOC'87, pp. 77-82.
16. M. Furst, J. Saxe, and M. Sipser (1981), Parity, circuits, and the polynomial time hierarchy, Proceedings of IEEE FOCS'81, pp. 260-270.
17. N. Linial, Y. Mansour, and N. Nisan (1993), Constant depth circuits, Fourier transform, and learnability, Journal of the ACM 40(3), pp. 607-620.
18. P. Høyer and R. de Wolf (2002), manuscript.
19. A. Ambainis (2000), Quantum lower bounds by quantum arguments, Proceedings of ACM STOC'2000, pp. 636-643. Journal version in Journal of Computer and System Sciences 64, pp. 750-767, 2002. quant-ph/0002066.
20. A. Ambainis (2000), Quantum lower bounds by quantum arguments, Proceedings of ACM STOC'2000, pp. 636-643. Journal version in Journal of Computer and System Sciences 64, pp. 750-767, 2002. quant-ph/0002066.
21. R. Cleve, A. Ekert, C. Macchiavello, and M. Mosca (1998), Quantum algorithms revisited, Proceedings of the Royal Society of London A454, pp. 339-354. quant-ph/9708016.
22. S. Aaronson (2002), Quantum certificate complexity, submitted, quant-ph/0210020.