Manuscript OpenAI@2026-10-07 · OpenAI.tex · remark · 6a931f8f
Remark: 274-02. Regular trajectories, pruning and quantum parity
Manuscript map · lines 7965–7974
OpenAI@2026-10-07#rem:oai-p-274-02
Authors: OpenAI. Family 274.
Title: Regular trajectories, pruning and quantum parity.
Abstract: We prove that constant-depth quantum circuits with arbitrary one-qubit gates and unbounded-arity Toffoli gates cannot compute parity with any fixed positive worst-case advantage using polynomially many total qubits. Ancillary qubits are initialized to $|0{}rangle$, one output qubit is measured, and all other final registers may be discarded without restriction. This resolves Moore's parity conjecture in the measured-output model.
This abstract is a catalogue record. It is not a verification and not a premise. It does not close O.1. O.1 stays NOT_CLOSED. No quantum coefficient is admitted. No compilation is asserted.
Nearby in this section
- section: Manuscript map
- remark: Remark: 001-01. Milne's rationality conjecture for abelian varieties
- remark: Remark: 002-01. Exact Birch–Swinnerton-Dyer Formula from Low Selmer Corank
- remark: Remark: 002-02. The Selmer converse for elliptic curves at every prime
- remark: Remark: 002-03. The two-primary Birch–Swinnerton-Dyer formula in Selmer corank at most one
- remark: Remark: 003-01. The Quasi-Riemann Hypothesis: A Zero-Free Half-Plane s 7/8
- remark: Remark: 003-02. The Quasi-Riemann Hypothesis (alternate 11/12 proof)
- remark: Remark: 003-03. Uniform exclusion of Landau–Siegel zeros