University of Cambridge > Talks.cam > CQIF Seminar > Reducing the Expected Runtime of Grover Search

Reducing the Expected Runtime of Grover Search

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

If you have a question about this talk, please contact Damian Pitalua-Garcia.

We reduce the expected number of oracle calls for Grover search by approximately 18%, improving upon the well-known early stopping technique. The results are derived by employing adaptive quantum computation and weak measurements, and only require a negligible overhead in the number of measurements performed. We derive a lower bound for the expected number of oracle calls in this adaptive setting, and show that our procedure saturates the bound.

This talk is part of the CQIF Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

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