Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2002, Pages 653-658

  Hallgren, Sean ^a  

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; CRYPTOGRAPHY; NUMBER THEORY; POLYNOMIALS; PROBLEM SOLVING; QUANTUM THEORY;

COMPUTATIONAL ALGEBRAIC NUMBER THEORY; FACTORING INTEGERS; PELL EQUATION; POLYNOMIAL TIME QUANTUM ALGORITHMS; PRINCIPAL IDEAL PROBLEM;

ALGORITHMS;

EID: 0036038402     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/509998.510001     Document Type: Conference Paper

References (18)

1. Quantum complexity theory
2. A subexponential algorithm for the determination of class groups and regulators of algebraic number fields
3. Some remarks concerning the complexity of computing class groups of quadratic fields
4. A key exchange system based on real quadratic fields (extended abstract)
5. A course in computational algebraic number theory
6. Hidden subgroup states are almost orthogonal
7. Quantum mechanical algorithms for the nonabelian hidden subgroup problem
8. Normal subgroup reconstruction and quantum computation using group representations
9. Efficient quantum algorithms for some instances of the non-abelian hidden subgroup problem
10. On the computation of regulators and class numbers of quadratic fields
11. Solving pell's equation. Clay mathematics institute introductory workshop in algorithmic number theory, MSRI
12. Solving the pell equation
13. Chapter 15.1
14. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
15. On the power of quantum computation
16. Quantum algorithms for some hidden coset problems
17. Asymptotically fast discrete logarithms in quadratic number fields