References
- R. Feynman, "The Character of Physical Law, Chapter 6, 'I think I can safely say that nobody understands quantum mecahnics'," 1965.
- https://www.jefferies.com/CMSFiles/Jefferies.com/files/Semiconductors.pdf
- https://en.wikipedia.org/wiki/Quantum_key_distribution
- https://en.wikipedia.org/wiki/Moore%27s_law
- https://en.wikipedia.org/wiki/Qubit
- M.A. Nielsen and I.L. Chuang, "Quantum Computation and Quantun Information," Cambridge University Press, 2011.
- https://en.wikipedia.org/wiki/EPR_paradox
- R.P. Feynman, "Simulating Physics with Computers," International J. Theoretical Physics, vol. 21, no. 6-7, 1982, pp. 467-488. https://doi.org/10.1007/BF02650179
- S. Lloyd, "Universal Quantum Simulators," Science, vol. 273, no. 5278, 1996, pp. 1073-1078. https://doi.org/10.1126/science.273.5278.1073
- D. Deutsch, "Quantum Theory, the Church-Turing Principle and the Universal Quantum Computer," Proc. Royal Society of London A, vol. 400, no. 1818, 1985, pp. 97-117. https://doi.org/10.1098/rspa.1985.0070
- A. Barenco et al, "Elementary Gates for Quantum Computation," Physical Review A, vol. 52, no. 5, p. 3457, Mar. 22nd, 1995. https://doi.org/10.1103/PhysRevA.52.3457
- R. Raussendorf, D.E. Browne, and H.J. Briegel, "Measurement-based Quantum Computation on Cluster States," Physical Review A, vol. 68, no. 022312, Jan. 2003. https://doi.org/10.1103/PhysRevA.68.022312
- M.H. Freedman et al, "Topological Quantum Computation," Bulletin of the American Mathmatical Society, vol. 40, no. 1, 2003, pp. 31-38.
- E. Farhi et al., "A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem," Science, vol. 20, no. 472, 2001.
- G. Brassard, "Quantum Communication Complexity(A Survey)," 2001, http://arxiv.org/abs/quant-ph/0101005
- P.W. Shor, "Why Haven't More Quantum Algorithms Been Found?," Journal of the ACM, vol. 50, no. 1, 2003, pp. 87-90. https://doi.org/10.1145/602382.602408
- W.K. Wotters and W.H. Zurek, "A Single Quantum Cannot be Cloned," Nature, vol. 299, 1982, pp. 802-803. https://doi.org/10.1038/299802a0
- P.W. Shor, "Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer," SIAM Journal on Computing, vol. 26, no. 5, 1997, pp. 1484-1509. https://doi.org/10.1137/S0097539795293172
- https://en.wikipedia.org/wiki/Quantum_machine_learning
- D.P. DiVincenzo, "The Physical Implementation of Quantum Computation," Fortschritte der Physik, vol. 48, no. 9-11, 2000, pp. 771-783. https://doi.org/10.1002/1521-3978(200009)48:9/11<771::AID-PROP771>3.0.CO;2-E
- https://www.newscientist.com/article/dn26419-quantum-computer-buyers-guide-buy-one-today/
- https://en.wikipedia.org/wiki/Quantum_error_correction
- J. Preskill, "Fault-Tolerant Quantum Computation," http://arxiv.org/abs/quant-ph/9712048
- D. Gottesman, "Theory of Fault-Tolerant Quantum Computation," Physical Review A, vol. 57, no. 127, 1998.
- A.G. Folwer et al, "Surface Codes: Towards Practical Large-Scale Quantum Computation," Physical Review A, vol. 86, no. 032324, 2012.