Adiabatic Quantum Computing

Adiabatic Quantum Computing (AQC) is a relatively new subject in the world of quantum computing, let alone Physics. Inspiration for this project has come from recent controversy around D-Wave Systems in British Columbia, Canada, who claim to have built a working AQC which is now commercially available and hope to be distributing a 1024 qubit chip by the end of 2008. Their 16 qubit chip was demonstrated online for the Supercomputing 2007 conference within which a few small problems were solved; although the explanations that journalists and critics received were minimal and very little was divulged in the question and answer session. This 'unconvincing' demonstration has caused physicists and computer scientists to hit back at D-Wave. The aim of this project is to give an introduction to the historic advances in classical and quantum computing and to explore the methods of AQC. Through numerical simulations an algorithm for the Max Independent Set problem is empirically obtained.

[1]  Lov K. Grover.  A fast quantum mechanical algorithm for database search , 1996, STOC '96.

[2]  P. Shor,et al.  Error Correcting Codes For Adiabatic Quantum Computation , 2005, quant-ph/0512170.

[3]  Superconducting system for adiabatic quantum computing , 2006 .

[4]  D. Lidar,et al.  Adiabatic quantum computation in open systems. , 2005, Physical review letters.

[5]  Daniel A Lidar,et al.  Simple proof of equivalence between adiabatic quantum computation and the circuit model. , 2007, Physical review letters.

[6]  W. Wootters.  Entanglement of Formation of an Arbitrary State of Two Qubits , 1997, quant-ph/9709029.

[7]  Scott Aaronson,et al.  The limits of quantum computers. , 2008 .

[8]  David P. DiVincenzo,et al.  A pr 2 00 0 The Physical Implementation of Quantum Computation , 2000 .

[9]  F. Barahona.  On the computational complexity of Ising spin glass models , 1982 .

[10]  Seth Lloyd,et al.  Adiabatic quantum computation is equivalent to standard quantum computation , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[11]  I. Chuang,et al.  Quantum Computation and Quantum Information: Bibliography , 2010 .

[12]  E. Farhi,et al.  A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem , 2001, Science.

[13]  Todd A. Brun,et al.  Quantum Computing , 2011, Computer Science, The Hardware, Software and Heart of It.

[14]  E. Sjoqvist,et al.  Quantum adiabatic search with decoherence in the instantaneous energy eigenbasis (16 pages) , 2005, quant-ph/0507010.

[15]  Md. Saidur Rahman,et al.  Efficient algorithms for drawing planar graphs , 1999 .

[16]  M. Sipser,et al.  Quantum Computation by Adiabatic Evolution , 2000, quant-ph/0001106.

[17]  David S. Johnson,et al.  Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..

[18]  D. Chandler,et al.  Introduction To Modern Statistical Mechanics , 1987 .

[19]  G.E. Moore,et al.  Cramming More Components Onto Integrated Circuits , 1998, Proceedings of the IEEE.

[20]  Peter W. Shor,et al.  Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..

[21]  DiVincenzo.  Two-bit gates are universal for quantum computation. , 1994, Physical review. A, Atomic, molecular, and optical physics.

[22]  N. Cerf,et al.  Noise resistance of adiabatic quantum computation using random matrix theory , 2004, quant-ph/0409127.

[23]  H. F. Mattson,et al.  Error-Correcting Codes , 1971 .

[24]  Seth Lloyd,et al.  Scalable Architecture for Adiabatic Quantum Computing of Np-Hard Problems , 2004 .