Solving the Network Shortest Path Problem on a Quantum Annealer

Abstract

This article addresses the formulation for implementing a single source, single-destination shortest path algorithm on a quantum annealing computer. Three distinct approaches are presented. In all the three cases, the shortest path problem is formulated as a quadratic unconstrained binary optimization problem amenable to quantum annealing. The first implementation builds on existing quantum annealing solutions to the traveling salesman problem, and requires the anticipated maximum number of vertices on the solution path |P| to be provided as an input. For a graph with |V | vertices, |E| edges, and no self-loops, it encodes the problem instance using |V ||P| qubits. The second implementation adapts the linear programming formulation of the shortest path problem, and encodes the problem instance using |E| qubits for directed graphs or 2|E| qubits for undirected graphs. The third implementation, designed exclusively for undirected graphs, encodes the problem in |E| + |V | qubits. Scaling factors for penalty terms, complexity of coupling matrix construction, and numerical estimates of the annealing time required to find the shortest path are made explicit in the article. INDEX TERMSQuantum annealing, quantum computing, shortest path problem, simulated annealing. Engineering uantum Transactions on IEEE Krauss and McCollum: SOLVING THE NETWORK SHORTEST PATH PROBLEM ON A QUANTUM ANNEALER FIGURE 1. Example undirected graph with specified edge costs.

Optimization on Large Interconnected Graphs and Networks Using Adiabatic Quantum Computation

“…In this paper we have managed to show that we can embed large, scale free graphs onto an adiabatic quantum computer to the maximum extent of its capabilities to solve binary optimisation problems. We were attempting to scale QUBO models which have been previously established in great detail in recent times [12]. Since we have prioritized optimal performance in terms of speed and scale to account for impact, We have introduced constraints to the range of values the edgeweights to simplify the problem so that on a large scale, QUBO models can be accurately run and can show significant speed up for a classic NP-hard problem.…”

A Systematic Literature Review of Quantum Computing for Routing Problems

“…Here, we can distinguish optimization problems in graphs, such as the Hamiltonian Cycle 3 in [30], [60] or Graph Traversal problems (such as eulerian tours or optimal postman tours) in [34], [36]. Other works encompass studies dealing with the well-known shortest path problem in [53], [75] or the less studied longest path problem [57]. Finally, it is interesting to highlight those works which combine several techniques or even present the problem from a mixed technical perspective.…”

Hybrid Classical-Quantum Optimization Techniques for Solving Mixed-Integer Programming Problems in Production Scheduling

“…Evaluation of solving the QUBO problems with quantum annealers is reliant on factors like computation of the linear and quadratic coefficients of the QUBO and the number of qubits required to solve each QUBO problem [36]. The annealing time is also an important aspect of evaluating performance and is affected by the annealing parameters used by specific quantum annealers [37]. However, this is subject to ongoing research and is treated as constant in this work [36,38].…”