Algebraic Graph Theory - Andrew Jena

Title: Quantum Algorithms and Mutually Unbiased Bases

Abstract: Mutually unbiased bases are fundamental to quantum information theory, showing up in quantum key distribution, quantum error correction, and quantum entanglement measures. They likewise might be familiar to algebraic graph theorists, thanks to their connection to equiangular lines and association schemes. After recapping some of the necessary background from quantum computing, I will trace the line of reasoning that lead me to stumble upon a construction of maximal sets of mutually unbiased bases for all prime powers while I was studying a seemingly unrelated quantum algorithm problem.