Solving Hard Problems on Adiabatic Quantum Computers

Quantum Computation has thus far proven a promising new research field, with results that vastly surpass their classical counterparts, but programming a quantum computer is in its infant stage, at best. D-Wave have successfully implemented a computing machine based on adiabatic evolution which natively solves Ising problems by construction. In this paper we present additional solutions to known computational problems by reducing them to mathematical expressions. They will be passed to the quantum computer through Blackbox, a mechanism that maps objective functions to the native Ising form the D-Wave machine recognizes.

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

[2]  Umesh V. Vazirani,et al.  How powerful is adiabatic quantum computation? , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

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

[4]  M. W. Johnson,et al.  Quantum annealing with manufactured spins , 2011, Nature.

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

[6]  Vicky Choi,et al.  Adiabatic Quantum Algorithms for the NP-Complete Maximum-Weight Independent Set, Exact Cover and 3SAT Problems , 2010, ArXiv.

[7]  D. Deutsch,et al.  Rapid solution of problems by quantum computation , 1992, Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences.

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

[9]  Vicky Choi,et al.  Minor-embedding in adiabatic quantum computation: I. The parameter setting problem , 2008, Quantum Inf. Process..