Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem
Author:
Open Access
- 19 May 2002
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 653-658
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- Quantum mechanical algorithms for the nonabelian hidden subgroup problem2001
- A key exchange system based on real quadratic fields Extended abstract2001
- Efficient quantum algorithms for some instances of the non-Abelian hidden subgroup problem2001
- Normal subgroup reconstruction and quantum computation using group representations2000
- Quantum Complexity TheorySIAM Journal on Computing, 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
- A Course in Computational Algebraic Number Theory1993
- Some remarks concerning the complexity of computing class groups of quadratic fieldsJournal of Complexity, 1991