PDE and mathematical physics · Oct 6, 2026
Polynomial-time unitary synthesis from a Boolean oracle
Solves the constant-error Aaronson–Kuperberg unitary synthesis problem: a uniform polynomial-size quantum oracle circuit approximates every n-qubit unitary channel within diamond-norm error 1/2, after a suitable Boolean oracle is chosen. Gates, qubits, oracle calls and query length are polynomially bounded. The target-dependent oracle may have an unrestricted truth table; its efficient classical construction is not asserted.
Contributors
Unreleased OpenAI model
AI systems: Unreleased OpenAI model