Image
Q-FARM event icon

Randomness in phase estimation and Heisenberg-limited Hamiltonian learning

Summary
Lexing Ying (Stanford)
PAB 102/103
May
7
This event ended 292 days ago.
Date(s)
Content

Abstract: This talk presents some recent progress in using randomness in the design of efficient quantum algorithms. First, we consider new randomized algorithms for the robust quantum phase estimation problem. Next, we discuss its applications in Heisenberg-limited Hamiltonian learning for certain bosonic and fermionic models.