Product-projection localization and the QAC0 parity lower bound
AI contributions · unreleased internal OpenAI modelView details
Ancillary data · Formal proof, 6 proof or workflow linksView
Abstract — v1
We prove that constant-depth quantum circuits with arbitrary one-qubit and unbounded-arity Toffoli gates cannot compute parity with any fixed positive worst-case advantage using polynomially many qubits. Ancillas start in zero, only one output qubit is measured, and all final garbage is unrestricted. This resolves Moore's parity conjecture in the measured-output model.
Review conversation
No reviews from the Hub API for this paper.