Is it possible to design an efficient approximation algorithm for an $\sf{NP\text{-}complete}$ problem based on reductions from Shor's algorithm? Are known any (classical) approximation algorithms for an $\sf{NP\text{-}complete}$ problem that uses Factoring as oracle?
Is it possible to design an efficient approximation algorithm for one NP-complete problem based on Shor's algorithm?
cc.complexity theory;quantum computing;factoring