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 , 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  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  provided an example that inspired Shor’s subsequent work on the factoring problem and on the discrete logarithm problem.
KeywordsQuantum Computer Quantum Algorithm Work Factor Probability Amplitude Iterative Step
Unable to display preview. Download preview PDF.