Efficient quantum algorithms for some instances of the non-Abelian hidden subgroup problem
- 3 July 2001
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 263-270
- https://doi.org/10.1145/378580.378679
Abstract
No abstract availableAll Related Versions
This publication has 12 references indexed in Scilit:
- Las Vegas algorithms for matrix groupsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Quantum mechanical algorithms for the nonabelian hidden subgroup problemPublished by Association for Computing Machinery (ACM) ,2001
- Quantum algorithms for solvable groupsPublished by Association for Computing Machinery (ACM) ,2001
- Normal subgroup reconstruction and quantum computation using group representationsPublished by Association for Computing Machinery (ACM) ,2000
- On the Power of Quantum ComputationSIAM Journal on Computing, 1997
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum ComputerSIAM Journal on Computing, 1997
- Fast Monte Carlo Algorithms for Permutation GroupsJournal of Computer and System Sciences, 1995
- Computing in solvable matrix groupsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1992
- Projective Representations of Minimum Degree of Group ExtensionsCanadian Journal of Mathematics, 1978
- On the minimal degrees of projective representations of the finite Chevalley groupsJournal of Algebra, 1974