Quantum optimization algorithms: Difference between revisions

Revision as of 08:58, 7 October 2020

Revision as of 07:31, 30 October 2020

Line 54:

</math>

The best classical algorithm is not known to unconditionalyunconditionally run in [[polynomial time]]. The corresponding feasibility problem is known to either lie outside of the union of the complexity classes NP and co-NP, or in the intersection of NP and co-NP <ref>https://doi.org/10.1007/BF02614433</ref>.

===The quantum algorithm===