Quantum computation in algebraic number theory: Hallgren's efficient quantum algorithm for solving Pell's equation.

DOI10.1016/S0003-4916(03)00067-8zbMath1053.81013arXivquant-ph/0302134MaRDI QIDQ1404927

Richard Jozsa

Publication date: 25 August 2003

Published in: Annals of Physics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/quant-ph/0302134

zbMATH Keywords

Pell's equationQuantum algorithmsperiod findingQuantum Fourier transform

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Quantum computation (81P68) Number-theoretic algorithms; complexity (11Y16) Continued fractions (11A55) Normal numbers, radix expansions, Pisot numbers, Salem numbers, good lattice points, etc. (11K16)

Related Items (1)

Quantum algorithms for algebraic problems

Cites Work

• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Quantum computation in algebraic number theory: Hallgren's efficient quantum algorithm for solving Pell's equation.