Skip to Content

Q49: Quantum Algorithms for Many-Body Systems

200G

Sponsoring Units: DQIChair: Aditya DhumuntaraoSession Tags:
  • Focus

Wed. March 6, 3:00 p.m. – 3:36 p.m. CST

200G

One of the most promising expected applications of near-term quantum computers lies in the study of static and dynamical properties of quantum many-body systems. Many quantum computing algorithms have been proposed with this goal in mind, with a focus on Hamiltonian eigenvalue extraction, a problem central to chemistry, physics, and materials science. However, the majority of established quantum algorithms require a prohibitively large number of resources for near-term hardware. Here we discuss a number of quantum algorithms relying on real-time evolution for energy eigenvalue determination such as quantum Krylov methods and the recently introduced observable-Dynamic Mode Decomposition. Real-time evolution is native to quantum hardware, making these algorithms particularly suited for the near term. We provide strong theoretical and numerical evidence that these methods can converge rapidly even in the presence of noise and demonstrate their efficacies numerically on a range of chemically relevant Hamiltonians.

Presented By

  • Katherine Klymko (Lawrence Berkeley National Laboratory)

Authors

  • Katherine Klymko (Lawrence Berkeley National Laboratory)
  • Norm M Tubman (NASA Ames)
  • Yizhi Shen (Lawrence Berkeley National Laboratory)
  • Carlos Mejuto Zaera (University of California, Santa Barbara)
  • Daan Camps (Lawrence Berkeley National Laboratory)
  • Roel Van Beeumen (Lawrence Berkeley National Laboratory)
  • Siva Darbha (Lawrence Berkeley National Laboratory)
  • David B Williams-Young (Lawrence Berkeley National Laboratory)
  • Aaron Szasz (Lawrence Berkeley National Laboratory)