Quantum computing for a profusion of postman problem variants

Abstract In this paper we study the viability of solving Chinese Postman Problem, a graph routing optimization problem, and many its variants on quantum annealing device. Routing problem considered include type, directionally varying weights, number parties involved in routing, among others. We put emphasis explanation how to convert such problems into quadratic unconstrained binary (QUBO) problems. QUBO is one two equivalent natural paradigms for devices, other being Ising Model. also expand upon previously discovered algorithm Problem closed undirected decrease constraints variables used problem. Optimal parameter settings constraint weight values are discussed based results from implementation D-Wave 2000Q Advantage. Results classical, purely quantum, hybrid algorithms compared.