Investigating the Chinese postman problem on a quantum annealer

Siloi, Ilaria; Carnevali, Virginia; Pokharel, Bibek; Fornari, Marco; Di Felice, Rosa

doi:10.1007/s42484-020-00031-9

Investigating the Chinese postman problem on a quantum annealer

Journal Article · Fri Jan 08 04:00:00 EST 2021 · Quantum Machine Intelligence

DOI:https://doi.org/10.1007/s42484-020-00031-9· OSTI ID:1777844

^[1]; ; ; ;

University of Southern California

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

View Accepted Manuscript (DOE)

Research Organization:: Univ. of Southern California, Los Angeles, CA (United States)

Sponsoring Organization:: USDOE Office of Science (SC), Basic Energy Sciences (BES)

Grant/Contract Number:: SC0019432

OSTI ID:: 1777844

Alternate ID(s):: OSTI ID: 1777849

Journal Information:: Quantum Machine Intelligence, Journal Name: Quantum Machine Intelligence Journal Issue: 1 Vol. 3; ISSN 2524-4906

Country of Publication:: United States

Language:: English

References (34)

On minimum walks in graphs: MINIMUM WALKS IN GRAPHS Hedetniemi, Stephen Naval Research Logistics Quarterly, Vol. 15, Issue 3 https://doi.org/10.1002/nav.3800150309	journal	September 1968
Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design Choi, Vicky Quantum Information Processing, Vol. 10, Issue 3 https://doi.org/10.1007/s11128-010-0200-3	journal	October 2010
Investigating the performance of an adiabatic quantum optimization processor Karimi, Kamran; Dickson, Neil G.; Hamze, Firas Quantum Information Processing, Vol. 11, Issue 1 https://doi.org/10.1007/s11128-011-0235-0	journal	February 2011
Algorithms for the Chinese postman problem on mixed networks Pearn, Wen Lea; Liu, C. M. Computers & Operations Research, Vol. 22, Issue 5 https://doi.org/10.1016/0305-0548(94)00036-8	journal	May 1995
Near-optimal geostationary transfer maneuvers with cooperative en-route inspection using hybrid optimal control Showalter, Daniel J.; Black, Jonathan T. Acta Astronautica, Vol. 105, Issue 2 https://doi.org/10.1016/j.actaastro.2014.09.013	journal	December 2014
A tabu search algorithm for the min–max k-Chinese postman problem Ahr, Dino; Reinelt, Gerhard Computers & Operations Research, Vol. 33, Issue 12 https://doi.org/10.1016/j.cor.2005.02.011	journal	December 2006
Quantum annealing with manufactured spins Johnson, M. W.; Amin, M. H. S.; Gildert, S. Nature, Vol. 473, Issue 7346 https://doi.org/10.1038/nature10012	journal	May 2011
Evidence for quantum annealing with more than one hundred qubits Boixo, Sergio; Rønnow, Troels F.; Isakov, Sergei V. Nature Physics, Vol. 10, Issue 3 https://doi.org/10.1038/nphys2900	journal	February 2014
Finite temperature quantum annealing solving exponentially small gap problem with non-monotonic success probability Mishra, Anurag; Albash, Tameem; Lidar, Daniel A. Nature Communications, Vol. 9, Issue 1 https://doi.org/10.1038/s41467-018-05239-9	journal	July 2018
Quantum annealing versus classical machine learning applied to a simplified computational biology problem Li, Richard Y.; Di Felice, Rosa; Rohs, Remo npj Quantum Information, Vol. 4, Issue 1 https://doi.org/10.1038/s41534-018-0060-8	journal	February 2018
Improving solutions by embedding larger subproblems in a D-Wave quantum annealer Okada, Shuntaro; Ohzeki, Masayuki; Terabe, Masayoshi Scientific Reports, Vol. 9, Issue 1 https://doi.org/10.1038/s41598-018-38388-4	journal	February 2019
Finding low-energy conformations of lattice protein models by quantum annealing Perdomo-Ortiz, Alejandro; Dickson, Neil; Drew-Brook, Marshall Scientific Reports, Vol. 2, Issue 1 https://doi.org/10.1038/srep00571	journal	August 2012
On the computational complexity of Ising spin glass models Barahona, F. Journal of Physics A: Mathematical and General, Vol. 15, Issue 10 https://doi.org/10.1088/0305-4470/15/10/028	journal	October 1982
An integrated programming and development environment for adiabatic quantum optimization S. Humble, T.; J. McCaskey, A.; S. Bennink, R. Computational Science & Discovery, Vol. 7, Issue 1 https://doi.org/10.1088/1749-4680/7/1/015006	journal	January 2014
Quantum annealing in the transverse Ising model Kadowaki, Tadashi; Nishimori, Hidetoshi Physical Review E, Vol. 58, Issue 5 https://doi.org/10.1103/PhysRevE.58.5355	journal	November 1998
What is the Computational Value of Finite-Range Tunneling? Denchev, Vasil S.; Boixo, Sergio; Isakov, Sergei V. Physical Review X, Vol. 6, Issue 3 https://doi.org/10.1103/PhysRevX.6.031015	journal	August 2016
Demonstration of a Scaling Advantage for a Quantum Annealer over Simulated Annealing Albash, Tameem; Lidar, Daniel A. Physical Review X, Vol. 8, Issue 3 https://doi.org/10.1103/PhysRevX.8.031016	journal	July 2018
Colloquium : Quantum annealing and analog quantum computation Das, Arnab; Chakrabarti, Bikas K. Reviews of Modern Physics, Vol. 80, Issue 3 https://doi.org/10.1103/RevModPhys.80.1061	journal	September 2008
Adiabatic quantum computation Albash, Tameem; Lidar, Daniel A. Reviews of Modern Physics, Vol. 90, Issue 1 https://doi.org/10.1103/RevModPhys.90.015002	journal	January 2018
Robot team in the improvement of the neighborhood Figueras, Albert; De La Rosa, Josep Lluis; Esteva, Santiago 2018 IEEE International Smart Cities Conference (ISC2) https://doi.org/10.1109/ISC2.2018.8656874	conference	September 2018
Architectural Considerations in the Design of a Superconducting Quantum Annealing Processor Bunyk, P. I.; Hoskinson, Emile M.; Johnson, Mark W. IEEE Transactions on Applied Superconductivity, Vol. 24, Issue 4 https://doi.org/10.1109/TASC.2014.2318294	journal	August 2014
Quantum Annealing Applied to De-Conflicting Optimal Trajectories for Air Traffic Management Stollenwerk, Tobias; OGorman, Bryan; Venturelli, Davide IEEE Transactions on Intelligent Transportation Systems, Vol. 21, Issue 1 https://doi.org/10.1109/TITS.2019.2891235	journal	January 2020
Theory of Quantum Annealing of an Ising Spin Glass Santoro, G. E. Science, Vol. 295, Issue 5564 https://doi.org/10.1126/science.1068774	journal	March 2002
Eulerian Walks in Graphs Goodman, S.; Hedetniemi, S. SIAM Journal on Computing, Vol. 2, Issue 1 https://doi.org/10.1137/0202003	journal	March 1973
Adiabatic Quantum Computation Is Equivalent to Standard Quantum Computation Aharonov, Dorit; van Dam, Wim; Kempe, Julia SIAM Review, Vol. 50, Issue 4 https://doi.org/10.1137/080734479	journal	January 2008
Reexamining classical and quantum models for the D-Wave One processor: The role of excited states and ground state degeneracy Albash, T.; Rønnow, T. F.; Troyer, M. The European Physical Journal Special Topics, Vol. 224, Issue 1 https://doi.org/10.1140/epjst/e2015-02346-0	journal	February 2015
Quadratic Binary Programming with Application to Capital-Budgeting Problems Laughhunn, D. J. Operations Research, Vol. 18, Issue 3 https://doi.org/10.1287/opre.18.3.454	journal	June 1970
Arc Routing Problems, Part I: The Chinese Postman Problem Eiselt, H. A.; Gendreau, Michel; Laporte, Gilbert Operations Research, Vol. 43, Issue 2 https://doi.org/10.1287/opre.43.2.231	journal	April 1995
Adiabatic Quantum Computation and Quantum Annealing: Theory and Practice McGeoch, Catherine C. Synthesis Lectures on Quantum Computing, Vol. 5, Issue 2 https://doi.org/10.2200/S00585ED1V01Y201407QMC008	journal	July 2014
Mapping Constrained Optimization Problems to Quantum Annealing with Application to Fault Diagnosis Bian, Zhengbing; Chudak, Fabian; Israel, Robert Brian Frontiers in ICT, Vol. 3 https://doi.org/10.3389/fict.2016.00014	journal	July 2016
Global Warming: Temperature Estimation in Annealers Raymond, Jack; Yarkoni, Sheir; Andriyash, Evgeny Frontiers in ICT, Vol. 3 https://doi.org/10.3389/fict.2016.00023	journal	November 2016
Traffic Flow Optimization Using a Quantum Annealer Neukart, Florian; Compostella, Gabriele; Seidel, Christian Frontiers in ICT, Vol. 4 https://doi.org/10.3389/fict.2017.00029	journal	December 2017
Optimization of Routes for Road Surface Inspection [Optimization of Routes for Road Surface Inspection] 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 https://doi.org/10.5220/0005711803620365	conference	February 2016
Uncertain Programming Model for Chinese Postman Problem with Uncertain Weights Zhang, Bo; Peng, Jin Industrial Engineering and Management Systems, Vol. 11, Issue 1 https://doi.org/10.7232/iems.2012.11.1.018	journal	March 2012

Similar Records

Quantum computing for a profusion of postman problem variants

Journal Article · Mon Jul 03 00:00:00 EDT 2023 · Quantum Machine Intelligence · OSTI ID:1992264

Solving larger maximum clique problems using parallel quantum annealing

Journal Article · Tue May 16 00:00:00 EDT 2023 · Quantum Information Processing · OSTI ID:2305312

Related Subjects

36 MATERIALS SCIENCE
quantum annealing
graph problems

Investigating the Chinese postman problem on a quantum annealer

Citation Formats

References (34)

Similar Records

Related Subjects