The First of Black Opal’s Advanced Quantum Computing Tutorials
Black Opal’s new “Speedup” module is not what I thought it would be; it’s more. I thought it would be about complexity theory, and it is, but that’s just the first topic of this module. The rest of the module is dedicated to exploring the quantum algorithms that are known to achieve speedups over their classical counterparts.
What is complexity?
This topic is probably what you thought this module would be about. At least, that’s what I thought. And, you’ll get the explanation you’re looking for. In addition to that, progression to the next topic requires that you’ll pass the interactive quizzes you’ve come to expect from Black Opal.
Deutsch-Jozsa Algorithm
Next up is a review of the Deutsch-Jozsa textbook algorithm. Although the algorithm itself has no practical application, its introduction expands on the previous topic, because this was the first quantum algorithm to demonstrate that quantum algorithms could outperform classical algorithms.
Shor’s Factoring Algorithm
The Boss Battle is, interestingly, not the last topic. Shor’s Factoring Algorithm is important not only because it has a practical application that cannot efficiently be done classically, but also because of how it popularized the entire field of quantum computing. It’s basically the Michael Jordan of quantum algorithms.
