We give a gentle overview of how quantum computing works. We discuss the concept of entanglement - a purely quantum phenomena. Interestingly enough, very entangled states can be simulated on a classical computer. This is due to the Gottesman-Knill theorem, which states that circuits consisting of the Clifford group can be perfectly simulated on a classical computer in polynomial time. This gives rise to a different resource needed to create a fault-tolerant quantum computer called magic. Magic states measures the amount non-classicality needed for any quantum advantage. We define various metrics of magic using several entropic measurements, and if time permits we review some of their mathematical properties.
The Secret Sauce to Building a Quantum Computer
Sarah Chehade, Oak Ridge National LabAuthors: Sarah Chehade
2022 AWM Research Symposium
New EDGE (Enhancing Diversity in Graduate Education) PhDs Special Session: Pure and Applied talks by Women Math Warriors