lean artifact · pending
Artifact ↗Source authenticated
Exact (zero-error) polynomial-time quantum factoring over a fixed finite gate set
Theorem 1.1: a polynomial-time uniform family of polynomial-size quantum circuits over NOT, CNOT, Toffoli, Hadamard, , their inverses and singly controlled versions outputs the complete prime factorization of every with probability one, with gate and qubit counts polynomial in the bit length. The construction makes the true-order mass of an order trial an exact dyadic rational, then uses one amplitude-amplification step, and handles auxiliary factorizations of recursively with a deterministic primality test. Not shown: practical resource bounds (the polynomials are large) or any classical algorithm.
Exact FrontierDelta
Prior state unknown→proved
Scope and record
Occurred: Sep 25, 2026
Delta type: SOURCE CLAIM
Assumptions: VibeMathed verification: lean-checked. Publication: announcement. AI contribution: ai-discovered. VibeMathed editorial classifications, scores, notes, relations, and dataset structure are CC BY 4.0. Source statements and linked content retain their own rights.
Canonical aliases: Exact (zero-error) polynomial-time quantum factoring over a fixed finite gate set · Exact quantum factoring
Confidence: Not scored
Registry verification: lean checked · announcement · candidate
Attribution
VibeMathed
registry · event recorded by
Unreleased internal OpenAI model
model · ai model contributor · OpenAI
Artifacts and verifiers
lean artifact · pending
Artifact ↗Compute record
No linked compute attempts recorded.
Lineage and corrections
This event attributed to Unreleased internal OpenAI model
Mosca-Zalka (2003), Section 5.2: no exact factorisation algorithm evidence for this event
Lean challenge statement: ExactQuantumFactoring.lean evidence for this event
Exact (zero-error) polynomial-time quantum factoring over a fixed finite gate set evidence for this event
Theorem 1.1: a polynomial-time uniform family of polynomial-size quantum circuits over NOT, CNOT, Toffoli, Hadamard, , their inverses and singly controlled versions outputs the complete prime factorization of every with probability one, with gate and qubit counts polynomial in the bit length. The construction makes the true-order mass of an order trial an exact dyadic rational, then uses one amplitude-amplification step, and handles auxiliary factorizations of recursively with a deterministic primality test. Not shown: practical resource bounds (the polynomials are large) or any classical algorithm. parent of this event
VibeMathed record: Exact (zero-error) polynomial-time quantum factoring over a fixed finite gate set evidence for this event
Exact (zero-error) polynomial-time quantum factoring over a fixed finite gate set parent of this event
Lean solution module: OAI/Computability/QuantumFactoring/Main.lean evidence for this event
Act on this frontier