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

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Reducing the Expected Runtime of Grover Search

Download to your calendar using vCal

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.

Other lists

Lady Mitchell Hall, Sidgwick Site, Cambridge CB3 9DA Numerical Analysis Room GS15 at the William Gates Building and on Zoom: https://cl-cam-ac-uk.zoom.us/j/4361570789?pwd=Nkl2T3ZLaTZwRm05bzRTOUUxY3Q4QT09&from=addon

Other talks

Gastroenterology and Acute Medicine CSAR lecture: Climate Repair (TBC) Dwarf Galaxies in the Local Universe Group Work Animating urbanism: the demotic multiplicities of seeing cities digitally Welfare Reform and the Imperative of Cooperation
 

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