top of page


The rodeo algorithm is an efficient algorithm for eigenstate preparation and eigenvalue estimation for any observable on a quantum computer.  The only requirement is that the initial state has sufficient overlap probability with the desired eigenstate.  It is exponentially faster than well-known algorithms such as phase estimation and adiabatic evolution for eigenstate preparation.  The Lee Research Group is collaborating with the Quantinuum Theory Group to develop applications of the rodeo algorithm on current quantum computers.

bottom of page