PDE and mathematical physics · Oct 6, 2026
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.
Contributors
Unreleased OpenAI model
AI systems: Unreleased OpenAI model