L.M. Adleman, J. DeMarrais, and M.-D. A. Huang. Quantum computability. SIAM Journal on Computing, 26(5):1524–1540, 1997.
M. Agrawal, N. Kayal, and N. Saxena. PRIMES in P. Annals of Mathematics 2, 160(2):781–793, 2004. Available at http://www.cse.iitk.ac.in/users/manindra/.
D. Aharonov. Quantum computation. December 1998. Available at www.arxiv.org/quant-ph/9812037.
Y. Aharonov and D. Rohrlich. Quantum Paradoxes: Quantum Theory for the Perplexed. Wiley-VCH, Weinheim, 2005.
R.B. Ash. Information Theory. Dover Publications, New York, 1990.
S. Baase. Computer Algorithms: Introduction to Design and Analysis, Second Edition. Addison-Wesley, Reading, Mass, 1988.
J. Bak and D.J. Newman. Complex Analysis, Second Edition. Springer, New York, 1996.
A. Barenco, C.H. Bennett, R. Cleve, D.P. DiVincenzo, N. Margolus, P.W. Shor, T. Sleator, J.A. Smolin, and H. Weinfurter. Elementary gates for quantum computation. Physical Review A, 52(5):3457–3467, 1995.
A. Barenco, D. Deutsch, A. Ekert, and R. Jozsa. Conditional quantum dynamics and logic gates. Physical Review Letters, 74(20):4083–4086, 1995.
H. Bass, H. Cartan, P. Freyd, A. Heller, and S. MacLane. Samuel Eilenberg (1913– 1998). Notices of American Mathematical Society, 45(10):1344–1352, 1998.
J.S. Bell. On the Einstein–Podolsky–Rosen paradox. Physics, 1:195–200, 1964.
J.S. Bell. Speakable and Unspeakable in Quantum Mechanics. Cambridge University Press, Cambridge, UK, 1987.
P. Benioff. Quantum mechanical models of Turing machines that dissipate no energy. Physical Review Letters, 48(23):1581–1585, 1982.
C.H. Bennett. Notes on the history of reversible computation. IBM Journal of Research and Development, 32(1):16–23, 1988.
C.H. Bennett. Quantum cryptography using any two nonorthogonal states. Physical Review Letters, 68:3121, 1992.
C.H. Bennett, E. Bernstein, G. Brassard, and U. Vazirani. Strengths and weaknesses of quantum computing. SIAM Journal on Computing, 26(5):1510–1523, 1997.
C.H. Bennett and G. Brassard. Quantum cryptography: Public key distribution and coin tossing. In Proceedings of IEEE International Conference on Computers Systems and Signal Processing, pages 175–179, Bangalore, India, December 1984.
C.H. Bennett, G. Brassard, C. Crépeau, R. Jozsa, A. Peres, and W.K. Wootters. Teleporting an unknown quantum state via dual classical and Einstein– Podolsky–Rosen channels. Physical Review Letters, 70(13):1895–1899, March 1993.
K.K. Berggren. Quantum computing with superconductors. Proceedings of the IEEE, 92(10), October 2004.
E. Bernstein and U. Vazirani. Quantum complexity theory. In STOC ’93: Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, pages 11–20, ACM, New York, 1993.
E. Bernstein and U. Vazirani. Quantum complexity theory. SIAM Journal on Computing, 26(5):1411–1473, 1997.
S. Bettelli, T. Calarco, and L. Serafini. Toward an architecture for quantum programming. CoRR, 2001. Available at http://arxiv.org/abs/cs.PL/0103009.
D. Bouwmeester, J.-W. Pan, K. Mattle, M. Eibl, H. Weinfurter, and A. Zeilinger. Experimental quantum teleportation. Nature, 390:575–579, 1997.
G. Brassard. Cryptology column–quantum cryptography. A bibliography. SIGACT News, 24(3):16–20, 1993.
G. Brassard and C. Créepeau. Cryptology column – 25 years of quantum cryptography. SIGACT News, 27(3):13–24, 1993.
A.R. Calderbank and P.W. Shor. Good quantum error-correcting codes exist. Physical Review A, 54(2):1098–1105, August 1996.
J. Campbell. Grammatical Man: Information, Entropy, Language and Life. Simon & Schuster, New York, July 1982.
M. Chester. Primer of Quantum Mechanics. Dover Publications, Mineola, N.Y., 2003.
I.L. Chuang, N. Gershenfeld, and M. Kubinec. Experimental implementation of fast quantum searching. Physical Review Letters, 80 (15):3408–3411, 1998.
I.L. Chuang, L.M.K. Vandersypen, X. Zhou, D.W. Leung, and S. Lloyd. Experimental realization of a quantum algorithm. Nature, 393:143–146, 1998.
J.I. Cirac and P. Zoller. Quantum computations with cold trapped ions. Physical Review Letters, 74:4091–4094, 1995.
J. Cirasella. Classical and quantum algorithms for finding cycles. 2006. Available at http://www.illc.uva.nl/Publications/ResearchReports/MoL-2006-06.text.pdf.
R. Cleve. An introduction to quantum complexity theory. Available at http://arxiv.org/abs/quant-ph/9906111, 1999.
G.P. Collins. Quantum bug: Qubits might spontaneously decay in seconds. Anarticle from Scientific American available at http://www.sciam.com.
T.H. Corman, C.E. Leiserson, R.E. Rivest, and C. Stein. Introduction to Algorithms, Second Edition. The MIT Press, Cambridge, Mass., 2001.
M.J. Crowe. A History of Vector Analysis: The Evolution of the Idea of a Vectorial System. Dover Publications, Mineola, N.Y., 1994.
S. Dasgupta, C.H. Papadimitriou, and U. Vazirani. Algorithms. McGraw-Hill Science/Engineering/Math, New York, 2006.
M.D. Davis, E.J. Weyuker, and R. Sigal. Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science. Morgan Kaufmann, Boston, 1994.
D. Deutsch. Quantum theory, the Church–Turing principle and the universal quantum computer. Proceedings of the Royal Society of London, Series A, 400(1818):97–117, 1985. Available at http://www.qubit.org/oldsite/resource/deutsch85.pdf.
D. Deutsch. Quantum computational networks. Proceedings of the Royal Society of London, Series A, 425(1868):73–90, 1989.
D. Deutsch and R. Jozsa. Rapid solution of problems by quantum computation. Proceedings of the Royal Society of London, Series A, 439:553–558, October 1992.
D. Dieks. Comunicating by EPR devices. Physical Letters A, 92(6):271–272, 1982.
P.A.M. Dirac. The Principles of Quantum Mechanics (The International Series of Monographs on Physics). Oxford University Press, Oxford, UK, 1982.
D.P. DiVincenzo. The physical implementation of quantum computation. http://arxiv.org/abs/quant-ph/0002077.
D.P. DiVincenzo. Two-bit gates are universal for quantum computation. Physical Review A, 51(2):1015–1022, 1995.
G. Egan. Schild’s Ladder. Harper Collins Publishers, New York, 2002.
A. Einstein, B. Podolsky, and N. Rosen. Can quantum-mechanical description of physical reality be considered complete? Physical Review, 47:777–780, May 1935.
A.K. Ekert. Quantum cryptography based on Bell’s theorem. Physical Review Letters, 67:661–663, 1991.
H. Eves. An Introduction to the History of Numbers, Fourth Edition. Holt, Rinehart and Winston, New York, 1976.
R.P. Feynman. Feynman Lectures on Physics (3 Volume Set). Addison-Wesley, Boston, 1963.
R.P. Feynman. Simulating physics with computers. International Journal of Theoretical Physics, 21(6/7):467–488, 1982.
L. Fortnow. One complexity theorist’s view of quantum computing. Theoretical Computer Science, 292(3):597–610, 2003.
G. Gamow. Thirty Years That Shook Physics: The Story of Quantum Theory. Dover Publications, Mineda, N.Y., 1985.
M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. WH Freeman & Co., New York, 1979.
S.J. Gay. Quantum programming languages: Survey and bibliography. Bulletin of the EATCS, 86:176–196, 2005. Available at http://dblp.uni-trier.de/db/journals/eatcs/eatcs86.html#Gay05.
J. Gilbert and L. Gilbert. Linear Algebra and Matrix Theory, Second Edition. Thomson, Brooks/Cole, San Diego, 2004.
D.T. Gillespie. A Quantum Mechanics Primer: An Introduction to the Formal Theory of Non-relativistic Quantum Mechanics. John Wiley & Sons, New York, 1974.
J. Grattage and T. Altenkirch. QML: Quantum data and control. February 2005. Available at http://www.cs.nott.ac.uk/txa/publ/jqpl.pdf.
J. Gribbin. In Search of Schrodinger’s Cat: Quantum Physics and Reality. Bantam, New York, 1984.
R.P. Grimaldi. Discrete and Combinatorial Mathematics: An Applied Introduction, Fifth Edition. Addison-Wesley, Boston, 2003.
L.K. Grover. A fast quantum mechanical algorithm for database search. In STOC ’96: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, pages 212–219, ACM, New York, 1996.
L.K. Grover. Quantum mechanics helps in searching for a needle in a haystack. Physical Review Letters, 79(2):325–328, 1997.
K. Hannabuss. An Introduction to Quantum Theory. Oxford University Press, New York, 1997.
N. Herbert. Quantum Reality: Beyond the New Physics. Anchor, Garden City, N.Y., 1987.
M. Hirvensalo. Quantum Computing. Springer, New York, 2001.
M.H. Holzscheiter. Ion-trap quantum computation. Los Alamos Science. Available at http://library.lanl.gov/cgi-bin/getfile?27-20.pdf.
R. Jozsa and B. Schumacher. A new proof of the quantum noiseless coding theorem. Journal of Modern Optics, 41(12):2343–2349, 1994.
M. Kernaghan. Bell–Kochen–Specker theorem for 20 vectors. Journal of Physics A, 27:L829–L830, 1994.
A.Yu. Kitaev, A.H. Shen, and M.N. Vyalyi. Classical and Quantum Computation (Graduate Studies in Mathematics). American Mathematical Society, 2002.
E. Knill. Conventions for quantum pseudocode. Los Alamos National Laboratory Technical Report, LAUR-96-2724, 1996.
E. Knill, R. Laflamme, A. Ashikhmin, H. Barnum, L. Viola, and W.H. Zurek. Introduction to quantum error correction. 2002. Available at http://arxiv.org/abs/quant-ph/0207170.
N. Koblitz. A Course in Number Theory and Cryptography, Second Edition. Springer, New York, 1994.
D.R. Kuhn. A hybrid authentication protocol using quantum entanglement and symmetric cryptography. 2003. Available at http://arxiv.org/abs/quantph/0301150.
R. Landauer. Information is physical. Physics Today, 44:23–29, 1991.
S. Lang. Introduction to Linear Algebra, Second Edition. Springer, New York, 1986.
S. Lang. Algebra, Third Edition. Addison-Wesley, Reading, Mass., 1993.
C.F. Lee and N.F. Johnson. Let the quantum games begin. Physics World, 2002. Available at http://physicsworld.com/cws/article/print/9995.
S. Lloyd. Almost any quantum logic gate is universal. Physical Review Letters,75 (2):346–349, 1995.
S.J. Lomonaco. Notes on quantum information theory. 1996. Available at http://www.cs.umbc.edu/lomonaco/lecturenotes/Qinfo.pdf.
S.J. Lomonaco Jr. A talk on quantum cryptography, or how Alice outwits Eve, 2001. In Quantum Computation: A Grand Mathematical Challenge for the 21st Century Ed by Somuel J. Lomonaco.
J.L. Martin. Basic Quantum Mechanics (Oxford Physics Series). Oxford University Press, New York, 1982.
B. Mazur. Imagining Numbers (Particularly the Square Root of Minus Fifteen). Farrar, Straus and Giroux, New York, 2002.
R. Nagarajan, N. Papanikolaou, and D. Williams. Simulating and compiling code for the sequential quantum random access machine, 2005. Available at http://www.dcs.warwick.ac.uk/nikos/downloads/newpaper.pdf.
P.J. Nahin. An Imaginary Tale: The Story of i (The Square Root of Minus One). Princeton University Press, Princeton, N.J., 1998.
T. Needham. Visual Complex Analysis. Oxford University Press, New York, 1999.
W.K. Nicholson. Linear Algebra with Applications, Third Edition. PWS Publishing Company, Boston, 1994.
M.A. Nielsen. Quantum entropy. A PowerPoint presentation available at http://michaelnielsen.org/blog/qicss/entropy.ppt.
M.A. Nielsen and I.L. Chuang. Quantum Computation and Quantum Information. Cambridge University Press, Cambridge, UK, 2000.
B Ömer. Quantum programming in qcl. 2000. Available at http://tph.tuwien.ac.at/oemer/doc/quprog.pdf.
M. O’Nan. Linear Algebra, Second Edition. Harcourt Brace Jovanovich, Inc., New York, 1976.
H.R. Pagels. The Cosmic Code: Quantum Physics as the Language of Nature. Simon & Schuster, New York, 1982.
C.H. Papadimitriou. Computational Complexity. Addison-Wesley, Reading, Mass., 1994.
R.C. Penney. Linear Algebra, Ideas and Applications. John Wiley & Sons, New York, 1998.
R. Penrose. Shadows of the Mind: A Search for the Missing Science of Consciousness. Oxford University Press, Oxford, UK, 1994.
R. Penrose. The Emperor’s New Mind: Concerning Computers, Minds, and the Laws of Physics (Popular Science). Oxford University Press, Oxford, UK, 1999.
R. Penrose. The Road to Reality: A Complete Guide to the Laws of the Universe. Knopf, New York, 2005.
I. Pitowsky. George Boole’s “conditions of possible experience” and the quantum puzzle. The British Journal for the Philosophy of Science, 45(1):95–125, 1994.
T.B. Pittman, B.C. Jacobs, and J.D. Franson. Quantum computing using linear optics. Johns Hopkins APL Technical Digest, 25(2), 2004. Available at http://arxiv.org/ftp/quant-ph/papers/0406/0406192.pdf.
J. Polkinghorne. Quantum Theory, A Very Short Introduction. Oxford University Press, Oxford, UK, 2002.
R. Raussendorf and H.J. Briegel. A one-way quantum computer. Physical Review Letters, 86(22), May 2001, 5188–5191.
R.L. Rivest, A. Shamir, and L. Adleman. A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, 21(2):120– 126, 1978.
P. Rodgers. The double-slit experiment. Physics World, 2002. Available at http://physicsworld.com/cws/article/print/9745.
K.H. Rosen. Discrete Mathematics and Its Applications, Fifth Edition. McGraw-Hill, Boston, 2003.
K.A. Ross and C.R.B. Wright. Discrete Mathematics, Fifth Edition. Prentice-Hall, Upper Saddle River, N.J., 2003.
R. Rüdiger. Quantum programming languages: An introductory overview. The Computer Journal, 50(2):134–150, 2007. Available at http://comjnl.oxford-journals.org/cgi/content/abstract/50/2/134.
J.J. Sakurai. Modern Quantum Mechanics, Revised edition, Addison-Wesley Publishing Company, Reading, Mass., 1994.
K. Sayood. Introduction to Data Compression, Third Edition. Morgan Kaufmann, Amsterdam, 2005.
B. Schneier. Applied Cryptography: Protocols, Algorithms, and Source Code in C, Second Edition. John Wiley, & Sons, New York, 1995.
B. Schumacher. Quantum coding. Physical Review A, 51(4):2738–2747, 1995.
H. Schwerdtfeger. Geometry of Complex Numbers. Dover Publications, Mineola, N.Y., 1980.
P. Selinger. A brief survey of quantum programming languages. In Y. Kameyama and P.J. Stuckey, editors, Functional and Logic Programming, 7th International Symposium, FLOPS 2004, Nara, Japan, April 7–9, 2004, volume 2998 of Lecture Notes in Computer Science, pages 1–6. Springer, New York, 2004a.
P. Selinger. Towards a quantum programming language. Mathematical Structures in Computer Science, 14(4):527–586, 2004b. Available at http://www.mathstat.dal.ca/selinger/papers/qpl.pdf.
C.E. Shannon. A mathematical theory of communication. Bell System Technical Journal, 27:379–423, 623–656, 1948.
P.W. Shor. Algorithms for quantum computation: Discrete logarithms and factoring. In S. Goldwasser, editor, Proceedings of the 35th Annual Symposium on the Foundations of Computer Science, pages 124–134, . IEEE Computer Society, Los Alamitos, Calif., 1994.
P.W. Shor. Scheme for reducing decoherence in quantum computer memory. Physical Review A, 52(4):R2493–R2496, 1995.
P.W. Shor. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal Computing, 26(5):1484–1509, 1997.
P.W. Shor. Introduction to quantum algorithms. In Quantum Computation: A Grand Mathematical Challenge for the Twenty-First Century and the Millennium, (Washington, DC, 2000), volume 58 of Proceedings of the Symposium in Applied Mathematics, pages 143–159. American Mathematical Society, Providence, R.I., 2002.
P.W. Shor. Why haven’t more quantum algorithms been found? Journal of the ACM, 50(1):87–90, 2003.
R.A. Silverman. Introductory Complex Analysis. Dover Publications, Mineola, N.Y., 1984.
D.R. Simon. On the power of quantum computation. In Proceedings of the 35th Annual Symposium on Foundations of Computer Science, pages 116–123, Institute of Electrical and Electronic Engineers Computer Society Press, Los Alamitos, Calif., 1994.
D.R. Simon. On the power of quantum computation. SIAM Journal Computing, 26(5):1474–1483, 1997.
M. Sipser. Introduction to the Theory of Computation, Second Edition. Thomson Course Technology, Boston, 2005.
A.M. Steane. The ion trap quantum information processor. Applied Physics B, 64, 623, 1997.
A. Sudbery. Quantum Mechanics and the Particles of Nature: An Outline for Mathematicians. Cambridge University Press, Cambridge, UK, 1986.
D.H. Towne. Wave Phenomena. Dover Publications, Mineola, N.Y., 1989.
L.M.K. Vandersypen, G. Breyta, M. Steffen, C.S. Yannoni, M.H. Sherwood, and I.L. Chuang. Experimental realization of Shor’s quantum factoring algorithm using nuclear magnetic resonance. Nature, 414(6866):883–887, 2001.
U.V. Vazirani. A survey of qunatum complexity theory. In S. Lomonaco, Jr., editor, Quantum Computation: A Grand Mathematical Challenge for the Twenty-First Century and the Millennium, pages 193–217, 2002.
J. Watrous. On quantum and classical space-bounded processes with algebraic transition amplitudes. In IEEE Symposium on Foundations of Computer Science, pages 341–351, 1999.
R.L. White. Basic Quantum Mechanics. McGraw-Hill, New York, 1966.
S. Wiesner. Conjugate coding. SIGACT News, 15(1):78–88, 1983.
W.K. Wootters and W.H. Zurek. A single quantum cannot be cloned. Nature, 299(5886):802–803, October 1982.
A.C-C. Yao. Quantum circuit complexity. In Proceedings of 34th IEEE Symposium on Foundations of Computer Science, pages 352–361, 1993.
S. Zachos. Robustness of probabilistic computational complexity classes under definitional perturbations. Information and Control, 54(3):143–154, 1982.
P.A. Zizzi. Emergent consciousness: From the early universe to our mind. Available at http://arxiv.org/abs/gr-qc/0007006.
W.H. Zurek. Decoherence and the transition from quantum to classical – revisited. June 2003. Available at http://arxiv.org/abs/quant-ph/0306072.