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

DOI10.1145/1206035.1206039zbMath1311.11114OpenAlexW2090828985WikidataQ56059909 ScholiaQ56059909MaRDI QIDQ5900520

Sean Hallgren

Publication date: 21 December 2008

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1206035.1206039

zbMATH Keywords

Pell equationprincipal ideal problempolynomial-time quantum algorithms

Mathematics Subject Classification ID

Related Items (17)

Improved reversible and quantum circuits for Karatsuba-based integer multiplication. ⋮ Quantum machine learning: a classical perspective ⋮ Solving Lyapunov equation by quantum algorithm ⋮ Sample complexity of hidden subgroup problem ⋮ Quantum algorithm based on the \(\varepsilon\)-random linear disequations for the continuous hidden shift problem ⋮ SICs and algebraic number theory ⋮ The special case of cyclotomic fields in quantum algorithms for unit groups ⋮ Quantum cryptography beyond quantum key distribution ⋮ Computational indistinguishability between quantum states and its cryptographic application ⋮ An FPGA-based quantum circuit emulation framework using heisenberg representation ⋮ Representation-theoretical properties of the approximate quantum Fourier transform ⋮ On the role of dealing with quantum coherence in amplitude amplification ⋮ On the quantum attacks against schemes relying on the hardness of finding a short generator of an ideal in \(\mathbb{Q}(\zeta_{2^s})\) ⋮ Quantum Random Walks – New Method for Designing Quantum Algorithms ⋮ Quantum algorithms for algebraic problems ⋮ Deterministic algorithms for the hidden subgroup problem ⋮ On the quantum complexity of the continuous hidden subgroup problem

This page was built for publication: Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem