Rosenthal-Yuen question: unitaryQIP = unitaryPSPACE
Rosenthal and Yuen introduced the unitary synthesis classes (unitaries synthesizable by a polynomial-time quantum verifier interacting with an untrusted prover) and (unitaries implementable in polynomial space), and left both inclusions open: is every family in with nontrivial completeness and soundness, and is every family implementable by space-uniform circuits? Does , the unitary analogue of and ?
- Result
- Proved(see note)
- Status
- Candidate (review pending)
- AI contribution
- AI co-developed
- Method
- Argument
- Field
- Quantum complexity theory; unitary synthesis
- Posed by
- Gregory Rosenthal and Henry Yuen, Interactive proofs for synthesizing quantum states and unitaries (arXiv 2108.07192; ITCS 2022), open problems
- Year posed
- 2021
- Years open
- 5y
- Solved
- 2026-11-02
- Model
- GPT-6
- Vendor
- OpenAI
- Collaborators
- Entong He, Fengning Ou, Mingnan Zhao
- Verification
- Unreviewed
- Publication
- Preprint
- Significance
- 20 / 100
- Disclosed cost
- —
- Wikipedia
- No dedicated article
What was actually shown
With requiring perfect completeness, soundness and every inverse-polynomial synthesis error, and every inverse-polynomial error, . One inclusion simulates any protocol in polynomial space via an acceptance-rigidity lemma and the Metger-Yuen prover; the other synthesizes families in polynomial time with a oracle, building on OpenAI's unitary synthesis construction, and replaces the oracle by states obtained interactively. Also: constant-round protocols given polynomially many input copies, and a barrier for EFI pairs. Caveat: relies on an arbitrary-precision form of OpenAI's construction proved in the appendix.
What the AI did
AI disclosure in the paper: 'OpenAI GPT-6 was used extensively throughout the preparation of this manuscript, including for mathematical formulation, checking proof arguments, typesetting, and language polishing. The idea behind our proof of unitaryPSPACE in unitaryQIP originated in an early discussion among the authors that assumed a positive answer to the unitary synthesis problem. Prompted by the authors, GPT-6 helped sketch the argument that, for unitaryPSPACE families, the oracles in the unitary synthesis problem can be replaced by a PSPACE language. The authors have reviewed and verified the manuscript and take full responsibility for its content.' The reverse inclusion also builds on OpenAI's AI-produced unitary synthesis construction.
Verification
No independent mathematician has checked this yet. Checked here on 15 November 2026 against the arXiv v1 TeX source: introduction, main theorems, AI disclosure, and the restatement of OpenAI's unitary synthesis theorem, read against the TeX source of Rosenthal and Yuen (arXiv 2108.07192), whose open problems ask for with nontrivial completeness and soundness, and for space-uniform circuits implementing families. The equality answers both, with classes defined as in Rosenthal-Yuen and Metger-Yuen (inverse-polynomial synthesis error). One discrepancy: the paper restates OpenAI's Theorem 1.1 with precision , but OpenAI's Theorem 1.1 (identical PDF at the catalog's commit and on main) gives diamond-norm error at most 1/2; the arbitrary-precision version is proved in this paper's own appendix. Neither the appendix nor the rest of the proof was refereed here.
Sources
Submitted by MellowGander562 on