Quantum Computing for Computer Scientists

Quantum Computing for Computer Scientists

This presentation discards hand-wavy pop-science metaphors and answers a simple question: from a computer science perspective, how can a quantum computer outperform a classical computer? Readers will learn the following:

1. Representing computation with basic linear algebra (matrices and vectors)
2. The computational workings of qbits, superposition, and quantum logic gates
3. Solving the Deutsch oracle problem: the simplest problem where a quantum computer outperforms classical methods

Bonus topics: quantum entanglement and teleportation


Andrew Helwer

February 14, 2018