On perfect completeness for QMA

Quantum Information and Computation

Volumn 9, Issue 1-2, 2009, Pages 81-89

  Aaronson, Scott ^a  

^a USA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

QUANTUM COMPLEXITY CLASS;

EID: 66449126829     PISSN: 15337146     EISSN: None     Source Type: Journal    
DOI: 10.26421/qic9.1-2-5     Document Type: Article

References (15)

1. L. Babai. Trading group theory for randomness. In Proc. ACM STOC, pages 421-429, 1985.
2. S. Zachos and M. Fürer. Probabilistic quantifiers vs. distrustful adversaries. In Proc. Foundations of Software Technology and Theoretical Computer Science (FSTTCS), pages 443-455. Springer- Verlag, 1987.
3. C. Lautemann. BPP and the polynomial hierarchy. Inform. Proc. Lett., 17:215-217, 1983.
4. O. Goldreich and D. Zuckerman. Another proof that BPP ⊆ PH (and more). ECCC TR97-045, 1997.
5. A. Kitaev, A. Shen, and M. N. Vyalyi. Classical and Quantum Computation.American Mathematical Society, 2002.
6. J. Watrous. Succinct quantum proofs for properties of finite groups. In Proc. IEEE FOCS, pages 537-546, 2000. cs.CC/0009002.
7. D. Aharonov and T. Naveh. Quantum NP - a survey. quant-ph/0210077, 2002.
8. C. Marriott and J. Watrous. Quantum Arthur-Merlin games. Computational Complexity, 14(2):122-152, 2005.
9. S. Bravyi. Efficient algorithm for a quantum analogue of 2-SAT. quant-ph/0602108, 2006.
10. A. Kitaev and J. Watrous. Parallelization, amplification, and exponential-time simulation of quantum interactive proof systems. In Proc. ACM STOC, pages 608-617, 2000.
11. S. Aaronson and G. Kuperberg. Quantum versus classical proofs and advice. Theory of Computing, 3(7):129-157, 2007. Previous version in Proceedings of CCC 2007. quant-ph/0604056.
12. D. Alekseevsky, A. Kriegl, M. Losik, and P. W. Michor. Choosing roots of polynomials smoothly. Israel Journal of Mathematics, 105:203-233, 1998.
13. R. Beals, H. Buhrman, R. Cleve, M. Mosca, and R. de Wolf. Quantum lower bounds by polynomials. J. ACM, 48(4):778-797, 2001. Earlier version in IEEE FOCS 1998, pp. 352-361. quant-ph/9802049.
14. E. Bernstein and U. Vazirani. Quantum complexity theory. SIAM J. Comput., 26(5):1411-1473, 1997. First appeared in ACM STOC 1993.
15. A with probability 1. SIAM J. Comput., 10(1):96-113, 1981.