OpenAI reports a QAC⁰ parity lower bound

For every fixed depth, polynomial qubit bound and ε>0, sufficiently large measured-output quantum circuits using arbitrary one-qubit and unbounded-arity Toffoli gates have some input on which parity succeeds with probability below 1/2+ε.

Curated contributions 1

Understand the problem ↓

OpenAI reports a QAC⁰ parity lower bound

  • Theoretical Computer Science

For every fixed depth, polynomial qubit bound and ε>0, sufficiently large measured-output quantum circuits using arbitrary one-qubit and unbounded-arity Toffoli gates have some input on which parity succeeds with probability below 1/2+ε.

AI involvementAI-led
ImportanceMajor
Technical verificationFormal (Lean 4)
Human understandingFew

Understanding the problem

Read the background

For every fixed depth, polynomial qubit bound and ε>0, sufficiently large measured-output quantum circuits using arbitrary one-qubit and unbounded-arity Toffoli gates have some input on which parity succeeds with probability below 1/2+ε.

Why it matters

If correct, resolves Moore’s QAC⁰ parity conjecture under the stated measured-output circuit model.

What counts as progress

Can constant-depth quantum circuits compute parity with fixed positive worst-case advantage?

Website timeline

Publication dates and editorial changes.