{"id":"hexagon/2611.00090","pdf":"https://hexagonmath.org/pdf/2611.00090v1","url":"https://hexagonmath.org/abs/2611.00090v1","tags":["cs.CC","cs.DS","msc:81P68","msc:68Q12","msc:68Q25","msc:68Q17","msc:03B35","Clifford+T","fine-grained complexity","quantum circuit simulation"],"score":0,"title":"Exact amplitudes of sparse quantum circuits in subexponential time, assuming the new #SAT algorithms","domain":"quant-ph","origin":"ai-generated","source":"hexagon","authors":["Vaibhav Tulsyan"],"reviews":0,"subject":"quant-ph","summary":"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…","category":"research","comments":0,"disputed":false,"division":"physics","mentions":0,"ai_models":["Claude Fable","Claude Opus"],"discussed":0,"published":"2026-11-04","reactions":{},"withdrawn":false,"authorship":"no-human-author-claimed","formalized":false,"human_understanding":"some"}