Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem
From MaRDI portal
Publication:5901044
DOI10.1145/509907.510001zbMath1192.81069OpenAlexW2066153786MaRDI QIDQ5901044
Publication date: 5 August 2010
Published in: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/509907.510001
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (9)
Progress in quantum algorithms ⋮ Finding shortest lattice vectors faster using quantum search ⋮ Quantum computation in algebraic number theory: Hallgren's efficient quantum algorithm for solving Pell's equation. ⋮ On the probability of generating a lattice ⋮ Quantum algorithm design: techniques and applications ⋮ A polynomial quantum algorithm for approximating the Jones polynomial ⋮ Quantum and classical complexity classes: Separations, collapses, and closure properties ⋮ Quantum binary search algorithm ⋮ A novel fault-tolerant quantum divider and its simulation
This page was built for publication: Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem
