Hardware-Efficient Quantum Optimization for Transportation Networks via Compressed Adiabatic Evolution

• URL: http://arxiv.org/abs/2604.26175v1
• Date: Tue, 28 Apr 2026 23:45:54 GMT
• Title: Hardware-Efficient Quantum Optimization for Transportation Networks via Compressed Adiabatic Evolution
• Abstract summary: Transportation systems such as urban logistics, vehicle routing, and infrastructure planning require solving large-scale optimization problems under complex constraints.<n>We develop a hardware-grounded hybrid quantum optimization framework that uses Approximate Quantum Compilation (AQC) to compress early segments of digitized adiabatic evolution into shallow circuits.<n>Results show that moderate prefix compression reduces two-qubit gate depth while maintaining or improving feasible solution, particularly for routing problems.
• Score: 1.409283414986451
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Transportation systems such as urban logistics, vehicle routing, and infrastructure planning require solving large-scale combinatorial optimization problems under complex constraints. Problems such as the vehicle routing problem (VRP), traveling salesman problem (TSP), and facility location problem (FLP) involve large discrete search spaces and the need to generate multiple feasible solutions in real time. In this work, we develop a hardware-grounded hybrid quantum optimization framework that uses Approximate Quantum Compilation (AQC) to compress early segments of digitized adiabatic evolution into shallow circuits. The compressed prefix is combined with variational layers, enabling a systematic study of how initialization, circuit depth, and expressivity interact on near-term quantum hardware. All experiments are performed on an IBM gate-based quantum computer, and circuits are evaluated as stochastic generators of candidate transportation plans. Results show that moderate prefix compression reduces two-qubit gate depth while maintaining or improving feasible solution discovery, particularly for routing problems. These benefits depend on compatibility between the compressed prefix and the variational ansatz: while standard QAOA effectively leverages AQC initialization, linear-chain QAOA shows limited improvement. Overall, this work demonstrates that hybrid AQC-QAOA methods provide a practical pathway for hardware-efficient quantum optimization, positioning quantum algorithms as candidate generators within transportation decision-making workflows.

Related papers

• SPLIT-Q: A Scalable Sequential Quantum Computing Framework for Coherent Controlled Islanding [10.677892416842944]
  Controlled islanding limits propagation by partitioning a compromised grid into connected, electrically sustainable islands.<n> classical methods face rapidly growing computational costs as network size and island count increase.<n>This study proposes a qubit-bounded sequential distributed quantum approximate optimization algorithm (QAOA) framework.
  arXiv  Detail & Related papers  (2026-08-13T01:47:54Z)
• PACE-QAOA: Physics-Constrained Quantum Optimization for Qubit-Efficient Power System Islanding [10.677892416842944]
  Controlled islanding partitions a stressed power network to limit disrupted power transfer while preserving operational integrity in every island.<n>This paper develops a qubit-efficient hybrid quantum formulation that overcomes limited qubit capacity.<n>A qubit-efficient Lagrangian strategy combines quantum optimization with classical refinement to enforce operational constraints.
  arXiv  Detail & Related papers  (2026-08-03T18:42:00Z)
• Hybrid Quantum Reinforcement Learning with QAOA for Improved Vehicle Routing Optimization [0.5131152350448099]
  We present a new hybrid approach that combines the Quantum Approximate Algorithm Optimization (QAOA) into the Quantum Reinforcement Learning (QRL) policy network.<n>This enhancement enables the agent to exploit problem specific particular quantum correlations when learning policies, and so richer exploration of the routing solution space.
  arXiv  Detail & Related papers  (2026-05-02T18:55:48Z)
• Hybrid Classical--Quantum Optimization of Wireless Routing Using QAOA and Quantum Walks [0.0]
  This paper investigates the use of hybrid classical--quantum methods for wireless routing.<n>The potential value of quantum routing lies in the treatment of difficult subproblems rather than end-to-end replacement of classical routing.
  arXiv  Detail & Related papers  (2026-04-01T01:48:57Z)
• AQER: a scalable and efficient data loader for digital quantum computers [62.40228216126285]
  We develop AQER, a scalable AQL method that constructs the loading circuit by systematically reducing entanglement in target states.<n>We conduct systematic experiments to evaluate the effectiveness of AQER, using synthetic datasets, classical image and language datasets, and a quantum many-body state datasets with up to 50 qubits.
  arXiv  Detail & Related papers  (2026-02-02T14:39:42Z)
• Quantum Approaches to Urban Logistics: From Core QAOA to Clustered Scalability [0.0]
  The Traveling Salesman Problem (TSP) is a fundamental challenge in optimization, widely applied in logistics and transportation.<n>Traditional algorithms often struggle to produce high-quality solutions within reasonable timeframes.<n>This study investigates the potential of the Quantum Approximate Optimization Algorithm (QAOA), a hybrid quantum-classical method.
  arXiv  Detail & Related papers  (2025-12-11T17:00:24Z)
• Quantum-Assisted Vehicle Routing: Realizing QAOA-based Approach on Gate-Based Quantum Computer [1.5119440099674915]
  Vehicle Problem Routing (VRP) is a fundamental optimization challenge with broad applications in logistics and transportation.<n>We present a quantum-assisted framework that integrates the Quantum Approximate Optimization Algorithm (QAOA) with a link-based formulation of VRP.<n>Our approach encodes flow conservation and subtour elimination directly into the cost Hamiltonian, preserving graph structure while avoiding ancillary qubits.
  arXiv  Detail & Related papers  (2025-05-02T22:31:01Z)
• Hybrid quantum optimization in the context of minimizing traffic congestion [0.0]
  We benchmark solutions obtained from the Quantum Approximate optimization Algorithm (QAOA)<n>In principle, as the number of QAOA layers approaches infinity, the solutions should reach optimality.<n>For NISQ devices with limited qubit connectivity and circuit depth, we introduce a noise-resilient variant of QAOA.<n>Our results show that this QAOA variant is surprisingly effective, outperforming QAOA on a physical IBM Quantum computer device.
  arXiv  Detail & Related papers  (2025-04-11T06:15:23Z)
• Bayesian Parameterized Quantum Circuit Optimization (BPQCO): A task and hardware-dependent approach [49.89480853499917]
  Variational quantum algorithms (VQA) have emerged as a promising quantum alternative for solving optimization and machine learning problems. In this paper, we experimentally demonstrate the influence of the circuit design on the performance obtained for two classification problems. We also study the degradation of the obtained circuits in the presence of noise when simulating real quantum computers.
  arXiv  Detail & Related papers  (2024-04-17T11:00:12Z)
• Reinforcement learning-assisted quantum architecture search for variational quantum algorithms [0.0]
  This thesis focuses on identifying functional quantum circuits in noisy quantum hardware. We introduce a tensor-based quantum circuit encoding, restrictions on environment dynamics to explore the search space of possible circuits efficiently. In dealing with various VQAs, our RL-based QAS outperforms existing QAS.
  arXiv  Detail & Related papers  (2024-02-21T12:30:39Z)
• Qubit efficient quantum algorithms for the vehicle routing problem on NISQ processors [48.68474702382697]
  Vehicle routing problem with time windows (VRPTW) is a common optimization problem faced within the logistics industry. In this work, we explore the use of a previously-introduced qubit encoding scheme to reduce the number of binary variables.
  arXiv  Detail & Related papers  (2023-06-14T13:44:35Z)
• Adiabatic Quantum Computing for Multi Object Tracking [170.8716555363907]
  Multi-Object Tracking (MOT) is most often approached in the tracking-by-detection paradigm, where object detections are associated through time. As these optimization problems are often NP-hard, they can only be solved exactly for small instances on current hardware. We show that our approach is competitive compared with state-of-the-art optimization-based approaches, even when using of-the-shelf integer programming solvers.
  arXiv  Detail & Related papers  (2022-02-17T18:59:20Z)
• Scaling Quantum Approximate Optimization on Near-term Hardware [49.94954584453379]
  We quantify scaling of the expected resource requirements by optimized circuits for hardware architectures with varying levels of connectivity. We show the number of measurements, and hence total time to synthesizing solution, grows exponentially in problem size and problem graph degree. These problems may be alleviated by increasing hardware connectivity or by recently proposed modifications to the QAOA that achieve higher performance with fewer circuit layers.
  arXiv  Detail & Related papers  (2022-01-06T21:02:30Z)
• Space-efficient binary optimization for variational computing [68.8204255655161]
  We show that it is possible to greatly reduce the number of qubits needed for the Traveling Salesman Problem. We also propose encoding schemes which smoothly interpolate between the qubit-efficient and the circuit depth-efficient models.
  arXiv  Detail & Related papers  (2020-09-15T18:17:27Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.