Advertisement

Quantum Algorithms

  • Arthur O. Pittenger
Chapter
Part of the Progress in Computer Science and Applied Logic book series (PCS, volume 19)

Abstract

We are now ready to assemble quantum subroutines into quantum algorithms. A reasonable first question is: Are there problems which can be solved efficiently on a quantum computer? In his analysis of a universal quantum computer [25], Deutsch illustrated quantum parallelism by constructing a procedure to compute the parity f(0) ⊕ f(1) of a function on one bit. In a generalization of this context, Deutsch and Jozsa [27] defined a quantum algorithm that could solve a problem more efficiently than is possible on a classical computer. This problem helped motivate the search for algorithms that could solve “real” problems, and Simon [67] provided an example that inspired Shor’s subsequent work on the factoring problem and on the discrete logarithm problem.

Keywords

Quantum Computer Quantum Algorithm Work Factor Probability Amplitude Iterative Step 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 2001

Authors and Affiliations

  • Arthur O. Pittenger
    • 1
  1. 1.Department of Mathematics and StatisticsUniversity of Maryland, Baltimore CountyBaltimoreUSA

Personalised recommendations