Quantum Computation and Lattice Problems
- 1 January 2004
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 33 (3) , 738-760
- https://doi.org/10.1137/s0097539703440678
Abstract
No abstract availableAll Related Versions
This publication has 10 references indexed in Scilit:
- Complexity of Lattice ProblemsPublished by Springer Nature ,2002
- Introducing the Einstein Metric to Quantum Computation and Quantum Information GeometryFoundations of Physics Letters, 2002
- On Quantum Algorithms for Noncommutative Hidden SubgroupsAdvances in Applied Mathematics, 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
- Random walks and anO*(n5) volume algorithm for convex bodiesRandom Structures & Algorithms, 1997
- Efficient Cryptographic Schemes Provably as Secure as Subset SumJournal of Cryptology, 1996
- The Graph Isomorphism ProblemPublished by Springer Nature ,1993
- Rapid solution of problems by quantum computationProceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences, 1992
- Factoring polynomials with rational coefficientsMathematische Annalen, 1982