Theory of Near-Term Quantum Advantage - Part 5

Explore a comprehensive lecture on quantum computation theory and near-term quantum advantage delivered by Bill Fefferman from The University of Chicago at the IAS PCMI Park City Mathematics Institute. Delve into the critical aspects of experimental quantum advantage - demonstrating quantum computations that surpass classical computing capabilities. Learn about the theoretical foundations and current evidence supporting near-term quantum experiments' ability to solve classically intractable problems, while examining the state of classical simulation algorithms. Access accompanying lecture notes on the theory of near-term quantum advantage and engage with problem sets focused on the computational complexity of quantum experiments. Part of the 2023 Graduate Summer School program on Quantum Computation, this lecture integrates with other minicourses covering quantum learning, information theory, linear-algebraic algorithms, error-correcting codes, and the complexity theory of random circuits and Hamiltonians. Through topics like xcb scoring, polypath integral, Z tensor identity, and uncorrected noise, gain insights into the mathematical understanding required for building and analyzing near-term quantum devices.