In this series of posts, we’re exploring a famous algorithm called Shor’s Algorithm. In the last post, we talked about using phase estimation to do order finding. In this post, we’re going to explore how phase estimation works. What problem does phase estimation solve? Phase estimation solves the problem of...
Read More
In this series of posts, we’re exploring a famous algorithm called Shor’s Algorithm. In this post, we’re going to look at how we do order finding on a quantum computer using something called phase estimation. Order Finding: A reminder Let’s start with a reminder of what the problem of order...
Read More
In this series of posts, we’re exploring a famous algorithm called Shor’s Algorithm. In the last post, we saw how to use order finding to factorise a number. This relied on being able to quickly compute the gcd of two numbers. Thankfully we can do this fast classically using Euclid’s...
Read More
In this series of posts, we’re exploring a famous algorithm called Shor’s Algorithm. In this post, we will split it unto two parts: a quantum part and a classical part and then we will explain the classical part Order Finding Shor’s algorithm can be split into two parts. The first...
Read More
In this series of posts, we’re exploring a famous algorithm called Shor’s Algorithm. In this post, well give a quick outline of how RSA works so you can understand why being able to efficiently factor large numbers is a problem for it. What is RSA? RSA is a public key...
Read More
See all posts
