Recent advances in both quantum hardware and algorithm development have made it possible to solve several optimization problems on modern quantum computers, with particular success for problems that can be mapped onto graphs. In general, quantum computing has the potential to solve optimization problems [1]}, [2]}, [3]}, [4]}. Combinatorial optimization problems (especially NP-hard problems) are of particular interest, since for many of these problems efficient classical algorithms are unknown.
