Quantum Hamiltonian Complexity - Lecture 4

Explore quantum systems from a computational complexity perspective in this lecture from the Park City Mathematics Institute's Graduate Summer School program on Quantum Computation. Delve into the challenges of computing fundamental properties and simulating quantum systems, moving beyond traditional heuristic methods to examine formal complexity-theoretic approaches. Learn about determining the lowest energy state (ground state) of quantum systems and the computational resources required for both finite and infinite systems. Access accompanying lecture notes and problem sets to reinforce understanding through hands-on practice. Part of a comprehensive three-week summer program featuring leading experts in quantum computation, this lecture connects with broader themes of quantum learning, information theory, error-correcting codes, and the complexity theory of random circuits and Hamiltonians.