Quantum SAT for a qutrit-cinquit pair is QMA1-complete

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5125 LNCS, Issue PART 1, 2008, Pages 881-892

  Eldar, Lior ^a   Regev, Oded ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

LINGUISTICS;

SAT PROBLEMS;

TRANSLATION (LANGUAGES);

EID: 49049095075     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70575-8_72     Document Type: Conference Paper

References (8)

1. Papadimitriou, C.H.: Computational Complexity. Addison Wesley Longman, Amsterdam (1995)
2. Kitaev, A.Y., Shen, A.H., Vyalyi, M.N.: Classical and quantum computation. Graduate Studies in Mathematics, vol. 47. AMS, Providence (2002)
3. Kempe, J., Regev, O.: 3-local Hamiltonian is QMA-complete. Quantum Information & Computation 3(3), 258-264 (2003)
4. Kempe, J., Kitaev, A., Regev, O.: The complexity of the local Hamiltonian problem. SIAM Journal of Computing 35(5), 1070-1097 (2006)
5. Bravyi, S.: Efficient algorithm for a quantum analogue of 2-SAT. ArXiv Quantum Physics e-prints (2006)
6. Nagaj, D., Mozes, S.: New construction for a QMA complete three-local Hamiltonian. Journal of Mathematical Physics 48, 2104 (2007)
7. Nagaj, D., Love, P.: (in preparation, 2007)
8. Aharonov, D., van Dam, W., Kempe, J., Landau, Z., Lloyd, S., Regev, O.: Adiabatic quantum computation is equivalent to standard quantum computation. SIAM Journal on Computing 37(1), 166-194 (2007)