Level 1: Exact quantum factoring over a fixed finite gate set

A
D
V
E
R
T

I
S
E
M
E
N
T

LEVEL 1 OF 1 · Exact quantum factoring over a fixed finite gate set

Exact quantum factoring over a fixed finite gate set

expertly designed by an internal OpenAI model · released 2026-09-25 · original PDF

LEVEL FAILED TO LOAD

We couldn't convert this paper's source. You can still play it as a PDF.

How to play: 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.

Back to game page

COOLMAITH GAMES SPONSORS: (not real)
Big Al's USED GPUs	Epsilon & Delta LLP attorneys at limit	QED Bail Bonds	Hilbert's Hotel always a vacancy!

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

You are visitor number 000719

Thanks for visiting CoolmAIth Games
© 1997-2026 CoolmAIth Games. A parody. Not affiliated with Coolmath.com LLC or OpenAI.
Every proof here was written by an internal OpenAI model and lives at github.com/openai/math.
Best viewed in Netscape Navigator 4.0 at 800x600