Qu&Co comments on this publication:

In this paper, Andrew Lucas provides Ising formulations for many NP-complete and NP-hard problems, including all of Karp's 21 NP-complete problems. In each case, the required number of spins is at most cubic in the size of the problem. This work may be useful in designing adiabatic quantum optimization algorithms.

Page 9 of 9

What's Interesting?

How can we help you?

Invalid Input

Invalid Input

Invalid Input

Invalid Input

Invalid Input

Invalid Input

Copyright © Qu & Co BV
close