Commutative version of the local hamiltonian problem and common eigenspace problem

Quantum Information and Computation

Volumn 5, Issue 3, 2005, Pages 187-215

  Bravyi, Sergey ^a   Vyalyi, Mikhail ^b  

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

^b INDEPENDENT UNIVERSITY OF MOSCOW   (Russian Federation)

Author keywords

Multipartite entanglement; Quantum codes; Quantum complexity

Indexed keywords

EIGENVALUES AND EIGENFUNCTIONS; NP-HARD; QUANTUM COMPUTERS;

COMPOSITE QUANTUM SYSTEMS; EIGENVALUE EQUATIONS; HERMITIAN OPERATORS; LOCAL HAMILTONIANS; MULTIPARTITE ENTANGLEMENTS; QUANTUM CODES; QUANTUM COMPLEXITY; REAL NUMBER;

QUANTUM ENTANGLEMENT;

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

References (20)

1. S. Aaronson, The complexity zoo, http://www.complexityzoo.com/
2. A. Kitaev, A. Shen, and M. Vyalyi (2002), Classical and quantum computation, AMS.
3. D. Aharonov and T. Naveh (2002), Quantum NP - a survey, quant-ph/0210077.
4. J. Watrous (2000), Succinct quantum proofs for properties of finite groups, Proceedings of IEEE FOCS, p. 537.
5. J. Kempe and O. Regev (2003), 3-Local Hamiltonian is QMA-complete, Quantum Information and Computation, Vol. 3(3), p. 258-64.
6. J. Kempe, A. Kitaev, and O. Regev (2004), The Complexity of the Local Hamiltonian Problem, quant-ph/0406180.
7. D. Janzing, P. Wocjan, and Th. Beth (2003), Identity check is QMA-complete, quant-ph/0305050.
8. P. Wocjan and Th. Beth (2003), The 2-local Hamiltonian problem encompasses NP, International Journal of Quantum Information, Vol. 1(3), p. 349-357.
9. H. Briegel and R. Raussendorf, Persistent entanglement in arrays of interacting particles, quant-ph/0004051.
10. P. Hayden, R. Jozsa, D. Petz, A. Winter (2004), Structure of states which satisfy strong subadditivity of quantum entropy with equality, Commun. Math. Phys., 246(2), p. 359.
11. B. Terhal and D. DiVincenzo (2004), Adaptive quantum computation, constant depth quantum circuits and Arthur-Merlin games, Quantum Information and Computation, Vol. 4(2), p. 122-133.
12. A. Calderbank, E. Rains, P. Shor, and N. Sloane (1996), Quantum error correction and orthogonal geometry, Phys. Rev. Lett. 78, p. 405; quant-ph/9605005.
13. A. Aho, J. Hopcroft, and J. Ullman (1974), The Design and Analysis of Computer Algorithms, Addison-Wesley Reading, Massachusetts.
14. D. Bini and V.Y. Pan (1994), Polynomial and matrix computation, Vol. 1. Birkhäuser, Boston, Cambridge, MA.
15. M. Takesaki (1979), Theory of operator algebras I, Springer-Verlag, New York-Heidelberg-Berlin.
16. E. Knill, R. Laflamme, and L. Viola (2000), Theory of Quantum Error Correction for General Noise, Phys. Rev. Lett. 84, p. 2525.
17. M. Nielsen and I. Chuang (2000), Quantum Computation and Quantum Information, Cambridge University Press.
18. This Lemma and its proof were suggested by the referee of the paper.
19. S. Kochen and E. P. Specker (1967), The problem of hidden variables in quantum mechanics, J. Math. Mech. 17, p. 59.
20. A. Peres (1991), Two simple proofs of the Kochen-Specker theorem, Journal of Physics A24, p. L175.