Quantum algorithms for solvable groups
- 6 July 2001
- proceedings article
- Published by Association for Computing Machinery (ACM)
Abstract
No abstract availableAll Related Versions
This publication has 22 references indexed in Scilit:
- Complexity Limitations on Quantum ComputationJournal of Computer and System Sciences, 1999
- Quantum algorithms revisitedProceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 1998
- Quantum algorithms and the Fourier transformProceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 1998
- Quantum computations: algorithms and error correctionRussian Mathematical Surveys, 1997
- 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
- Solvable black-box group problems are low for PPTheoretical Computer Science, 1997
- Bounded Round Interactive Proofs in Finite GroupsSIAM Journal on Discrete Mathematics, 1992
- Asymptotically Fast Triangularization of Matrices over RingsSIAM Journal on Computing, 1991
- Quantum theory, the Church–Turing principle and the universal quantum computerProceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences, 1985