Ising formulations of routing optimization problems

2020/12/09 by Daniel Jaroszewski, Jaroszewski, Daniel, Fabian Klos +3
Computer Science · #Complexity and Algorithms in Graphs #FOS: Physical sciences #Optimization and Search Problems #Quantum Computing Algorithms and Architecture #Quantum Physics (quant-ph)

paper · pdf · doi:10.48550/arxiv.2012.05022

openalex publication_date 2020/12/09 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We formulate binary optimization functions for single-vehicle routing, travelling salesperson and collision-free multi-vehicle routing with significant improvements in the number of variables over existing formulations. The provided functions are readily implemented on gate-based quantum computers using variational algorithms and on adiabatic quantum hardware.

Citations

• A Quantum Approximate Optimization Algorithm
• Quantum Computing in the NISQ era and beyond

Related

• Quantum computing for transport optimization
• Applying quantum approximate optimization to the heterogeneous vehicle routing problem
• Quantum-Assisted Vehicle Routing: Realizing QAOA-based Approach on Gate-Based Quantum Computer
• Qubit efficient quantum algorithms for the vehicle routing problem on NISQ processors
• Adiabatic Quantum Computing for Logistic Transport Optimization