Quantum certificate complexity

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2003, Pages 171-178

  Aaronson, Scott ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTIC STABILITY; COMPUTATIONAL COMPLEXITY; ERROR ANALYSIS; FUNCTIONS; COMPUTER SCIENCE; ERRORS; LABORATORIES; QUANTUM COMPUTERS; TURING MACHINES;

QUANTUM CERTIFICATE COMPLEXITY;

COMPUTER SCIENCE; BOOLEAN FUNCTIONS;

BOUNDED ERRORS; NATURAL GENERALIZATION; Q MEASUREMENTS; QUANTUM COMPUTING; QUANTUM QUERY COMPLEXITY; SQUARE ROOTS; ZERO ERRORS;

EID: 0041513292     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (23)

1. S. Aaronson. Quantum lower bound for the collision problem, in Proc. ACM STOC'2002, pp. 635-642, 2002. quant-ph/0111102.
2. A. Ambainis. A note on quantum black-box complexity of almost all Boolean functions, Inform. Proc. Lett. 71:5-7, 1999. quant-ph/9811080.
3. A. Ambainis. Quantum lower bounds by quantum arguments, J. Comput. Sys. Sci. 64:750-767, 2002. Earlier version in STOC'2000. quant-ph/0002066.
4. T. Baker, J. Gill, and R. Solovay. Relativizations of the P=?NP question, SIAM J. Comput. 4(4):431-442, 1975.
5. C. Bennett, E. Bernstein, G. Brassard, and U. Vazirani. Strengths and weaknesses of quantum computing, SIAM J. Comput. 26(5):1510-1523, 1997. quant-ph/9701001.
6. R. Beals, H. Buhrman, R. Cleve, M. Mosca, and R. de Wolf. Quantum lower bounds by polynomials, in Proc. IEEE FOCS'98, pp. 352-361, 1998. quant-ph/9802049.
7. G. Brassard, P. Høyer, and A. Tapp. Quantum algorithm for the collision problem, SIGACT News (Cryptology Column) 28:14-19, 1997. quant-ph/9705002.
8. S. Bublitz, U. Schürfeld, B. Voigt, and I. Wegener. Properties of complexity measures for PRAMs and WRAMs, Theoretical Comput. Sci. 48:53-73, 1986.
9. H. Buhrman, R. Cleve, R. de Wolf, and Ch. Zalka. Bounds for small-error and zero-error quantum algorithms, in Proc. IEEE FOCS'99, pp. 358-368, 1999. cs.CC/9904019.
10. H. Buhrman and R. de Wolf. Complexity measures and decision tree complexity: a survey, Theoretical Comput. Sci. 288:21-43, 2002.
11. L. K. Grover. A fast quantum mechanical algorithm for database search, in Proc. ACM STOC'96, pp. 212-219, 1996. quant-ph/9605043.
12. N.Nisan. CREW PRAMs and decision trees, SIAM J. Comput. 20(6):999-1007, 1991.
13. N. Nisan and M. Szegedy. On the degree of Boolean functions as real polynomials, Comput. Complexity 4(4):301-313, 1994.
14. N. Nisan and A. Wigderson. Hardness vs. randomness, J. Comput. Sys. Sci. 49(2):149-167, 1994.
15. R. Raz, G. Tardos, O. Verbitsky, and N. Vereshchagin. Arthur-Merlin games in Boolean decision trees, J. Comput. Sys. Sci. 59(2):346-372, 1999.
16. A. A. Razborov and S. Rudich. Natural proofs, J. Comput. Sys. Sci. 55(1):24-35, 1997.
17. M. Santha. On the Monte-Carlo decision tree complexity of read-once formulae, Random Structures and Algorithms 6(1):75-87, 1995.
18. Y. Shi. Quantum lower bounds for the collision and the element distinctness problems, in Proc. IEEE FOCS'2002, 2002, quant-ph/0112086.
19. P. Shor. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer, SIAM J. Comput. 26(5): 1484-1509, 1997. quant-ph/9508027.
20. J. Watrous. Succinct quantum proofs for properties of finite groups, in Proc. IEEE FOCS'2000, pp. 537-546, 2000. cs.CC/0009002.
21. I. Wegener and L. Zádori. A note on the relations between critical and sensitive complexity, EIK: Journal of Information Processing and Cybernetics 25:417-421, 1989.
22. R. de Wolf. Nondeterministic quantum query and communication complexities, to appear in SIAM J. Comput. Earlier version in Proc. IEEE Complexity'2000. cs.CC/0001014.
23. R. de Wolf. Quantum Computing and Communication Complexity, PhD thesis, University of Amsterdam, 2001.