
Be the first to like this
Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our User Agreement and Privacy Policy.
Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our Privacy Policy and User Agreement for details.
Published on
A simple searching algorithm; the DeutschJozsa algorithm
In the previous lecture we discussed Deutsch’s Algorithm, which gives a simple example of how quantum algorithms can give some advantages over classical algorithms in certain restricted settings. We will start this lecture by discussing another simple example, and then move on to the DeutschJozsa Algorithm, which generalizes Deutsch’s Algorithm to functions from n bits to 1 bit.
https://cs.uwaterloo.ca/~watrous/LectureNotes/CPSC519.Winter2006/05.pdf
Be the first to like this
Be the first to comment