Is the problem in ?
has an efficient quantum algorithm through Lee–Yang theory. Does it also have an efficient classical algorithm?
Discuss this questionFor fixed , let Is deciding the ground-energy promise problem for , with positive polynomially bounded weights and inverse-polynomial promise gap, in ? This is the tractability conjecture of Marwaha–Sud.
containment is established via Rayudu–Takahashi’s Lee–Yang theorem, building on Wong–Bravyi–Gosset–Liu. The open conjecture here is containment. Use one shared within an instance. The theorem does not assert a zero-field spectral gap.
Why this is interesting
The upper bound leaves a concrete classical-versus-quantum question on the same side of the complexity transition.
Explicit variants
Exchange-symmetric classification
For a fixed two-qubit interaction satisfying , classify the promise problem for positive weighted sums of copies of . Allow splitting and mixing within the triplet block, and state whether local fields and geometric restrictions are included. Determine which aspects of singlet/triplet ordering and degeneracy govern , , , or tractable regimes. Local eigenvalue ordering alone is a proposed organizing principle, not a complete classification.
A place to start
Study the simplest instances and identify what a proposed classical sampler must control.
Related work
These works provide context and established results. They need not be the origin of this exact formulation.
Discuss this question
Reading is public. Posting requires a GitHub account. You can also write to Kunal.