Affiliate disclosure
Book titles on this page link to Amazon. As an Amazon Associate, DataField.Dev earns from qualifying purchases — at no additional cost to you.
Further Reading: Chapter 11 — Quantum Parallelism and Interference — How Quantum Algorithms Get Their Speedup
- Deutsch, D. (1985). "Quantum theory, the Church-Turing principle and the universal quantum computer." Proceedings of the Royal Society A, 400(1818), 97–117.
- Deutsch, D., & Jozsa, R. (1992). "Rapid solution of problems by quantum computation." Proceedings of the Royal Society A, 439(1907), 553–558.
- Nielsen, M. A., & Chuang, I. L. (2010). Quantum Computation and Quantum Information. Cambridge University Press. Chapters 1–2.
- Cleve, R., Ekert, A., Macchiavello, C., & Mosca, M. (1998). "Quantum algorithms revisited." Proceedings of the Royal Society A, 454(1969), 339–354.
- Mermin, N. D. (2007). Quantum Computer Science: An Introduction. Cambridge University Press. Chapter 2.
- Jozsa, R., & Linden, N. (2003). "On the role of entanglement in quantum-computational speedup." Proceedings of the Royal Society A, 459(2036), 2011–2032.
- Holevo, A. S. (1973). "Bounds for the quantity of information transmitted by a quantum communication channel." Problems of Information Transmission, 9(3), 177–183.