Exact quantum factoring over a fixed finite gate set
What the paper claims, in its own words
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 plain-language explainer for this entry is still coming.