Quantum algorithm: Difference between revisions

Revision as of 11:11, 2 March 2016

Revision as of 17:21, 27 April 2016

Line 76:

| bibcode= 1995quant.ph..8027S

| doi=

}}</ref> whereas the best known classical algorithms take super-polynomial time. These problems are not known to be in [[P (complexity)|P]] or [[NP-complete]]. It is also one of the few quantum algorithms that solves a non&ndash;black-box problem in polynomial time where the best-knownbestknown classical algorithms run in super-polynomial time.

===Hidden subgroup problem===