Rather than achieving a speedup over classical computers by performing multiple computations simultaneously as is often claimed, a quantum computer can compute a solution to a problem in fewer steps than a classical computer, because it can do so without working out the answers to questions that are not asked, but that a classical computer needs to answer to solve the problem. This is illustrated by going through the simplest quantum algorithm, proposed by David Deutsch. Simon’s algorithm for finding the period of a function, and Shor’s factorization algorithm, the “killer app” for quantum computation, work in a similar way. The chapter also discusses quantum teleportation and superdense coding, an example of entanglement-assisted communication that follows from the possibility of quantum teleportation.
Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.
If you think you should have access to this title, please contact your librarian.