Revision as of 20:48, 19 May 2012 edit Wavelength (talk \| contribs) Extended confirmed users, Pending changes reviewers 179,502 edits →Overview: [¶1 of 2] removing 1 hyphen: —> "commonly used"—WP:HYPHEN, sub-subsection 3, point 4 ← Previous edit		Revision as of 20:48, 19 May 2012 edit undo Wavelength (talk \| contribs) Extended confirmed users, Pending changes reviewers 179,502 edits →Hidden subgroup problem: removing 1 hyphen: —> "previously mentioned"—WP:HYPHEN, sub-subsection 3, point 4 Next edit →
Line 89: \|publisher=[[Springer-Verlag]] \|isbn=3-540-60221-6 }}</ref> The more general hidden subgroup problem, where the group isn't necessarily abelian, is a generalization of the previously- mentioned problems and [[graph isomorphism]] and certain [[lattice problems]]. Efficient quantum algorithms are known for certain non-abelian groups. However, no efficient algorithms are known for the [[symmetric group]], which would give an efficient algorithm for graph isomorphis<ref> {{cite arxiv \|last1=Moore \|first1=C.\|author1-link=Cris Moore

Quantum algorithm: Difference between revisions