The local Hamiltonian problem on a line with eight states is QMA-complete

The Local Hamiltonian problem is the problem of estimating the least eigenvalue of a local Hamiltonian, and is complete for the class QMA. The 1D problem on a chain of qubits has heuristics which work well, while the 13-state qudit case has been shown to be QMA-complete. We show that this problem remains QMA-complete when the dimensionality of the qudits is brought down to 8.

[1]  Adam D. Bookatz.  QMA-complete problems , 2012, Quantum Inf. Comput..

[2]  Julia Kempe,et al.  3-local Hamitonian is QMA-complete , 2003 .

[3]  Julia Kempe,et al.  3-local Hamiltonian is QMA-complete , 2003, Quantum Inf. Comput..

[4]  Daniel Nagaj,et al.  Criticality without frustration for quantum spin-1 chains. , 2012, Physical review letters.

[5]  Mikhail N. Vyalyi,et al.  Classical and Quantum Computation , 2002, Graduate studies in mathematics.

[6]  Sandy Irani,et al.  The Power of Quantum Systems on a Line , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[7]  Oded Regev,et al.  Quantum SAT for a Qutrit-Cinquit Pair Is QMA1-Complete , 2008, ICALP.

[8]  Dorit Aharonov,et al.  Quantum NP - A Survey , 2002, quant-ph/0210077.

[9]  Barbara M. Terhal,et al.  The complexity of quantum spin systems on a two-dimensional square lattice , 2008, Quantum Inf. Comput..

[10]  Sergey Bravyi,et al.  Efficient algorithm for a quantum analogue of 2-SAT , 2006, quant-ph/0602108.

[11]  Daniel Nagaj.  Fast universal quantum computation with railroad-switch local Hamiltonians , 2009, 0908.4219.

[12]  Julia Kempe,et al.  The Complexity of the Local Hamiltonian Problem , 2004, FSTTCS.