Content deleted Content added
→Fourier fishing and Fourier checking: Oracle now links to computer science oracle article. |
m link Cris Moore |
||
Line 91:
}}</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
|last2=Russell |first2=A.
|last3=Schulman |first3=L. J.
| |||