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

  Browse A-Z

Log in

University Account External (via Google)

🔐 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 .

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 lists

W4.03, Cambridge Judge Business School Department of Geography, HB101 Cambridge Festival of Ideas 2015

Other talks

Title and abstract tba Cultural evolution creates language-like structure: from humans to humpback whales and beyond Talk TBC Nationalising Oil and Knowledge in Iran: Labour, Decolonisation and Colonial Modernity, 1933–51 Title TBC Evolutionary constraints shape the evolution of mammalian tooth classes
 

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