# SC 2022 Semilab: Quantum Computing

In 1981, Feynman proposed that computers taking advantage of complex quantum phenomena could simulate processes beyond the reach of their classical counterparts. Since then, humanity has raced to develop the world's true first quantum computer, along with the mathematical tools and algorithms to properly take advantage of them. In the modern day, quantum computers have been growing in strength according to Neven's law - exponentially faster than even Moore's law for classical computers. In 2019, Google took claim to having built the first quantum computer capable of solving some problems faster than any existing classical supercomputer. In this semilab, we will go over the mathematical basics of this rapidly growing field, show why quantum computers are so incredibly powerful, give a few examples of quantum algorithms that operate faster than their classical counterparts, and touch on how modern technology implements these principles.