COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |
Reducing the Expected Runtime of Grover SearchAdd 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. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsCUED Control Group Seminars Liam Wolfson College Informal Lunch-time SeminarsOther talksRAMP VSG Nonuniform mixing: filters, swimmers, and floaters Fructose as a survival signal: Implications for cancer and obesity Some approximation results for mild solutions of stochastic fractional order evolution equations driven by Gaussian noise Optimisation Training for Industry (Physical) |