Quantum Arthur-Merlin games

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn 19, Issue , 2004, Pages 275-285

  Marriott, Chris ^a   Watrous, John ^a  

^a UNIVERSITY OF CALGARY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; ERROR ANALYSIS; GAME THEORY; POLYNOMIALS; QUANTUM THEORY;

QUANTUM ARTHUR-MERLIN GAMES; QUANTUM CERTIFICATES; SOUNDNESS ERRORS;

COMPUTER SCIENCE;

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

References (23)

1. D. Aharonov and T. Naveh. Quantum NP - a survey. arXiv.org e-Print quant-ph/0210077, 2002.
2. D. Aharonov and O. Regev. A lattice problem in quantum NP. In Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, pages 210-219, 2003.
3. L. Babai. Trading group theory for randomness. In Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing, pages 421-429, 1985.
4. L. Babai and S. Moran. Arthur-Merlin games: a randomized proof system, and a hierarchy of complexity classes. Journal of Computer and System Sciences, 36(2):254-276, 1988.
5. H. Buhrman, R. Cleve, J. Watrous, and R. de Wolf. Quantum fingerprinting. Physical Review Letters, 87(16): article 167902, 2001.
6. L. Fortnow and J. Rogers. Complexity limitations on quantum computation. Journal of Computer and System Sciences, 59(2):240-252, 1999.
7. S. Goldwasser and M. Sipser. Private coins versus public coins in interactive proof systems. In S. Micali, editor, Randomness and Computation, volume 5 of Advances in Computing Research, pages 73-90. JAI Press, 1989.
8. D. Janzing, P. Wocjan, and T. Beth. "Identity check" is QMA-complete. arXiv.org e-Print quant-ph/0305050, 2003.
9. J. Kempe and O. Regev. 3-Local Hamiltonian is QMA-complete. Quantum Information and Computation, 3(3):258-264, 2003.
10. A. Kitaev. Quantum computations: algorithms and error correction. Russian Mathematical Surveys, 52(6): 1191-1249, 1997.
11. A. Kitaev. "Quantum NP". Talk at AQIP'99: Second Workshop on Algorithms in Quantum Information Processing, DePaul University, January 1999.
12. A. Kitaev, A. Shen, and M. Vyalyi. Classical and Quantum Computation, volume 47 of Graduate Studies in Mathematics. American Mathematical Society, 2002.
13. A. Kitaev and J. Watrous. Parallelization, amplification, and exponential time simulation of quantum interactive proof system. In Proceedings of the 32nd ACM Symposium on Theory of Computing, pages 608-617, 2000.
14. E. Knill. Quantum randomness and nondeterminism. Technical Report LAUR-96-2186, Los Alamos National Laboratory, 1996. arXiv.org e-Print quant-ph/9610012.
15. H. Kobayashi, K. Matsumoto, and T. Yamakami. Quantum Merlin-Arthur proof systems: Are multiple Merlins more helpful to Arthur? In Proceedings of the 14th Annual International Symposium on Algorithms and Computation, 2003.
16. A. Nayak and P. Shor. On bit-commitment based quantum coin flipping. arXiv.org e-Print quant-ph/0206123, 2002.
17. M. A. Nielsen and I. L. Chuang. Quantum Computation and Quantum Information. Cambridge University Press, 2000.
18. N. Nisan and A. Wigderson. Hardness vs. randomness. Journal of Computer and System Sciences, 49(2): 149-167, 1994.
19. R. Raz and A. Shpilka. On the power of quantum proofs. In Proceedings of the Nineteenth Annual IEEE Conference on Computational Complexity, 2004.
20. R. Spekkens and T. Rudolph. Degrees of concealment and bindingness in quantum bit-commitment protocols. Physical Review A, 65: article 123410, 2002.
21. M. Vyalyi. QMA=PP implies that PP contains PH. Electronic Colloquium on Computational Complexity Report TR03-021, 2003.
22. J. Watrous. Succinct quantum proofs for properties of finite groups. In Proceedings of the 41st Annual Symposium on Foundations of Computer Science, pages 537-546, 2000.
23. J. Watrous. PSPACE has constant-round quantum interactive proof systems. Theoretical Computer Science, 292(3):575-588, 2003.