Revision as of 05:16, 13 September 2011 edit Headbomb (talk \| contribs) Edit filter managers, Autopatrolled, Extended confirmed users, Page movers, File movers, New page reviewers, Pending changes reviewers, Rollbackers, Template editors 473,387 edits ce ← Previous edit		Revision as of 05:18, 13 September 2011 edit undo Headbomb (talk \| contribs) Edit filter managers, Autopatrolled, Extended confirmed users, Page movers, File movers, New page reviewers, Pending changes reviewers, Rollbackers, Template editors 473,387 edits →Hidden subgroup problem: ce Next edit →
Line 85: \|chapter=Quantum cryptoanalysis of hidden linear functions \|editor-last=Coppersmith \|editor-first=D. \|title=Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology ~~\|title=CRYPTO '95, [[Lecture Notes in Computer Science]]~~ \|pages=424–437 \|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

Quantum algorithm: Difference between revisions