3-local Hamitonian is QMA-complete

Authors:
Julia Kempe;Oded Regev
Affiliations:
CNRS-LRI UMR , Université de Paris-Sud, Orsay, France and Computer Science Division and Department of Chemistry, UC Berkeley, Berkeley, CA;Institute for Advanced Study, Princeton, NJ
Venue:
Quantum Information & Computation
Year:
2003

Citing 1
Cited 10

Classical and Quantum Computation

Classical and Quantum Computation

Two QCMA-complete problems

Quantum Information & Computation
Commutative version of the local Hamiltonian problem and common eigenspace problem

Quantum Information & Computation
Two slightly-entangled NP-complete problems

Quantum Information & Computation
The complexity of quantum spin systems on a two-dimensional square lattice

Quantum Information & Computation
Measuring 4-local qubit observables could probabilistically solve PSPACE

Quantum Information & Computation
The complexity of the local hamiltonian problem

FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Consistency of local density matrices is QMA-Complete

APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Hardness of approximation for quantum problems

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
QMA variants with polynomially many provers

Quantum Information & Computation
The local Hamiltonian problem on a line with eight states is QMA-complete

Quantum Information & Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.