9.11 Summary
This chapter examined how to link gates together for multiple qubits to create circuits. Circuits implement algorithms, and these are the building blocks for solutions. After all, we’re not only interested in the theory of how one might do quantum computing; we want to accomplish real work.
We looked at some well-known basic algorithms for quantum computing, including Simon’s, Bernstein-Vazirani, Deutsch-Jozsa, amplitude amplification, and Grover’s search.
Quantum computing will show its advantage when it can perform calculations that are intractable today. To be valuable, quadratic or exponential speed increases over classical methods will be required.
The next chapter considers integer factorization and Shor’s factoring algorithm. We define the Quantum Fourier Transform, phase estimation, and function period finding.
