PIMS - IAM Distinguished Colloquium: Sandy Irani

  • Date: 03/18/2019
  • Time: 16:00
Sandy Irani, University of California at Irvine

University of British Columbia


Computational Complexity of Quantum Systems


One of the goals of quantum information theory is to understand quantum systems from the standpoint of computational complexity. How difficult is it to compute fundamental properties of a quantum system or simulate a particular system over time? Physicists have been using computers for decades to understand various aspects of quantum systems, but these methods are typically heuristic and achieve success on only limited classes of systems. This talk will give an overview of recent developments in the effort to understand these problems from a formal complexity-theoretic point of view. In particular, one of the most basic properties of a system is its lowest energy state or ground state. I will survey results on the complexity of ground states and the computational resources required to compute them. I will also discuss heuristics to find ground states on more near-term quantum computers.

Other Information: 

Location: ESB 4133 (PIMS Lounge)