~Quantum algorithms~

Prerequisites: linear algebra; some knowledge of complex numbers

What makes quantum computers better than regular computers? As it turns out, not very much. Quantum computers are, in fact, quite bad at what they do, and why they get so much positive press is mystifying. Nevertheless, we continue to beat on, boats against the current, hoping to eventually make them good.

This class will be a brief introduction to how quantum algorithms actually work, where we'll introduce qubits, quantum logic gates, and oracles. Then, we will construct a quantum algorithm that actually has an exponential speedup over any classical computer. Time-permitting, we will also cover quantum search (Grover's algorithm), LCU circuits, Shor's algorithm, and the hidden subgroup problem.

This class will assume NO KNOWLEDGE of quantum mechanics, since I don't actually know any. However, it will be useful to know some linear algebra, as well as understanding the basics of how complex numbers work. Class will be taught in English because I don't know any of the corresponding words in Russian :'(