CoChat

New construction for a QMA complete three-local Hamiltonian

Open access
Nagaj, Daniel, Mozes, Shay · 2007 · Journal of Mathematical Physics
Cited by 62

The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.

Abstract

We present a new way of encoding a quantum computation into a three-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 [Quantum Inf. Comput. 3, 258–264 (2003); e-print quant-ph∕0302079] who were the first to prove that three-local Hamiltonian is complete for the complexity class QMA, the quantum analog of NP. Quantum k-SAT, a restricted version of the local Hamiltonian problem using only projector terms, was introduced by Bravyi (e-print quant-ph∕0602108) as an analog of the classical k-SAT problem. Bravyi proved that quantum 4-SAT is complete for the class QMA with one-sided error (QMA1) and that quantum 2-SAT is in P. We give an encoding of a quantum circuit into a quantum 4-SAT Hamiltonian using only three-local terms. As an intermediate step to this three-local construction, we show that quantum 3-SAT for particles with dimensions 3×2×2 (a qutrit and two qubits) is QMA1 complete. The complexity of quantum 3-SAT with qubits remains an open question.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1063/1.2748377

Cites

2 of 2 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 2 references

Cited by

See all 62

Metadata

Authors
Nagaj, D., & Mozes, S.
Venue
Journal of Mathematical Physics
Published
2007-07-01
Volume
48
Issue
7
ISSN
  • 0022-2488 (ISSN-L)
  • 1089-7658
OpenAlex
W1576319607
Cited by
62
References
2
FWCI
4.73
Type
journal article
Language
en
Open access
green

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: New construction for a QMA complete three-local Hamiltonian. https://app.cochat.ai/papers/10.1063/1.2748377
The paper
Nagaj, D., & Mozes, S. (2007). New construction for a QMA complete three-local Hamiltonian. Journal of Mathematical Physics. https://doi.org/10.1063/1.2748377

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.