A new construction for a QMA complete 3-local Hamiltonian

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

11 pages, 4 figures

Scientific paper

10.1063/1.2748377

We present a new way of encoding a quantum computation into a 3-local Hamiltonian. Our construction is novel in that it does not include any terms that induce legal-illegal clock transitions. Therefore, the weights of the terms in the Hamiltonian do not scale with the size of the problem as in previous constructions. This improves the construction by Kempe and Regev, who were the first to prove that 3-local Hamiltonian is complete for the complexity class QMA, the quantum analogue of NP. Quantum k-SAT, a restricted version of the local Hamiltonian problem using only projector terms, was introduced by Bravyi as an analogue of the classical k-SAT problem. Bravyi proved that quantum 4-SAT is complete for the class QMA with one-sided error (QMA_1) and that quantum 2-SAT is in P. We give an encoding of a quantum circuit into a quantum 4-SAT Hamiltonian using only 3-local terms. As an intermediate step to this 3-local construction, we show that quantum 3-SAT for particles with dimensions 3x2x2 (a qutrit and two qubits) is QMA_1 complete. The complexity of quantum 3-SAT with qubits remains an open question.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

A new construction for a QMA complete 3-local Hamiltonian does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A new construction for a QMA complete 3-local Hamiltonian, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A new construction for a QMA complete 3-local Hamiltonian will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-476661

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.