9.10 Summary
In this chapter we 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, 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 really valuable, quadratic or exponential speed increases over classical methods will be required.
References
- [1]
-
Scott Aaronson and Patrick Rall. Quantum Approximate Counting, Simplified. 2019. url: https://arxiv.org/abs/1908.10846.
- [2]
-
Charles H. Bennett et al. ‘‘Teleporting an unknown quantum state via...
