Quantum computing for a profusion of postman problem variants
Abstract
In this paper we study the viability of solving the Chinese Postman Problem, a graph routing optimization problem, and many of its variants on a quantum annealing device. Routing problem variants considered include graph type, directionally varying weights, number of parties involved in routing, among others. We put emphasis on the explanation of how to convert such problems into quadratic unconstrained binary optimization (QUBO) problems. QUBO is one of two equivalent natural paradigms for quantum annealing devices, the other being the Ising Model. We also expand upon a previously discovered algorithm for solving the Chinese Postman Problem on a closed undirected graph to decrease the number of constraints and variables used in the problem. Optimal annealing parameter settings and constraint weight values are discussed based on results from implementation on the D-Wave 2000Q and Advantage. Results from classical, purely quantum, and hybrid algorithms are compared.
- Authors:
-
[2];
[2]
- Los Alamos National Laboratory (LANL), Los Alamos, NM (United States); Univ. of California, Santa Barbara, CA (United States)
- Los Alamos National Laboratory (LANL), Los Alamos, NM (United States)
- Publication Date:
- Research Org.:
- Los Alamos National Laboratory (LANL), Los Alamos, NM (United States)
- Sponsoring Org.:
- USDOE National Nuclear Security Administration (NNSA); USDOE Laboratory Directed Research and Development (LDRD) Program
- OSTI Identifier:
- 1992264
- Report Number(s):
- LA-UR-22-27468
Journal ID: ISSN 2524-4906
- Grant/Contract Number:
- 89233218CNA000001
- Resource Type:
- Accepted Manuscript
- Journal Name:
- Quantum Machine Intelligence
- Additional Journal Information:
- Journal Volume: 5; Journal Issue: 2; Journal ID: ISSN 2524-4906
- Publisher:
- Springer Nature
- Country of Publication:
- United States
- Language:
- English
- Subject:
- 97 MATHEMATICS AND COMPUTING; D-Wave; quantum annealing; QUBO; routing problems
Citation Formats
Pion, Joel Ethan, Negre, Christian Francisco Andres, and Mniszewski, Susan M. Quantum computing for a profusion of postman problem variants. United States: N. p., 2023.
Web. doi:10.1007/s42484-023-00111-6.
Pion, Joel Ethan, Negre, Christian Francisco Andres, & Mniszewski, Susan M. Quantum computing for a profusion of postman problem variants. United States. https://doi.org/10.1007/s42484-023-00111-6
Pion, Joel Ethan, Negre, Christian Francisco Andres, and Mniszewski, Susan M. Mon .
"Quantum computing for a profusion of postman problem variants". United States. https://doi.org/10.1007/s42484-023-00111-6. https://www.osti.gov/servlets/purl/1992264.
@article{osti_1992264,
title = {Quantum computing for a profusion of postman problem variants},
author = {Pion, Joel Ethan and Negre, Christian Francisco Andres and Mniszewski, Susan M.},
abstractNote = {In this paper we study the viability of solving the Chinese Postman Problem, a graph routing optimization problem, and many of its variants on a quantum annealing device. Routing problem variants considered include graph type, directionally varying weights, number of parties involved in routing, among others. We put emphasis on the explanation of how to convert such problems into quadratic unconstrained binary optimization (QUBO) problems. QUBO is one of two equivalent natural paradigms for quantum annealing devices, the other being the Ising Model. We also expand upon a previously discovered algorithm for solving the Chinese Postman Problem on a closed undirected graph to decrease the number of constraints and variables used in the problem. Optimal annealing parameter settings and constraint weight values are discussed based on results from implementation on the D-Wave 2000Q and Advantage. Results from classical, purely quantum, and hybrid algorithms are compared.},
doi = {10.1007/s42484-023-00111-6},
journal = {Quantum Machine Intelligence},
number = 2,
volume = 5,
place = {United States},
year = {Mon Jul 03 00:00:00 EDT 2023},
month = {Mon Jul 03 00:00:00 EDT 2023}
}
Free Publicly Available Full Text
Publisher's Version of Record
Other availability
Search WorldCat to find libraries that may hold this journal
Save to My Library
You must Sign In or Create an Account in order to save documents to your library.
Works referenced in this record:
A QUBO formulation for top-τ eigencentrality nodes
journal, July 2022
- Akrobotu, Prosper D.; James, Tamsin E.; Negre, Christian F. A.
- PLOS ONE, Vol. 17, Issue 7
Accuracy and minor embedding in subqubo decomposition with fully connected large problems: a case study about the number partitioning problem
journal, March 2020
- Asproni, Luca; Caputo, Davide; Silva, Blanca
- Quantum Machine Intelligence, Vol. 2, Issue 1
Nonnegative/Binary matrix factorization with a D-Wave quantum annealer
journal, December 2018
- O’Malley, Daniel; Vesselinov, Velimir V.; Alexandrov, Boian S.
- PLOS ONE, Vol. 13, Issue 12
Entanglement in a Quantum Annealing Processor
journal, May 2014
- Lanting, T.; Przybysz, A. J.; Smirnov, A. Yu.
- Physical Review X, Vol. 4, Issue 2
Optimizing the optimizer: decomposition techniques for quantum annealing
journal, March 2021
- Bass, Gideon; Henderson, Maxwell; Heath, Joshua
- Quantum Machine Intelligence, Vol. 3, Issue 1
Training Restricted Boltzmann Machines With a D-Wave Quantum Annealer
journal, June 2021
- Dixit, Vivek; Selvarajan, Raja; Alam, Muhammad A.
- Frontiers in Physics, Vol. 9
Accelerating finding euler circuit on CPU-GPGPU heterogeneous architecture
conference, August 2011
- Ye, Jiachun; Yu, Songnian
- 2011 International Conference on Mechatronic Science, Electric Engineering and Computer (MEC)
Detecting multiple communities using quantum annealing on the D-Wave system
journal, February 2020
- Negre, Christian F. A.; Ushijima-Mwesigwa, Hayato; Mniszewski, Susan M.
- PLOS ONE, Vol. 15, Issue 2
Reduction of the molecular hamiltonian matrix using quantum community detection
journal, February 2021
- Mniszewski, Susan M.; Dub, Pavel A.; Tretiak, Sergei
- Scientific Reports, Vol. 11, Issue 1
The directed Chinese Postman Problem
journal, January 2003
- Thimbleby, Harold
- Software: Practice and Experience, Vol. 33, Issue 11
Graph Partitioning using Quantum Annealing on the D-Wave System
conference, January 2017
- Ushijima-Mwesigwa, Hayato; Negre, Christian F. A.; Mniszewski, Susan M.
- Proceedings of the Second International Workshop on Post Moores Era Supercomputing - PMES'17
Molecular dynamics on quantum annealers
journal, October 2022
- Gaidai, Igor; Babikov, Dmitri; Teplukhin, Alexander
- Scientific Reports, Vol. 12, Issue 1
Simulated annealing algorithms: an overview
journal, January 1989
- Rutenbar, R. A.
- IEEE Circuits and Devices Magazine, Vol. 5, Issue 1
Investigating the Chinese postman problem on a quantum annealer
journal, January 2021
- Siloi, Ilaria; Carnevali, Virginia; Pokharel, Bibek
- Quantum Machine Intelligence, Vol. 3, Issue 1
Quadratic unconstrained binary optimization problem preprocessing: Theory and empirical analysis
journal, June 2017
- Lewis, Mark; Glover, Fred
- Networks, Vol. 70, Issue 2
Quantum bridge analytics I: a tutorial on formulating and using QUBO models
journal, April 2022
- Glover, Fred; Kochenberger, Gary; Hennig, Rick
- Annals of Operations Research, Vol. 314, Issue 1