NP vs QMAlog(2)

Quantum Information and Computation

Volumn 10, Issue 1-2, 2010, Pages 141-151

  Beigi, Salman ^a  

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

3 SAT; Merlin Arthur; Separable states

Indexed keywords

QUANTUM THEORY;

3-COLORING; 3-SAT; MERLIN-ARTHUR; QUANTUM ALGORITHMS; SEPARABLE STATE;

NP-HARD;

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

References (15)

1. E. Knill, Quantum randomness and nondeterminism, Technical Report LAUR-96-2186, Los Alamos National Laboratory, 1996, quantph/9610012.
2. A. Kitaev, Quantum NP, AQIP99: Second Workshop on Algorithms in Quantum Information Processing, 1999.
3. J. Watrous, Succinct quantum proofs for properties of finite groups, Proceedings of IEEE FOCS'2000, pp. 537-546, 2000.
4. A. Kitaev, A. Shen, and M. N. Vyalyi, Classical and Quantum Computation, American Mathematical Society, 2002.
5. H. Kobayashi, K. Matsumoto, and T. Yamakami, Quantum Certificate Verification: Single versus Multiple Quantum Certificates, quant-ph/0110006.
6. H. Kobayashi, K. Matsumoto, and T. Yamakami, Quantum Merlin-Arthur Proof Systems: Are Multiple Merlins More Helpful to Arthur?, Lecture Notes in Computer Science, 2003, vol. 2906, pp. 189-198.
7. S. Aaronson, S. Beigi, A. Drucker, B. Fefferman, and P. Shor, The Power of Unentanglement, Theory of Computing, 5 (2009) pp. 1-42.
8. Hugue Blier and Alain Tapp, All languages in NP have very short quantum proofs, Proceedings of the ICQNM, 2009, 34-37.
9. Leonid Gurvits, Classical complexity and quantum entanglement, Journal of Computer and System Sciences, 69 (2004) 448-484.
10. M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information, Cambridge University Press, Cambridge, 2000.
11. Michael Sipser, Introduction to the Theory of Computation, PWS Publishing Company, 2005.
12. C. H. Papadimitriou, Computational Complexity, Addison-Wesley Publishing Company, Inc., 1994.
13. Chris Marriott and John Watrous, Quantum Arthur-Merlin Games, Computational Complexity, 14(2): 122-152, 2005.
14. A. Ben-Tal and A. Nemirovski, Robust convex optimization, Mathematics of Operational Research, Vol. 23, 4 (1998), 769-805.
15. Dorit Aharonov and Tomer Naveh, Quantum NP - A Survey, quant-ph/0210077.