Quantum polynomial-factor GapSVP ⇒ GapSVP for polynomial factors

Fully-black-box reduction · standard model · folklore · security loss: none

Statement

If GapSVP is quantumly hard for polynomial factors, it is hard for polynomial factors, since a polynomial-time quantum algorithm simulates every probabilistic polynomial-time classical algorithm with the same output distribution — folklore.