Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Shor's Algorithm

Richard J. Lipton, Kenneth W. Regan

Published Jan 1, 2014• 1 citation
OpenAlex

Abstract

This chapter contains sections titled: 11.1 Strategy, 11.2 Good Numbers, 11.3 Quantum Part of the Algorithm, 11.4 Analysis of the Quantum Part, 11.5 Probability of a Good Number, 11.6 Using a Good Number, 11.7 Continued Fractions, 11.8 Problems, 11.9 Summary and Notes

Related papers

Continued Fractions and Probability Estimations in Shor’s Algorithm: A Detailed and Self-Contained Treatise

Johanna Barzen, Frank Leymann

Shor’s algorithm for prime factorization is a hybrid algorithm consisting of a quantum part and a classical part. The main focus of the classical part is a continued fraction analysis. The presentation of this is often short, pointing to text books on number theory. In this contribution, we present the relevant results and proofs from the theory of continued fractions in detail (even in more detail than in text books), filling the gap to allow a complete comprehension of Shor’s algorithm. Similarly, we provide a detailed computation of the estimation of the probability that convergents will provide the period required for determining a prime factor.

arXiv:2205.01925•AppliedMath•Jul 18, 2022•4 citations

Phil's Algorithm

Richard J. Lipton, Kenneth W. Regan

This chapter contains sections titled: 7.1 The Algorithm, 7.2 The Analysis, 7.3 An Example, 7.4 A Two-Qubit Example, 7.5 Phil Measures Up, 7.6 Quantum Mazes versus Circuits versus Matrices, 7.7 Problems, 7.8 Summary and Notes

•Jan 1, 2014•0 citations

Quantum Algorithms

Julia Kempe

This chapter contains sections titled: Introduction Precursors Shor's Factoring Algorithm Grover's Algorithm Other Algorithms Recent Developments

Wiley eBooks•Nov 6, 2006•1 citation

The Deutsch-Jozsa Algorithm

Richard J. Lipton, Kenneth W. Regan

This chapter contains sections titled: 9.1 The Algorithm, 9.2 The Analysis, 9.3 Problems, 9.4 Summary and Notes

•Jan 1, 2014•0 citations

Grover's Algorithm

Richard J. Lipton, Kenneth W. Regan

This chapter contains sections titled: 13.1 Two Vectors, 13.2 The Algorithm, 13.3 The Analysis, 13.4 The General Case, with k Unknown, 13.5 Grover Approximate Counting, 13.6 Problems, 13.7 Summary and Notes

•Jan 1, 2014•0 citations

Tasks for quantum computers

Joachim Stolze, Dieter Suter

This chapter contains sections titled: Quantum versus classical algorithms The Deutsch algorithm: Looking at both sides of a coin at the same time The Shor algorithm: It's prime time The Grover algorithm: Looking for a needle in a haystack Quantum simulations

Wiley eBooks•May 26, 2004•0 citations
Shor’s algorithm for prime factorization is a hybrid algorithm consisting of a quantum part and a classical part. The main focus of the classical part is a continued fraction analysis. The presentation of this is often short, pointing to text books on number theory. In this contribution, we present the relevant results and proofs from the theory of continued fractions in detail (even in more detail than in text books), filling the gap to allow a complete comprehension of Shor’s algorithm. Similarly, we provide a detailed computation of the estimation of the probability that convergents will provide the period required for determining a prime factor.