Remark: Family 279. 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.

The authors are OpenAI. This companion does not verify the proof. The claim is not a theorem of the Enter series and not a premise of any registered sheet. It does not close O.1. O.1 stays NOT_CLOSED. It is not a de Sitter state and not the QdS external-leg scheme. No quantum coefficient is admitted. No compilation is asserted.