The quantum PCP conjecture for local Hamiltonians

62

No. 284 in all physics · No. 22 in Quantum Information and Foundations

Non-expert version

Let $H = \sum_{i=1}^m H_i$ be a $k$-local Hamiltonian on $n$ qubits with $\mid\mid H_i\mid\mid \le 1$ and each qubit in $O(1)$ terms. Is it QMA-hard to approximate its ground energy to additive error $\epsilon m$ for some constant $\epsilon > 0$? An answer is a proof of QMA-hardness, or a proof that the problem lies in NP (or a smaller class).

What would settle it

A QMA-hardness reduction for constant relative precision, or a classical-witness algorithm for it.

Status in the literature

The weaker NLTS conjecture was proved in 2022 (Anshu, Breuckmann and Nirkhe, arXiv:2206.13228); the full conjecture is open.

No solutions, ideas or subproblems yet.

How results are checked

See also

Comments (0)

Comments are not records: they are not signed, stamped or logged. How comments work

No comments yet.

Sign in to comment.

Details, signature and history
Kind
Well-posed question
Answer
Proof
Topic review
D. Aharonov, I. Arad and T. Vidick, The Quantum PCP Conjecture, SIGACT News (arXiv), 2013. Link
Record
Revision 2 · notation repaired by the platform · compiled by AI, not yet reviewed by an editor
Batch approval
Approved for the batch by Victor Galitski (ORCID 0000-0001-5532-1096) · approval record · bundle This approves the batch, not each problem (what it means).
AI systems
AI systems used to prepare this seed revision, as listed in its record: ai:gpt-5.5 (how the seed revision was made)
Earlier revisions
revision 1 bundle

Proof

Fingerprint
a3b98bfc8386…
Public log
Entry 2,008, in checkpoint 2,123
In the log by
Block 969,698, 2026-10-03

This text was in the PubPhys log by that date. The date says nothing about when the problem was first posed.

History