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 1 — Why Quantum Computing? What Quantum Computers Can Do That Classical Computers Can't (and What They Can't Do Better)

  1. Nielsen, M. A., & Chuang, I. L. (2010). Quantum Computation and Quantum Information. Cambridge University Press.
  2. Arute, F., et al. (2019). "Quantum supremacy using a programmable superconducting processor." Nature, 574, 505–510.
  3. Shor, P. W. (1997). "Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer." SIAM Journal on Computing, 26(5), 1484–1509.
  4. Grover, L. K. (1996). "A fast quantum mechanical algorithm for database search." STOC '96.
  5. Harrow, A. W., Hassidim, A., & Lloyd, S. (2009). "Quantum Algorithm for Linear Systems of Equations." Physical Review Letters, 103(15), 150502.
  6. Preskill, J. (2018). "Quantum Computing in the NISQ era and beyond." Quantum, 2, 79.
  7. McKinsey & Company. (2022). "Quantum computing: An emerging ecosystem and industry use cases."
  8. Feynman, R. P. (1982). "Simulating Physics with Computers." International Journal of Theoretical Physics, 21(6), 467–488.
  9. Deutsch, D. (1985). "Quantum theory, the Church-Turing principle and the universal quantum computer." Proceedings of the Royal Society of London A, 400(1818), 97–117.
  10. Bernstein, E., & Vazirani, U. (1997). "Quantum complexity theory." SIAM Journal on Computing, 26(5), 1411–1473.
  11. Simon, D. R. (1997). "On the power of quantum computation." SIAM Journal on Computing, 26(5), 1474–1483.
  12. Wootters, W. K., & Zurek, W. H. (1982). "A single quantum cannot be cloned." Nature, 299, 802–803.