I will overview a series of results on how randomization can help with compilation of circuits and design of quantum algorithms. This review will include the qDRIFT algorithm that enables quantum simulation and phase estimation with a complexity that is independent of the number of the number of terms in a Hamiltonian. Then I will discuss more recent work where randomization is applied to expectation value estimation problems such as eigenvalue thresholding. I will close with some recent experimental results using randomized algorithms.
Presenter: Earl Campbell