Feasibility-Preserving Quantum Search for Constrained Transportation Routing

• URL: http://arxiv.org/abs/2608.05394v1
• Date: Wed, 05 Aug 2026 20:24:46 GMT
• Title: Feasibility-Preserving Quantum Search for Constrained Transportation Routing
• Abstract summary: Transportation routing problems involve strict feasibility requirements involving customer assignment and visit rules, route sequencing, and depot-return logic.<n>Most quantum routing formulations adopt Quadratic Unconstrained Binary Optimization encodings, where feasibility is incorporated indirectly via penalty terms in the cost Hamiltonian.<n>This study develops a transportation-grounded constraint-aware Quantum Alternating Operator Ansatz framework that embeds feasibility-preserving logic directly into the search operator.
• Score: 2.358614023689616
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Transportation routing problems such as the Traveling Salesperson Problem (TSP) and the Vehicle Routing Problem (VRP) are characterized by strict feasibility requirements involving customer assignment and visit rules, route sequencing, and depot-return logic alongside cost minimization. Most quantum routing formulations adopt Quadratic Unconstrained Binary Optimization (QUBO) encodings, where feasibility is incorporated indirectly via penalty terms in the cost Hamiltonian. While convenient for standard implementations of the Quantum Approximate Optimization Algorithm (QAOA), QUBO encodings allow the quantum search dynamics to allocate substantial probability to infeasible route configurations. This study develops a transportation-grounded constraint-aware Quantum Alternating Operator Ansatz (QAOA+) framework that embeds feasibility-preserving logic directly into the search operator. We introduce a custom mixer that functions as a quantum analogue of feasibility-preserving routing neighborhoods, using column-wise swap moves, it restricts evolution to feasible configurations while enabling structured exploration of valid routes. We compare three constraint-handling architectures: penalty-based QUBO QAOA, penalty free QAOA+ with the feasibility-preserving mixer, and a Hybrid QAOA+ combining mixer based feasibility with and penalty guidance. Results on small TSP and VRP instances show that constraint-handling architecture strongly influences feasible-route sampling, convergence behavior, and probability concentration over low-cost feasible routes. These findings position constraint-aware quantum search as a methodological extension of transportation routing search approaches, where feasibility is enforced through admissible quantum transitions rather than post-hoc penalties.

Related papers

• 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)
• Hardware-Efficient Quantum Optimization for Transportation Networks via Compressed Adiabatic Evolution [1.409283414986451]
  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.
  arXiv  Detail & Related papers  (2026-04-28T23:45:54Z)
• Improving Feasibility in Quantum Approximate Optimization Algorithm for Vehicle Routing via Constraint-Aware Initialization and Hybrid XY-X Mixing [2.204918347869259]
  Vehicle Routing Problem (VRP) is a core problem in logistics and transportation.<n> conventional Pauli-$X$ mixer can disrupt partial solution structures that satisfy key local constraints.<n>We propose a constraint-aware QAOA framework with two complementary components.
  arXiv  Detail & Related papers  (2026-04-08T15:39:22Z)
• 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)
• Crosstalk-Resilient Quantum MIMO for Scalable Quantum Communications [40.44880302154388]
  Crosstalk arises when physically coupled quantum modes interfere, degrading signal fidelity.<n>We propose a mitigation strategy based on encoding discrete-variable quantum information into continuous-variable modes.<n>We prove the existence of a gauge-fixing decoder enabling recovery of the logical information.
  arXiv  Detail & Related papers  (2025-06-26T18:40:26Z)
• 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)
• Characterizing randomness in parameterized quantum circuits through expressibility and average entanglement [39.58317527488534]
  Quantum Circuits (PQCs) are still not fully understood outside the scope of their principal application.<n>We analyse the generation of random states in PQCs under restrictions on the qubits connectivities.<n>We place a connection between how steep is the increase on the uniformity of the distribution of the generated states and the generation of entanglement.
  arXiv  Detail & Related papers  (2024-05-03T17:32:55Z)
• Reconfigurable Intelligent Surface (RIS)-Assisted Entanglement Distribution in FSO Quantum Networks [62.87033427172205]
  Quantum networks (QNs) relying on free-space optical (FSO) quantum channels can support quantum applications in environments where establishing an optical fiber infrastructure is challenging and costly. A reconfigurable intelligent surface (RIS)-assisted FSO-based QN is proposed as a cost-efficient framework providing a virtual line-of-sight between users for entanglement distribution.
  arXiv  Detail & Related papers  (2024-01-19T17:16:40Z)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• Scaling Limits of Quantum Repeater Networks [62.75241407271626]
  Quantum networks (QNs) are a promising platform for secure communications, enhanced sensing, and efficient distributed quantum computing. Due to the fragile nature of quantum states, these networks face significant challenges in terms of scalability. In this paper, the scaling limits of quantum repeater networks (QRNs) are analyzed.
  arXiv  Detail & Related papers  (2023-05-15T14:57:01Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)

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.