Skip to main content
U.S. Department of Energy
Office of Scientific and Technical Information

Quantum computing for a profusion of postman problem variants

Journal Article · · Quantum Machine Intelligence
 [1];  [2];  [2]
  1. Los Alamos National Laboratory (LANL), Los Alamos, NM (United States); Univ. of California, Santa Barbara, CA (United States)
  2. Los Alamos National Laboratory (LANL), Los Alamos, NM (United States)

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.

Research Organization:
Los Alamos National Laboratory (LANL), Los Alamos, NM (United States)
Sponsoring Organization:
USDOE National Nuclear Security Administration (NNSA); USDOE Laboratory Directed Research and Development (LDRD) Program
Grant/Contract Number:
89233218CNA000001
OSTI ID:
1992264
Report Number(s):
LA-UR-22-27468
Journal Information:
Quantum Machine Intelligence, Journal Name: Quantum Machine Intelligence Journal Issue: 2 Vol. 5; ISSN 2524-4906
Publisher:
Springer NatureCopyright Statement
Country of Publication:
United States
Language:
English

References (18)

Quadratic unconstrained binary optimization problem preprocessing: Theory and empirical analysis journal June 2017
The directed Chinese Postman Problem journal January 2003
Graph Theory book November 2010
Tabu Search and Greedy Algorithm Adaptation to Logistic Task book May 2017
Quantum bridge analytics I: a tutorial on formulating and using QUBO models journal April 2022
Accuracy and minor embedding in subqubo decomposition with fully connected large problems: a case study about the number partitioning problem journal March 2020
Investigating the Chinese postman problem on a quantum annealer journal January 2021
Optimizing the optimizer: decomposition techniques for quantum annealing journal March 2021
Reduction of the molecular hamiltonian matrix using quantum community detection journal February 2021
Molecular dynamics on quantum annealers journal October 2022
Entanglement in a Quantum Annealing Processor journal May 2014
Simulated annealing algorithms: an overview journal January 1989
Accelerating finding euler circuit on CPU-GPGPU heterogeneous architecture conference August 2011
Graph Partitioning using Quantum Annealing on the D-Wave System
  • Ushijima-Mwesigwa, Hayato; Negre, Christian F. A.; Mniszewski, Susan M.
  • Proceedings of the Second International Workshop on Post Moores Era Supercomputing - PMES'17 https://doi.org/10.1145/3149526.3149531
conference January 2017
Nonnegative/Binary matrix factorization with a D-Wave quantum annealer journal December 2018
Detecting multiple communities using quantum annealing on the D-Wave system journal February 2020
A QUBO formulation for top-τ eigencentrality nodes journal July 2022
Training Restricted Boltzmann Machines With a D-Wave Quantum Annealer journal June 2021

Similar Records

Investigating the Chinese postman problem on a quantum annealer
Journal Article · Thu Jan 07 23:00:00 EST 2021 · Quantum Machine Intelligence · OSTI ID:1777844

Using Machine Learning for Quantum Annealing Accuracy Prediction
Journal Article · Mon Jun 21 00:00:00 EDT 2021 · Algorithms · OSTI ID:1814792