Adiabatic Quantum Optimization Fails to Solve the Knapsack Problem

In this work, we attempt to solve the integer-weight knapsack problem using the D-Wave 2000Q adiabatic quantum computer. The knapsack problem is a well-known NP-complete problem in computer science, with applications in economics, business, finance, etc. We attempt to solve a number of small knapsack problems whose optimal solutions are known; we find that adiabatic quantum optimization fails to produce solutions corresponding to optimal filling of the knapsack in all problem instances. We compare results obtained on the quantum hardware to the classical simulated annealing algorithm and two solvers employing a hybrid branch-and-bound algorithm. The simulated annealing algorithm also fails to produce the optimal filling of the knapsack, though solutions obtained by simulated and quantum annealing are no more similar to each other than to the correct solution. We discuss potential causes for this observed failure of adiabatic quantum optimization.

[1]  B. Cipra.  The Ising Model Is NP-Complete , 2000 .

[2]  Paolo Toth,et al.  New trends in exact algorithms for the 0-1 knapsack problem , 2000, Eur. J. Oper. Res..

[3]  E. L. Lawler,et al.  Branch-and-Bound Methods: A Survey , 1966, Oper. Res..

[4]  Richard M. Karp,et al.  Reducibility among combinatorial problems" in complexity of computer computations , 1972 .

[5]  Deeparnab Chakrabarty,et al.  Knapsack Problems , 2008 .

[6]  René Beier,et al.  Random knapsack in expected polynomial time , 2003, STOC '03.

[7]  Catherine D. Schuman,et al.  Efficiently embedding QUBO problems on adiabatic quantum computers , 2019, Quantum Information Processing.

[8]  P. Anderson,et al.  Application of statistical mechanics to NP-complete problems in combinatorial optimisation , 1986 .

[9]  R. Car,et al.  Theory of Quantum Annealing of an Ising Spin Glass , 2002, Science.

[10]  Andrew Lucas,et al.  Ising formulations of many NP problems , 2013, Front. Physics.

[11]  John Preskill,et al.  Quantum Computing in the NISQ era and beyond , 2018, Quantum.

[12]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[13]  J. J. Sakurai,et al.  Modern Quantum Mechanics , 1986 .

[14]  Edward Farhi,et al.  Quantum adiabatic algorithms, small gaps, and different paths , 2009, Quantum Inf. Comput..

[15]  Jérémie Roland,et al.  Anderson localization makes adiabatic quantum optimization fail , 2009, Proceedings of the National Academy of Sciences.

[16]  V. Choi,et al.  First-order quantum phase transition in adiabatic quantum computation , 2009, 0904.1387.

[17]  Jérémie Roland,et al.  Adiabatic quantum optimization fails for random instances of NP-complete problems , 2009, ArXiv.

[18]  Klaudia Frankfurter.  Computers And Intractability A Guide To The Theory Of Np Completeness , 2016 .

[19]  Lian-Ao Wu,et al.  Ultrafast adiabatic quantum algorithm for the NP-complete exact cover problem , 2016, Scientific Reports.

[20]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[21]  Prasanna Date,et al.  QUBO formulations for training machine learning models , 2020, Scientific Reports.

[22]  Alex Gershkov,et al.  Revenue maximization in the dynamic knapsack problem , 2011 .