Manuscript OpenAI@2026-10-07 · OpenAI.tex · remark · 6a931f8f
Remark: Family 274. Moore's parity conjecture for (QAC) 0
Family claims › Mathematical physics · lines 1812–1817
OpenAI@2026-10-07#rem:oai-274
Resolves Moore's parity conjecture in the measured-output model: constant-depth quantum circuits with arbitrary one-qubit gates, unbounded-arity Toffoli gates and polynomially many total qubits cannot compute parity with any fixed positive worst-case advantage. Ancillas start in zero, one output qubit is measured, and all other registers may be discarded. Xu–Li's reductions give the same bounded-error obstruction for strict majority.
The authors are OpenAI. This companion does not verify the proof. The claim is not a theorem of the Enter series and not a premise of any registered sheet. It does not close O.1. O.1 stays NOT_CLOSED. It is not a de Sitter state and not the QdS external-leg scheme. No quantum coefficient is admitted. No compilation is asserted.
Nearby in this section
- remark: Remark: Family 260. Spacetime Penrose inequalities and rigidity
- remark: Remark: Family 261. Localization and delocalization in the Anderson model
- remark: Remark: Family 262. Sharp one-dimensional Lieb–Thirring inequalities
- remark: Remark: Family 263. The ionization and generalized ionization conjectures
- remark: Remark: Family 264. Strong cosmic censorship near two-ended Kerr data
- remark: Remark: Family 265. The two-dimensional gapped area law
- remark: Remark: Family 266. Exactly three mutually unbiased bases in dimension six
- remark: Remark: Family 267. Positive-temperature Bose–Einstein condensation and quantum depletion