Reducing the Expected Runtime of Grover Search

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

• Johannes Bausch
• Thursday 03 February 2022, 14:15-15:15
• MR2 Centre for Mathematical Sciences.

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

This talk has been canceled/deleted

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.

This talk is included in these lists:

This talk is not included in any other list

Note that ex-directory lists are not shown.