Talk:Quantum computing/Further Reading

If you feel something should be returned to Quantum computing, then please return it.

Further reading

• General reference:
  • Brown, Julian (2000). Minds Machines and the Multiverse. ISBN 0-684-81481-1.
  • West, J. (2000). The Quantum Computer — An Introduction.
  • Hayes, Brian (Jul-Aug 1995). The square root of NOT. American Scientist Online. (Logic gates in a quantum computer)
  • Deutsch, David (1997). The Fabric of Reality: The Science of Parallel Universes — And Its Implications. ISBN 0-14-027541-X.
  • Quantiki - Cambridge free-content resource in quantum information science
  • Institute for Quantum Computing, University of Waterloo
  • Qwiki - Caltech quantum physics wiki devoted to providing technical resources for practicing quantum information scientists.
  • QIIC, Imperial College London, includes downloadable courses.
  • "Entanglement and One-Way Quantum Computing" by Robert Prevedel and Anton Zeilinger, 2Physics.com, June 8, 2007
  • The Temple of Quantum Computing by Riley Perry and others, a quantum computing tutorial for everyone, including those who have no background in physics.
• Introduction to Quantum Computation:
  • NEC Laboratories Innovation Engine - Quantum Computer
  • Gruska, Jozef (1999). Quantum Computing. McGraw-Hill. ISBN 0-077-09503-0., A systematic self-taught introduction to quantum computing, orientated to computational aspects such as algorithms, networks, automata and quantum information theory.
  • Rieffel, Eleanor G.; Polak, Wolfgang (2000). "An Introduction to Quantum Computing for Non-Physicists". ACM Computing Surveys. 32 (3): 300–335. arXiv:quant-ph/9809016. doi:10.1145/367701.367709.
  • Fenner, Stephen A. (2003). "A Physics-Free Introduction to the Quantum Computation Model". Not published. arXiv:cs/0304008.
  • Bengtsson, Anders K. H. (2005). "Quantum Computation: A Computer Science Perspective". Not published. arXiv:quant-ph/0511274.
  • Piponi, Dan. "Quantum Computing". Intro to quantum computing. Years old now.
• Thermal ensembles
  • Overview of early developments, with links
  • The first two papers ever written on this topic:
    • Cory, D.G; Fahmy, A.F.; Havel, T.F. (1997). "Ensemble quantum computing by NMR spectroscopy". Proc. Nat. Acad. of Science. 94 (5): 1634–1639.
    • Gershenfeld, N.; Chuang, I. (1997). "Bulk Spin-Resonance Quantum Computation" (PDF). Science. 275 (5298): 350–356. doi:10.1126/science.275.5298.350. PMID 8994025.
  • Other references
    • "Bulk Spin Resonance Quantum Computation"
• Using quantum computers to simulate quantum systems:
  • Feynman, R. P. (1982). "Simulating Physics with Computers". International Journal of Theoretical Physics. 21 (6–7): 467–488. doi:10.1007/BF02650179.
  • Closing in on Quantum Chemistry - Calculating real properties of real quantum chemistry systems using a quantum computer
• Quantum cryptography:
  • The first paper ever written on BB84:
    • Wiesner, S. (1983). "Conjugate Coding". SIGACT News. 15 (1): 78–88. doi:10.1145/1008908.1008920.
    • Bennett, C. H.; Brassard, G. (1984). "Quantum cryptography: Public key distribution and coin tossing". Proceedings of the IEEE International Conference on Computer Systems and Signal Processing. pp. 175–179. {{cite conference}}: Unknown parameter |booktitle= ignored (|book-title= suggested) (help)
      • Bennett, Charles H.; Brassard, Gilles (2014). "Quantum cryptography: Public key distribution and coin tossing". Theoretical Computer Science. 560: 7–11. doi:10.1016/j.tcs.2014.05.025. ISSN 0304-3975.
    • Ekert, Artur K. (1991). "Quantum Cryptography Based on Bell's Theorem". Phys. Rev. Lett. 67 (6): 661–663. doi:10.1103/PhysRevLett.67.661.
  • The first paper ever published on this: Bennett, C. H.; Brassard, G.; Breidbart, S.; Wiesner, S. (1982). "Quantum cryptography, or unforgeable subway tokens". Advances in Cryptology: Proceedings of Crypto 82, August, Plenum Press. pp. 267–275. doi:10.1007/978-1-4757-0602-4_26. {{cite conference}}: Unknown parameter |booktitle= ignored (|book-title= suggested) (help)
  • A listing of a huge number of quantum cryptography papers, with some discussion of them, is at A Bilbliography of Quantum Cryptography by Gilles Brassard
  • Quantum Cryptography
• Universal quantum computer and the Church-Turing thesis:
  • Deutsch, D. (1985). "Quantum Theory, the Church-Turing Principle, and the Universal Quantum Computer". Proc. Roy. Soc. Lond. Vol. A400. pp. 97–117. Bibcode:1985RSPSA.400...97D. doi:10.1098/rspa.1985.0070. {{cite conference}}: Unknown parameter |booktitle= ignored (|book-title= suggested) (help)
• Shor's factoring algorithm:
  • Shor, P. (1994). "Algorithms for quantum computation: discrete logarithms and factoring". Proceedings 35th Annual Symposium on Foundations of Computer Science, Santa Fe, NM, USA, 20–22 November. 1994, IEEE Comput. Soc. Press. pp. 124–134. arXiv:quant-ph/9508027. doi:10.1137/S0097539795293172. {{cite conference}}: Unknown parameter |booktitle= ignored (|book-title= suggested) (help)
  • Jean-Pierre Seifert, "Using fewer Qubits in Shor's Factorization Algorithm via Simultaneous Diophantine Approximation", (download)
  • IBM's announcement of the first actual execution of the algorithm, which also gives the history of the first quantum computers with 2, 3, 5, and 7 qubits.
  • Vandersypen, L. M. K., Steffen, M., Breyta, G., Yannoni, C. S., Sherwood, M. H., & Chuang, I. L. (2001). Reporting on work at IBM Almaden Research Center, where scientists implemented a seven qubit computing device that realized Shor's factorization algorithm using nuclear magnetic resonance. Nature, 414, 883–887. doi:10.1038/414883a.
• Quantum database search:
  • Grover, L. K. (1996). "A Fast Quantum Mechanical Algorithm for Database Search". Proceedings of the 28th Annual ACM Symposium on the Theory of Computing, Philadelphia. pp. 212–219. arXiv:quant-ph/9605043. doi:10.1145/237814.237866. {{cite conference}}: Unknown parameter |booktitle= ignored (|book-title= suggested) (help)
• Quantum sorting:
  • Høyer, Peter; Neerbek, Jan; Shi, Yaoyun (2001). "Quantum complexities of ordered searching, sorting, and element distinctness". 28th International Colloquium on Automata, Languages, and Programming. LNCS. Vol. 2076. pp. 62–73. arXiv:quant-ph/0102078. doi:10.1007/3-540-48224-5_29. {{cite conference}}: Unknown parameter |booktitle= ignored (|book-title= suggested) (help)
    • Høyer, Peter; Neerbek, Jan; Shi, Yaoyun (November 2002). "Quantum complexities of ordered searching, sorting, and element distinctness". Algorithmica. 34 (4): 429–448. doi:10.1007/s00453-002-0976-3. ISSN 0178-4617.
  • Klauck, Hartmut (2003). "Quantum time-space tradeoffs for sorting". Proceedings of the thirty-fifth annual ACM symposium on Theory of computing. pp. 69–76. doi:10.1145/780542.780553. {{cite conference}}: Unknown parameter |booktitle= ignored (|book-title= suggested) (help)
• Quantum computer simulators:
  • Quack! — A MATLAB based quantum computer simulator
  • libquantum — A library for quantum computer simulation
  • QCL — Simulation of quantum computing with a quantum computing language
  • Quantum::Entanglement — Quantum computation module for Perl.
  • QCF — Quantum computation functions for matlab
  • Fraunhofer Quantum Computing Simulator — A free web-based quantum simulator (31 qubits) and a collaborative workspace for the quantum computing community.
  • QDENSITY — A MATHEMATICA based quantum computer simulator, oriented to Density Matrix
  • A Quantum Cryptography Computer Simulator Fernando Lucas Rodriguez
  • Linear Al - free software for research and education in quantum computation
  • Quantum Library : C++ Library that simulates the behaviour of qubits thus permitting the conception of quantum algorithms
• Quantum error correction:
  • Shor, P. W. (1995). "Scheme for reducing decoherence in quantum computer memory". Phys. Rev. A. 52 (4): 2493–2496. doi:10.1103/PhysRevA.52.R2493. PMID 9912632.
  • Calderbank, A. R.; Shor, P.W. (1996). "Good quantum error-correcting codes exist". Phys. Rev. A. 54 (2): 1098–1106. arXiv:quant-ph/9512032. doi:10.1103/PhysRevA.54.1098. PMID 9913578.
  • Shor, P. W. (1996). "Fault-tolerant quantum computation". Proc. 37th Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press. pp. 56–65. arXiv:quant-ph/9605011. {{cite conference}}: Unknown parameter |booktitle= ignored (|book-title= suggested) (help)
• Quantum error avoidance:
  • Lidar, D. A.; Chuang, I. L.; Whaley, K.B. (1998). "Decoherence free subspaces for quantum computation". Phys. Rev. Lett. 81 (12): 2594–2587. arXiv:quant-ph/9807004. doi:10.1103/PhysRevLett.81.2594. ISSN 0031-9007.
  • Lidar, Daniel A.; Whaley, K. Birgitta (2003). "Decoherence-Free Subspaces and Subsystems". In Benatti, Fabio; Floreanini, Roberto (eds.). Irreversible Quantum Dynamics. LNP. Vol. 622. pp. 83–120. arXiv:quant-ph/0301032. doi:10.1007/3-540-44874-8_5. ISBN 3-540-44874-8. ISSN 0075-8450.
• Solving NP-complete and #P-complete problems:
  • Abrams, Daniel S.; Lloyd, Seth (1998). "Nonlinear Quantum Mechanics Implies Polynomial-Time Solution for NP-Complete and #P Problems". Phys. Rev. Lett. 81 (18): 3992–3995. arXiv:quant-ph/9801041. doi:10.1103/PhysRevLett.81.3992. ISSN 0031-9007.
  • Gossett, Phil (1998). "NP in BQP with Nonlinearity". arXiv:quant-ph/9804025.
  • Shi, Yu (2001). "Entanglement Between Bose-Einstein Condensates". Int. J. Mod. Phys. B. 15: 3007–3030. arXiv:quant-ph/9910073. doi:10.1142/S0217979201007154. ISSN 0217-9792.
  • Ozhigov, Yuri (1999). "Quantum Computers Speed Up Classical with Probability Zero". Chaos Solitons Fractals. 10 (10): 1707–1714. arXiv:quant-ph/9803064. Bibcode:1998quant.ph..3064O. doi:10.1016/S0960-0779(98)00226-4.
  • Ozhigov, Yuri (1999). Lower Bounds of Quantum Search for Extreme Point. Proc. Roy. Soc. Lond. Vol. A455, no. 1986. pp. 2165–2172. arXiv:quant-ph/9806001. Bibcode:1999RSPSA.455.2165O. doi:10.1098/rspa.1999.0397.