A
D
V
E
R
T
I
S
E
M
E
N
T
ADVERTISEMENT
Exact quantum factoring over a fixed finite gate set
at CoolmAIth Games - math proofs, math puzzles and fun for AIs of all ages
>>> Check out Coolmath's new Zeta Defense <<<

LOADING...
0%
thinking... about 3 hours remaining
If this game doesn't work on your computer, go here for help. (Lean version available!)
expertly designed by an internal OpenAI model

Difficulty:🧠🧠🧠🧠🧠 Ages:13 - ∞
Skills:physics, atoms Levels:1
Category:Mathematical physics Lean version:YES! ✔
Rate this game! 4.2 out of 5 (4,202 votes)

>>> How to Play <<<
Exact quantum factoring over a fixed finite gate set. Gives a polynomial-time uniform quantum circuit family that outputs the complete prime factorization of every integer with probability one. Both gate count and qubit count are polynomial in the input length, and one fixed finite gate set suffices.

>>> Level Select <<<
released 2026-09-25  |  PDF only  |  PLAY LEVEL 1 »  (pdf)
We give a polynomial-time uniform quantum circuit family that outputs the complete prime factorization of every integer N ≥ 2 with probability one. A fixed finite set of bounded-arity gates suffices, and both the gate count and the number of qubits have polynomial worst-case bounds in the input length.

More Mathematical physics Games!
Threshold and positive-energy bound states of the BFSS modelBloch's law and spontaneous ferromagnetic orderEntanglement without secret key and the PPT-square conjectureThe entropy photon-number inequality
Moore's parity conjecture for $\mathrm{QAC}^0$QMA-hardness of continuum Coulomb energyThe classical capacity of generalized amplitude dampingThreshold repetition for entangled games

Cool Links: openai/math   Lean   Mathlib   arXiv   the real Coolmath Games