# 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} }

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.

76 Citations

Adiabatic quantum computation is equivalent to standard quantum computation

- Physics, Computer Science
- 2004

- 419
- PDF

The complexity of quantum spin systems on a two-dimensional square lattice

- Physics, Computer Science
- 2008

- 196
- PDF

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

- Mathematics, Computer Science
- 2013

- 33
- PDF

On the Complexity of Computing Zero-Error and Holevo Capacity of Quantum Channels

- Physics, Mathematics
- 2008

- 64
- PDF

#### References

##### Publications referenced by this paper.

SHOWING 1-6 OF 6 REFERENCES

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