Quantum polynomial-factor Ideal-SVP ⇒ Ideal-SVP for polynomial factors
Statement
If Ideal-SVP 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.