Explore classical algorithms for quantum mean values in this 56-minute lecture by Sergey Bravyi from IBM T.J. Watson Research Center. Delve into the Variational Quantum Eigensolver (VQE) and its limitations, then examine the Quantum Mean Value problem and its classical runtime. Learn about variable elimination techniques and their application to the MAX 3-CUT problem. Investigate the Quantum Mean Value problem for level-1 QADA and level-2 QAOA, gaining insights into the intersection of classical and quantum computing approaches.
Classical Algorithms for Quantum Mean Values
Overview
Syllabus
Intro
Variational Quantum Eigensolver (VQE)
Limitations of VQE
Quantum Mean Value problem: classical runtime
Quantum Mean Value algorithm
Variable elimination
MAX 3-CUT problem
Quantum Mean Value problem for level-1 QADA
Quantum Mean Value problem for level-2 QAOA
Summary
Taught by
Simons Institute
