  The recent availability of quantum annealers has fueled a new area of
information technology where such devices are applied to address practically
motivated and computationally difficult problems with hardware that exploits
quantum mechanical phenomena. D-Wave annealers are promising platforms to solve
these problems in the form of quadratic unconstrained binary optimization. Here
we provide a formulation of the Chinese postman problem that can be used as a
tool for probing the local connectivity of graphs and networks. We treat the
problem classically with a tabu algorithm and using a D-Wave device. We
systematically analyze computational parameters associated with the specific
hardware. Our results clarify how the interplay between the embedding due to
limited connectivity of the Chimera graph, the definition of logical qubits,
and the role of spin-reversal controls the probability of reaching the expected
solution.
