Why is it so hard to design algorithms for Quantum Computing? In this episode, Patrick and Ciprian discuss the challenges in writing algorithms for QC and how to make them do what we want them to do. Of special interest, are Shor’s algorithm with consequences for security and Grover’s algorithm for searching. They also address the questions of Quantum Supremacy and why it is important. Lastly, they help reframe thinking from a single qubit mindset to thinking with multiple qubits.