Talk:Quantum computer/Further Reading

From Wikipedia, the free encyclopedia

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

[edit] 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)
  • David Deutsch (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.
  • Eleanor G. Rieffel, Wolfgang Polak (2000). "An Introduction to Quantum Computing for Non-Physicists". ACM Computing Surveys. arXiv:quant-ph/9809016. 
  • Stephen A. Fenner (2003). "A Physics-Free Introduction to the Quantum Computation Model". Not published. arXiv:cs.CC/0304008. 
  • Anders K.H. Bengtsson (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:
    • D.G Cory, A.F. Fahmy, T.F. Havel (1997). "". Proc. Nat. Acad. of Science 94: 1634.  and
    • N. Gershenfeld and I. Chuang (1997). "Bulk Spin-Resonance Quantum Computation". Science 275: 350–356.  (download)
  • 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: 467–488. 
  • 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 this:
    • Wiesner, S. (1983). "Conjugate Coding". SIGACT News 15: 78–88. 
    • Brassard, G. and Bennett, C.H. (1984). "". Proceedings of the IEEE International Conference on Computer Systems and Signal Processing: 175. 
    • Ekert, A. (1991). "Quantum Cryptography Based on Bell's Theorem". Physical Review Letters 67: 661–663. 
  • The first paper ever published on this: Bennett, C. H., Brassard, G., Breidbart, S. and Wiesner, S. (1982). "Quantum cryptography, or unforgeable subway tokens". Advances in Cryptology: Proceedings of Crypto 82, August, Plenum Press: 267–275. 
  • 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. A400: 97–117. 
• 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: 124–134. . arXiv:quant-ph/9508027.
  • 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: 212–219. . arXiv:quant-ph/9605043.
• Quantum sorting:
  • Peter Høyer, Jan Neerbek, Yaoyun Shi (2001). "Quantum complexities of ordered searching, sorting, and element distinctness". 28th International Colloquium on Automata, Languages, and Programming: 62–73. . arXiv:quant-ph/0102078.
  • Hartmut Klauck (2003). "Quantum time-space tradeoffs for sorting". Proceedings of the thirty-fifth annual ACM symposium on Theory of computing: 69–76. 
• 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: 2493–2496. 
  • Calderbank, A. R. and Shor, P.W. (1996). "Good quantum error-correcting codes exist". Phys. Rev. A 54: 1098–1106. arXiv:quant-ph/9512032. 
  • Shor. P. W. (1996). "Fault-tolerant quantum computation". Proc. 37th Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press: 56–65. . arXiv:quant-ph/9605011.
• Quantum error avoidance:
  • D. A. Lidar, I.L. Chuang, K.B. Whaley (1998). "Decoherence free subspaces for quantum computation". Phys. Rev. Lett 81: 2594–2587. arXiv:quant-ph/9807004. 
  • D. A. Lidar, K.B. Whaley, "Decoherence-Free Subspaces and Subsystems", in "Irreversible Quantum Dynamics", F. Benatti and R. Floreanini (Eds.), pp. 83–120 (Springer Lecture Notes in Physics vol. 622, Berlin, 2003), arXiv:quant-ph/0301032.
• Solving NP-complete and #P-complete problems:
  • Daniel S. Abrams (1), Seth Lloyd (2) ( (1) Dept. of Physics, MIT, (2) Dept. of Mechanical Engineering, MIT), 1998, "Nonlinear quantum mechanics implies polynomial-time solution for NP-complete and #P problems", arXiv:quant-ph/9801041.
  • Phil Gossett, 1998, "NP in BQP with Nonlinearity", arXiv:quant-ph/9804025.
  • Yu Shi (10 September 2001). "Entanglement Between Bose-Einstein Condensates". Int. J. Mod. Phys. B 15: 3007–3030. arXiv:quant-ph/9910073. 
  • Yu. Ozhigov (1999). "Quantum Computers Speed Up Classical with Probability Zero". Chaos Solitons Fractals 10: 1707–1714. arXiv:quant-ph/9803064. 
  • Yu. Ozhigov (1999). "Lower Bounds of Quantum Search for Extreme Point". Proc.Roy.Soc.Lond. A455: 2165–2172. arXiv:quant-ph/9806001.