Talks.cam will close on 1 July 2026, further information is available on the UIS Help Site
 

University of Cambridge > Talks.cam > Quantum Computing for Quantum Chemistry > TE-PAI: Exact Time Evolution by Sampling Random Circuits

TE-PAI: Exact Time Evolution by Sampling Random Circuits

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Chiara Leadbeater.

We introduce TE-PAI, which simulates time evolution exactly by sampling random quantum circuits for estimating the expectation value of observables. We prove that it simulates time evolution without discretisation or algorithmic error while achieving optimally shallow circuit depths that saturate the Lieb–Robinson bound. TE-PAI only requires executing very simple random circuits that consist of Pauli rotation gates of only two kinds of angles ±Δ and π, along with measurements. While TE-PAI is highly beneficial for NISQ devices, we additionally develop an optimised early fault-tolerant implementation, concluding that the approach requires orders of magnitude fewer T-states. Furthermore, TE-PAI allows for a highly configurable trade-off between circuit depth and measurement overhead by adjusting the angle Δ arbitrarily. This algorithm could serve as a major enabler for achieving practical quantum advantage in applications ranging from condensed matter physics to quantum chemistry.

This talk is part of the Quantum Computing for Quantum Chemistry series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity