The episode highlights the future risk posed by quantum computers to modern cryptography. Shor's algorithm, developed in 1994, is theoretically capable of breaking widely used RSA encryption in days, a task that would take a classical computer 300 trillion years.
The discussion categorizes quantum applications based on their practical feasibility and theoretical certainty. While powerful algorithms like Shor's and Grover's are mathematically proven, they are not yet implementable on current error-prone (NISQ) hardware. Conversely, applications like quantum machine learning are feasible now but lack strong theoretical proof of a quantum advantage.
The episode outlines the global race for quantum supremacy, citing massive government investments from China and the US. It also details the different physical approaches to building quantum computers, such as superconducting circuits (IBM, Google), trapped ions (IonQ), and topological qubits (Microsoft).
The lecture series is framed within the context of the Philippines' national quantum technology roadmap, supported by the Department of Science and Technology (DOST). The partnership with ISC2 and its '1 Million Certified in Cybersecurity' initiative aims to build a skilled local workforce prepared for the intersection of these two fields.
Keep pulling the thread on Peter Shor.