Exploring the Limits of Classical Simulation: From Computational Many-Body Dynamics to Quantum Advantage

Gregory Donald Kahanamoku-Meyer

A dissertation submitted in partial satisfaction of the requirements for the degree of Doctor of Philosophy in Physics, in the Graduate Division of the University of California at Berkeley

Summer 2023

Committee in charge:
Professor Norman Y. Yao, Chair
Professor Umesh V. Vazirani
Professor Joel E. Moore

Notes about this web version

  • This site was built from my dissertation’s LaTeX source using LaTeXML, a custom modification of engrafo, and some scripts.

  • The conversion was a bit hacky, and I tried to fix anything that was broken, but I might have missed something. Please let me know if you find a bug!

  • The color scheme will switch from light to dark if your browser requests it. If the background is light and you would like it to be dark, try adjusting your browser’s settings.

  • The PDF version of my dissertation can be found here.

Abstract

For many years after the dawn of computing machines, it seemed to be the case that the dynamics of any physical system (including all computers, which of course are physical systems themselves) could be efficiently simulated by a simple model of a computer called the Turing machine. A consequence was that computational problems that were found to be hard for Turing machines—those requiring a runtime superpolynomial in the size of the input—remained hard no matter what machine was built to solve them. But in the latter part of the century, an intriguing counterexample emerged: quantum mechanics. The simulation of straightforward quantum systems seemed to have an exponential computational cost. This led to a provocative question: what if one were to build a computer from quantum mechanical components? Could that machine outperform the Turing machine, and efficiently simulate arbitrary quantum processes? And are there other hard problems that such a machine could efficiently solve?

In this dissertation we explore several questions stemming from those ideas. First, classical simulation of quantum many-body physics may be hard, but modern supercomputers are extremely powerful—with cutting-edge innovations in both hardware and algorithms, what quantum simulations can be achieved, and what physics can we learn from them? Second, while there has been astounding progress in the development of quantum computers, they are still small and noisy—what can we do on these near-term devices, that cannot be done with the powerful classical supercomputers just described? Furthermore, if we do a quantum mechanical computation that seems to be infeasible for even the fastest classical machines, how do we check that the result is actually correct? Answering these questions requires deeply exploring the physical nature of computing; at heart, it comes down to the beautiful puzzle of organizing the physical world around us to process information.

In memory of Maddie Dickens, who didn’t make it to graduation with us.
May you rest in peace. We miss you.