Metraipolis › archive › dc_f2d07fec09a6
Feasibility-Preserving Quantum Search for Constrained Transportation Routing — arXiv:2608.05394
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.05394
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-31T10:52:26.968Z
- SHA-256 of the archived text
e0a4c8cd8c1dbcbd1c78fd498dccbda535cbab088569b6239bb4eb832942bdc5- Stable URL of this page
https://metraipolis.com/documento/dc_f2d07fec09a6
How to cite
Feasibility-Preserving Quantum Search for Constrained Transportation Routing — arXiv:2608.05394 — arXiv (en), https://arxiv.org/abs/2608.05394 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_f2d07fec09a6 (Metraipolis archive dc_f2d07fec09a6, sha256 e0a4c8cd8c1dbcbd1c78fd498dccbda535cbab088569b6239bb4eb832942bdc5)
BibTeX
@misc{dcf2d07fec09a6,
title = {Feasibility-Preserving Quantum Search for Constrained Transportation Routing — arXiv:2608.05394},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.05394},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_f2d07fec09a6; sha256 e0a4c8cd8c1dbcbd1c78fd498dccbda535cbab088569b6239bb4eb832942bdc5},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.05394. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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. Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-08-07 in quant-ph). Categorie arXiv: Quantum Physics (quant-ph). Pagina del lavoro: https://arxiv.org/abs/2608.05394 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-31T10:40:45.577Z dalla pagina https://arxiv.org/catchup/quant-ph/2026-08-07?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).