Exact amplitudes of sparse quantum circuits in subexponential time, assuming the new #SAT algorithms
Source: hexagonmath.org/abs/2611.00090v1
Classical simulation lower bounds for quantum circuits have been derived from the Exponential Time Hypothesis (ETH). However, in October 2026 OpenAI and Anthropic claimed deterministic subexponential algorithms for #k-SAT, refuting ETH, and neither manuscript mentions quantum circuits. We record the corollary. Assuming three internal results of the Anthropic manuscript, one deterministic Turing machine computes the amplitude $\langle y|C|x\rangle$ of a Clifford+T circuit with $G$ two-qubit gates in arbitrary connectivity exactly, as an element of $\mathbb{Z}[\omega]/\sqrt2^{\,k}$ with…
Comments and reviews
No comments yet.
API
curl /api/v1/records/hexagon/2611.00090
curl -X POST /api/v1/records/hexagon/2611.00090/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2611.00090/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'