Quantum 3-SAT is QMA1-complete

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2013, Pages 756-765

  Gosset, David ^a   Nagaj, Daniel ^b  

^a UNIVERSITY OF WATERLOO   (Canada)

^b UNIVERSITY OF VIENNA   (Austria)

Author keywords

Computational complexity; Quantum computing

Indexed keywords

BOOLEAN SATISFIABILITY; COMPLEXITY CLASS; COMPUTATIONAL HARDNESS; NULL SPACE; QUANTUM COMPUTING; SATISFIABILITY;

COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; QUANTUM COMPUTERS;

QUANTUM THEORY;

EID: 84893439857     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2013.86     Document Type: Conference Paper

References (22)

1. S. Aaronson. On perfect completeness for qma. Quantum Info. Comput., 9(1):81-89, January 2009.
2. A. Ambainis, J. Kempe, and O. Sattath. A quantum lovász local lemma. In Proceedings of the 42nd ACM symposium on Theory of computing, pages 151-160. ACM, 2010.
3. S. Bravyi. Personal communication.
4. S. Bravyi. Efficient algorithm for a quantum analogue of 2-SAT. eprint arXiv:quant-ph/0602108, February 2006. Published in Contemporary Mathematics Volume 536, 2011.
5. S. Bravyi, L. Caha, R. Movassagh, D. Nagaj, and P. W. Shor. Criticality without frustration for quantum spin-1 chains. Phys. Rev. Lett., 109:207202, Nov 2012.
6. S. Bravyi, C. Moore, and A. Russell. Bounds on the quantum satisfiability threshold. In ICS, pages 482-489, 2010.
7. M. Coudron and R. Movassagh. Unfrustration Condition and Degeneracy of Qudits on Trees. e-print arXiv:1209.4395, September 2012.
8. L. Eldar and O. Regev. Quantum sat for a qutrit-cinquit pair is qma1-complete. In ICALP (1), pages 881-892, 2008.
9. D. Gosset and D. Nagaj. Quantum 3-SAT is QMA1-complete. eprint arXiv:1302.0290, February 2013.
10. Z. Ji, Z. Wei, and B. Zeng. Complete characterization of the ground-space structure of two-body frustration-free hamiltonians for qubits. Phys. Rev. A, 84:042338, Oct 2011.
11. S. P. Jordan, H. Kobayashi, D. Nagaj, and H. Nishimura. Achieving perfect completeness in classical-witness quantum merlin-arthur proof systems. Quantum Info. Comput., 12(5- 6):461-471, May 2012.
12. J. Kempe, A. Kitaev, and O. Regev. The complexity of the local hamiltonian problem. SIAM J. Comput., 35(5):1070- 1097, May 2006.
13. A. Yu. Kitaev, A. H. Shen, and M. N. Vyalyi. Classical and Quantum Computation. American Mathematical Society, Boston, MA, USA, 2002.
14. H. Kobayashi, F. LeGall, and H. Nishimura. Stronger methods of making quantum interactive proofs perfectly complete. 4th ACM Innovations in Theoretical Computer Science conference (ITCS 2013), 2013.
15. C. R. Laumann, A. M. Läuchli, R. Moessner, A. Scardicchio, and S. L. Sondhi. Product, generic, and random generic quantum satisfiability. Phys. Rev. A, 81:062345, Jun 2010.
16. C.R. Laumann, R. Moessner, A. Scarddichio, and S. L. Sondhi. Random quantum satisfiability. Quantum Information & Computation, 10(1&2):1-15, 2010.
17. C. Marriott and J. Watrous. Quantum arthur-merlin games. Comput. Complex., 14(2):122-152, June 2005.
18. R. Movassagh, E. Farhi, J. Goldstone, D. Nagaj, T. J. Osborne, and P. W. Shor. Unfrustrated qudit chains and their ground states. Phys. Rev. A, 82(1):012318, July 2010.
19. D. Nagaj. Fast universal quantum computation with railroadswitch local Hamiltonians. Journal of Mathematical Physics, 51(6):062201, June 2010.
20. D. Nagaj and S. Mozes. New construction for a QMA complete three-local Hamiltonian. Journal of Mathematical Physics, 48(7):072104, July 2007.
21. D. Nagaj, P. Wocjan, and Y. Zhang. Fast amplification of qma. Quantum Information & Computation, pages 1053- 1068, 2011.
22. T. J. Osborne. Hamiltonian complexity. Reports on Progress in Physics, 75(2):022001, February 2012.