A polynomial-time uniform family of quantum circuits over one fixed finite bounded-arity gate set outputs the complete prime factorization of every integer N≥2 with probability exactly one, using polynomially many gates and qubits in the input bit length.
A polynomial-time uniform family of quantum circuits over one fixed finite bounded-arity gate set outputs the complete prime factorization of every integer N≥2 with probability exactly one, using polynomially many gates and qubits in the input bit length.
A polynomial-time uniform family of quantum circuits over one fixed finite bounded-arity gate set outputs the complete prime factorization of every integer N≥2 with probability exactly one, using polynomially many gates and qubits in the input bit length.
If correct, upgrades quantum factoring to an exact polynomial-time circuit family under a fixed finite gate set.
Can fixed-gate polynomial quantum circuits factor every integer with certainty?
Publication dates and editorial changes.
OpenAI reports exact quantum factoring with fixed finite gates
Allow optional Google Analytics to help improve AIProofWatch? Privacy details.
