About
I focused on this quantum computing algorithm, and created several pieces of content to go along with my learning.
Introduction
Quantum computers are incredible feats of engineering and cutting edge research. Quantum computers claim to be faster then classical computers, but have quantum computers actually been proven to have a speedup over classical ones?
- 2 algorithms have been created that would provide a significant and useful speedup
- Shor's and Grover's algorithms have exponential and quadratic speedups over regular computers
- They've never been proven in practice as our quantum computers are not powerful enough
Grover's Algorithm
Grover's algorithm has insane applications to encryption. In simple terms, Grover's algorithm is good at searching for things that you need to find. It works well for searching databases and anything that requires brute force search.
- Find values in a large database significantly faster then a classical computer
- Has the potential to break cryptosystems such as SHA2 which is the encryption algorithm that bitcoin uses
- Read my articles for a more in depth explenation of this algorithm
The information above is an overview of the project. These are further resources that go more in depth if you are interested in learning more. In order of when I published each one on my learning journey. I recommend the first and last two articles.