Corpus ID: 1184338

3-local Hamiltonian is QMA-complete

@article{Kempe20033localHI,
  title={3-local Hamiltonian is QMA-complete},
  author={J. Kempe and O. Regev},
  journal={Quantum Inf. Comput.},
  year={2003},
  volume={3},
  pages={258-264}
}
  • J. Kempe, O. Regev
  • Published 2003
  • Physics, Computer Science, Mathematics
  • Quantum Inf. Comput.
  • It has been shown by Kitaev that the 5-local Hamiltonian problem is QMA-complete. Here we reduce the locality of the problem by showing that 3-local Hamiltonian is already QMA-complete. 

    Topics from this paper.

    The Complexity of the Local Hamiltonian Problem
    • 405
    • PDF
    Universal computation by quantum walk.
    • 492
    • PDF
    Adiabatic quantum computation is equivalent to standard quantum computation
    • 419
    • PDF
    The complexity of quantum spin systems on a two-dimensional square lattice
    • 196
    • PDF
    Hamiltonian complexity.
    • 68
    • PDF
    The local Hamiltonian problem on a line with eight states is QMA-complete
    • 33
    • PDF
    Consistency of Local Density Matrices Is QMA-Complete
    • 72
    • PDF
    Quantum Arthur–Merlin games
    • 190
    • PDF
    Quantum Hamiltonian Complexity
    • 80
    • PDF
    On the Complexity of Computing Zero-Error and Holevo Capacity of Quantum Channels
    • 64
    • PDF

    References

    Publications referenced by this paper.
    SHOWING 1-6 OF 6 REFERENCES
    Quantum NP - A Survey
    • 142
    • PDF
    The 2-local Hamiltonian problem encompasses NP
    • 16
    • PDF
    Classical and quantum computation, volume
    • 2002
    Kitaev
    • 2002
    Classical and quantum computation, volume 47 of Graduate Studies in Mathematics
    • 2002
    Universality of adiabatic quantum computation with two-body interactions