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