Not evaluated
Polynomial-time, constant-error unitary synthesis from a Boolean oracle (family 283)
The gist
On October 6, 2026, OpenAI announced, from an unreleased internal model, a manuscript dated October 5, 2026 on polynomial-time unitary synthesis from a Boolean oracle.
DiscoverIA status on October 12, 2026: not evaluated, meaning no third-party evaluation found.
AI draft, not reviewedWhat has not been reviewed?
Text written by an AI (DiscoverIA pipeline), on . The status and its sources come from the registry; only the explanatory text has not been reviewed. A reported error is corrected, then the text is reviewed.
Cite this entry
A single status snapshot since Oct 12, 2026: a citation always points to a dated snapshot.
Cite snapshot 1, Oct 12, 2026
APA citation with the dated link
BibTeX @misc, key discoveria-oai-fam-283-polynomial-time-constant-error-unitary-r1
@misc{discoveria-oai-fam-283-polynomial-time-constant-error-unitary-r1,
author = {{DiscoverIA}},
title = {Polynomial-time, constant-error unitary synthesis from a Boolean oracle (family 283)},
howpublished = {DiscoverIA registry, entry oai-fam-283-polynomial-time-constant-error-unitary},
note = {Status “Not evaluated”, snapshot 1, recorded on October 12, 2026. New result},
year = {2026},
url = {https://discoveria.ai/entry/oai-fam-283-polynomial-time-constant-error-unitary#releve-1},
urldate = {2026-10-12}
}Dated link opens this snapshot in the history
To understand ≈ 20 s reading time, estimated
What it changes
A unitary is a reversible quantum operation. If the manuscript were correct, it would give a method for producing one whose running time is bounded by a polynomial.
What remains unclear
No Lean proof (Lean is a language in which a computer checks every step of a proof) is supplied for this family, and no third-party assessment is recorded. The sources read do not say what quantity the time is polynomial in, nor under what assumptions the synthesis works.
For experts
Sources, method, key facts, status history, report an error
Status
Not evaluated
Recorded on · github.com · README.md
Step 1 of 4 on the scale: not evaluated. Next step: under review.
- Announced
- Recordednot evaluated
- nextTo follow
What this status means
Source reading : Source read word for word (level 3 of 3)
The result is declared neither right nor wrong.
To move to “Under review”: a public review under way. To “Peer reviewed”: a journal publication or a review by named experts.
Sources
- Main sourcegithub.com · CONTENTS.mdlink only, reading not recorded
- Repositorygithub.com · Polynomial-Time-Unitary…link only, reading not recorded
Method
The openai/math repository contains one manuscript, “Polynomial-Time Unitary Synthesis from a Boolean Oracle”. The absence of Lean is read from the absence of lean/docs/283.md; the README states that not all manuscripts have a Lean formalisation. According to history.md, no revision is reported. DiscoverIA status: not evaluated, meaning that no third-party evaluation has been found in the sources read. Set on October 12, 2026 from github.com (page read, quotation checked word for word: “Not all have accompanying Lean formalizations.”).
Limits
DiscoverIA has not checked this result itself.
Key facts
- Claimed by
- OpenAI (unreleased internal model)
announced on Oct 6, 2026 - Nature
- new result
- Field
- Mathematics (Mathematical physics)
- In openai/math
- family 283, section “Mathematical physics”, 1 manuscript dated Oct 5, 2026
- Lean proof
- none supplied
- Revisions
- none reported by the claimant
- Checked by
- no verifier identified
- Sources
- 2 : 2 links only
- This entry
- AI draft, not reviewed
Status history
Only one observation so far.
- 01
First observation:Not evaluatedCurrent status
Family with no Lean proof supplied. No third-party evaluation read.
Source: github.comread word for word
An observation is added; none is ever erased.
In the same set
openai/math: 719 manuscripts in 372 families from an unreleased internal model · entry 277 of 372, by family number
- Not evaluated : Strong locality for strongly rational unitary vertex operator algebras (family 280)
- Not evaluated : QAOA optimality for the SK model (family 281)
- Not evaluated : Scale-to-conformal enhancement in four-dimensional QFT (family 282)
- Not evaluated : Polynomial-time, constant-error unitary synthesis from a Boolean oracle (family 283)
- Not evaluated : The optimal randomized–quantum query exponent (family 284)
- Not evaluated : Counterexamples to Baum–Connes and Kadison–Kaplansky (family 285)
- Not evaluated : Arithmetic rigidity of lattice von Neumann algebras (family 286)
Report an error or suggest a source
Thank you, your message was sent.
Sending failed. Try again, or write to contact@discoveria.ai.
Is your result listed?What each status requires, correcting this entry, replying to it.