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+ε.