Computer science / Conjecture

Quantum PCP Conjecture

Is approximating local-Hamiltonian ground energy to constant relative precision QMA-hard?

The source trail 2

Findings, with context

DiscussionFound Sep 20, 2026

drops.dagstuhl.de contains the excerpt below in a discussion related to Quantum PCP. Read the source for the surrounding context.

“for the same reason, these Hamiltonians contain no computational hardness.”

This excerpt is evidence of what the linked page says, not verification of its claims. Publication date has not been established.

Source pageIndirect account · Found Sep 20

DiscussionFound Sep 19, 2026

drops.dagstuhl.de contains the excerpt below in a discussion related to Quantum PCP. Read the source for the surrounding context.

“After nearly two decades of research, the question of a quantum PCP theorem for quantum Constraint Satisfaction Problems (CSPs) remains wide open.”

This excerpt is evidence of what the linked page says, not verification of its claims. Publication date has not been established.

Source pageIndirect account · Found Sep 19