DOE PAGES title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Investigating the Chinese postman problem on a quantum annealer

Abstract

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 simulated annealing, and using a D-Wave device. The efficiency of quantum annealing with respect to the simulated annealing has been demonstrated using the optimal time to solution metric. 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

Authors:
ORCiD logo [1]; ORCiD logo [2]; ORCiD logo [1]; ORCiD logo [2]; ORCiD logo [1]
  1. Univ. of Southern California, Los Angeles, CA (United States)
  2. Central Michigan Univ., Mount Pleasant, MI (United States)
Publication Date:
Research Org.:
Univ. of Southern California, Los Angeles, CA (United States)
Sponsoring Org.:
USDOE Office of Science (SC), Basic Energy Sciences (BES)
OSTI Identifier:
1777849
Alternate Identifier(s):
OSTI ID: 1777844
Grant/Contract Number:  
SC0019432
Resource Type:
Accepted Manuscript
Journal Name:
Quantum Machine Intelligence
Additional Journal Information:
Journal Volume: 3; Journal Issue: 1; Journal ID: ISSN 2524-4906
Publisher:
Springer Nature
Country of Publication:
United States
Language:
English
Subject:
36 MATERIALS SCIENCE; quantum annealing; graph problems; D-wave; QUBO; routing problems; quantum annealing, graph problems

Citation Formats

Siloi, Ilaria, Carnevali, Virginia, Pokharel, Bibek, Fornari, Marco, and Di Felice, Rosa. Investigating the Chinese postman problem on a quantum annealer. United States: N. p., 2021. Web. doi:10.1007/s42484-020-00031-9.
Siloi, Ilaria, Carnevali, Virginia, Pokharel, Bibek, Fornari, Marco, & Di Felice, Rosa. Investigating the Chinese postman problem on a quantum annealer. United States. https://doi.org/10.1007/s42484-020-00031-9
Siloi, Ilaria, Carnevali, Virginia, Pokharel, Bibek, Fornari, Marco, and Di Felice, Rosa. Fri . "Investigating the Chinese postman problem on a quantum annealer". United States. https://doi.org/10.1007/s42484-020-00031-9. https://www.osti.gov/servlets/purl/1777849.
@article{osti_1777849,
title = {Investigating the Chinese postman problem on a quantum annealer},
author = {Siloi, Ilaria and Carnevali, Virginia and Pokharel, Bibek and Fornari, Marco and Di Felice, Rosa},
abstractNote = {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 simulated annealing, and using a D-Wave device. The efficiency of quantum annealing with respect to the simulated annealing has been demonstrated using the optimal time to solution metric. 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},
doi = {10.1007/s42484-020-00031-9},
journal = {Quantum Machine Intelligence},
number = 1,
volume = 3,
place = {United States},
year = {Fri Jan 08 00:00:00 EST 2021},
month = {Fri Jan 08 00:00:00 EST 2021}
}

Works referenced in this record:

Quantum annealing in the transverse Ising model
journal, November 1998


Quantum annealing versus classical machine learning applied to a simplified computational biology problem
journal, February 2018


Finding low-energy conformations of lattice protein models by quantum annealing
journal, August 2012

  • Perdomo-Ortiz, Alejandro; Dickson, Neil; Drew-Brook, Marshall
  • Scientific Reports, Vol. 2, Issue 1
  • DOI: 10.1038/srep00571

Mapping Constrained Optimization Problems to Quantum Annealing with Application to Fault Diagnosis
journal, July 2016


Traffic Flow Optimization Using a Quantum Annealer
journal, December 2017


Quantum Annealing Applied to De-Conflicting Optimal Trajectories for Air Traffic Management
journal, January 2020

  • Stollenwerk, Tobias; OGorman, Bryan; Venturelli, Davide
  • IEEE Transactions on Intelligent Transportation Systems, Vol. 21, Issue 1
  • DOI: 10.1109/TITS.2019.2891235

Near-optimal geostationary transfer maneuvers with cooperative en-route inspection using hybrid optimal control
journal, December 2014


Robot team in the improvement of the neighborhood
conference, September 2018

  • Figueras, Albert; De La Rosa, Josep Lluis; Esteva, Santiago
  • 2018 IEEE International Smart Cities Conference (ISC2)
  • DOI: 10.1109/ISC2.2018.8656874

Optimization of Routes for Road Surface Inspection [Optimization of Routes for Road Surface Inspection]
conference, February 2016

  • Gomes, Filipe F.; Gomes, Marta Castilho; Gonçalves, Alexandre B.
  • 5th International Conference on Operations Research and Enterprise Systems, Proceedings of 5th the International Conference on Operations Research and Enterprise Systems
  • DOI: 10.5220/0005711803620365

Colloquium : Quantum annealing and analog quantum computation
journal, September 2008


Adiabatic Quantum Computation and Quantum Annealing: Theory and Practice
journal, July 2014


Adiabatic Quantum Computation Is Equivalent to Standard Quantum Computation
journal, January 2008

  • Aharonov, Dorit; van Dam, Wim; Kempe, Julia
  • SIAM Review, Vol. 50, Issue 4
  • DOI: 10.1137/080734479

Quantum annealing with manufactured spins
journal, May 2011

  • Johnson, M. W.; Amin, M. H. S.; Gildert, S.
  • Nature, Vol. 473, Issue 7346
  • DOI: 10.1038/nature10012

Global Warming: Temperature Estimation in Annealers
journal, November 2016


Architectural Considerations in the Design of a Superconducting Quantum Annealing Processor
journal, August 2014

  • Bunyk, P. I.; Hoskinson, Emile M.; Johnson, Mark W.
  • IEEE Transactions on Applied Superconductivity, Vol. 24, Issue 4
  • DOI: 10.1109/TASC.2014.2318294

Evidence for quantum annealing with more than one hundred qubits
journal, February 2014

  • Boixo, Sergio; Rønnow, Troels F.; Isakov, Sergei V.
  • Nature Physics, Vol. 10, Issue 3
  • DOI: 10.1038/nphys2900

Reexamining classical and quantum models for the D-Wave One processor: The role of excited states and ground state degeneracy
journal, February 2015

  • Albash, T.; Rønnow, T. F.; Troyer, M.
  • The European Physical Journal Special Topics, Vol. 224, Issue 1
  • DOI: 10.1140/epjst/e2015-02346-0

Theory of Quantum Annealing of an Ising Spin Glass
journal, March 2002


What is the Computational Value of Finite-Range Tunneling?
journal, August 2016


Finite temperature quantum annealing solving exponentially small gap problem with non-monotonic success probability
journal, July 2018


Demonstration of a Scaling Advantage for a Quantum Annealer over Simulated Annealing
journal, July 2018


Investigating the performance of an adiabatic quantum optimization processor
journal, February 2011

  • Karimi, Kamran; Dickson, Neil G.; Hamze, Firas
  • Quantum Information Processing, Vol. 11, Issue 1
  • DOI: 10.1007/s11128-011-0235-0

Algorithms for the Chinese postman problem on mixed networks
journal, May 1995


A tabu search algorithm for the min–max k-Chinese postman problem
journal, December 2006


Uncertain Programming Model for Chinese Postman Problem with Uncertain Weights
journal, March 2012


Arc Routing Problems, Part I: The Chinese Postman Problem
journal, April 1995

  • Eiselt, H. A.; Gendreau, Michel; Laporte, Gilbert
  • Operations Research, Vol. 43, Issue 2
  • DOI: 10.1287/opre.43.2.231

On minimum walks in graphs: MINIMUM WALKS IN GRAPHS
journal, September 1968


Eulerian Walks in Graphs
journal, March 1973

  • Goodman, S.; Hedetniemi, S.
  • SIAM Journal on Computing, Vol. 2, Issue 1
  • DOI: 10.1137/0202003

Quadratic Binary Programming with Application to Capital-Budgeting Problems
journal, June 1970


An integrated programming and development environment for adiabatic quantum optimization
journal, January 2014


Improving solutions by embedding larger subproblems in a D-Wave quantum annealer
journal, February 2019


Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design
journal, October 2010


On the computational complexity of Ising spin glass models
journal, October 1982