BQP and the polynomial hierarchy

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2010, Pages 141-150

  Aaronson, Scott ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

constant depth circuits; fourier analysis; linial nisan conjecture; quantum complexity classes

Indexed keywords

CIRCUIT COMPLEXITY; CONSTANT-DEPTH CIRCUITS; DECISION PROBLEMS; LOGARITHMIC TIME; OPEN PROBLEMS; POLYNOMIAL HIERARCHIES; PSEUDORANDOMNESS; QUANTUM COMPLEXITY CLASS; QUANTUM COMPUTING;

COMPUTATIONAL COMPLEXITY; FOURIER ANALYSIS; FOURIER TRANSFORMS; QUANTUM COMPUTERS; QUANTUM OPTICS;

PROBLEM SOLVING;

EID: 77954724094     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1806689.1806711     Document Type: Conference Paper

References (28)

1. S. Aaronson and A. Ambainis. The need for structure in quantum speedups. arXiv:0911.0996, 2009.
2. L. Adleman, J. DeMarrais, and M.-D. Huang. Quantum computability. SIAM J. Comput., 26(5):1524-1540, 1997.
3. D. Aharonov, V. Jones, and Z. Landau. A polynomial quantum algorithm for approximating the Jones polynomial. In Proc. ACM STOC, p. 427-436, 2006.
4. Z. Bar-Yossef, T. S. Jayram, and I. Kerenidis. Exponential separation of quantum and classical one-way communication complexity. SIAM J. Comput., 38(1):366-384, 2008.
5. L. Bazzi. Polylogarithmic independence can fool DNF formulas. In Proc. IEEE FOCS, p. 63-73, 2007.
6. R. Beals, H. Buhrman, R. Cleve, M. Mosca, and R. de Wolf. Quantum lower bounds by polynomials. J. ACM, 48(4):778-797, 2001.
7. J. N. de Beaudrap, R. Cleve, and J. Watrous. Sharp quantum versus classical query complexity separations. Algorithmica, 34(4):449-461, 2002.
8. C. Bennett, E. Bernstein, G. Brassard, and U. Vazirani. Strengths and weaknesses of quantum computing. SIAM J. Comput., 26(5):1510-1523, 1997.
9. E. Bernstein and U. Vazirani. Quantum complexity theory. SIAM J. Comput., 26(5):1411-1473, 1997.
10. R. B. Boppana, J. Håstad, and S. Zachos. Does co-NP have short interactive proofs? Inf. Proc. Lett., 25:127-132, 1987.
11. 0 circuits. In Proc. IEEE Complexity, p. 3-8, 2009.
12. H. Buhrman, L. Fortnow, I. Newman, and H. Röhrig. Quantum property testing. SIAM J. Comput., 37(5):1387-1400, 2008.
13. C. Daskalakis, P. W. Goldberg, and C. H. Papadimitriou. The complexity of computing a Nash equilibrium. Commun. ACM, 52(2):89-97, 2009.
14. M. Furst, J. B. Saxe, and M. Sipser. Parity, circuits, and the polynomial time hierarchy. Math. Systems Theory, 17:13-27, 1984.
15. D. Gavinsky, J. Kempe, I. Kerenidis, R. Raz, and R. de Wolf. Exponential separation for one-way quantum communication complexity, with applications to cryptography. SIAM J. Comput., 38(5):1695-1708, 2008.
16. A. Klivans and D. van Melkebeek. Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses. SIAM J. Comput., 31:1501-1526, 2002.
17. N. Linial, Y. Mansour, and N. Nisan. Constant depth circuits, Fourier transform, and learnability. J. ACM, 40(3):607-620, 1993.
18. N. Linial and N. Nisan. Approximate inclusion-exclusion. Combinatorica, 10(4):349-365, 1990.
19. A. A. Razborov. Lower bounds for the size of circuits of bounded depth with basis {&,⊕}. Mathematicheskie Zametki, 41(4):598-607, 1987.
20. A. A. Razborov. A simple proof of Bazzi's theorem. ACM Trans. Comput. Theory, 1(1), 2009.
21. A. Shamir. IP=PSPACE. J. ACM, 39(4):869-877, 1992.
22. D. Shepherd and M. J. Bremner. Temporally unstructured quantum computation. Proc. Roy. Soc. London, A465(2105):1413-1439, 2009.
23. P. W. Shor. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput., 26(5):1484-1509, 1997.
24. D. Simon. On the power of quantum computation. In Proc. IEEE FOCS, p. 116-123, 1994.
25. R. Smolensky. Algebraic methods in the theory of lower bounds for Boolean circuit complexity. In Proc. ACM STOC, p. 77-82, 1987.
26. J. Håstad. Computational Limitations for Small Depth Circuits. MIT Press, 1987.
27. J. Watrous. Succinct quantum proofs for properties of finite groups. In Proc. IEEE FOCS, p. 537-546, 2000.
28. A. C-C. Yao. Separating the polynomial-time hierarchy by oracles. In Proc. IEEE FOCS, p. 1-10, 1985.