Quantum optimisation in cities: Limitations and prospects of urban transport systems

arxiv: 2604.02671 · v1 · submitted 2026-04-03 · 🧮 math.OC

Quantum optimisation in cities: Limitations and prospects of urban transport systems

Junxiang Xu , Chence Niu , Divya Jayakumar Nair , Vinayak Dixit This is my paper

Pith reviewed 2026-05-13 19:44 UTC · model grok-4.3

classification 🧮 math.OC

keywords quantum optimisationurban transport planninghybrid methodsscalabilitycombinatorial subproblemsclassical optimisation

0 comments p. Extension

The pith

Quantum optimisation shows no stable advantages yet for real urban transport systems.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper reviews quantum computing applications in urban transport planning and finds that stable and reproducible advantages over classical methods have not been demonstrated for full-scale systems. Classical techniques such as decomposition methods, metaheuristics, and reinforcement learning already deliver scalable and policy-interpretable solutions for medium and large networks. Quantum methods are positioned mainly for exploratory analysis of limited discrete combinatorial subproblems rather than complete system optimisation. The authors advocate shifting to problem-driven method selection and propose hybrid frameworks where classical methods maintain overall consistency while quantum components handle local exploration. Until engineering advantages are shown, the emphasis should be on validation, scenario suitability, and collaboration.

Core claim

Stable and reproducible advantages of quantum optimisation in real urban systems have yet to be shown. Quantum methods largely support exploratory analysis of limited combinatorial subproblems, whereas classical methods handle full medium and large networks scalably and interpretably. Hybrid frameworks are presented as the realistic integration path, with classical components ensuring system-level consistency and policy interpretability.

What carries the argument

Hybrid frameworks that pair classical methods for system-level consistency with quantum methods for local combinatorial exploration.

Load-bearing premise

The surveyed quantum and classical optimisation literature represents current capabilities and no near-term hardware breakthroughs will close the scalability gap for full urban networks.

What would settle it

A reproducible experiment in which a quantum algorithm solves a complete real-world urban transport network optimisation problem faster or more accurately than established classical methods.

Figures

Figures reproduced from arXiv: 2604.02671 by Chence Niu, Divya Jayakumar Nair, Junxiang Xu, Vinayak Dixit.

**Figure 1.** Figure 1: Urban transport systems as a multi-level decision environment. 1.2 Existing research on quantum computing in urban transport planning Although quantum computing has received growing attention in combinatorial optimisation in recent years, its application in urban transport systems remains at an early stage, with limited literature and relatively concentrated research directions. Existing studies mainly att… view at source ↗

**Figure 2.** Figure 2: Research timeline of quantum computing in transport studies 2017 to 2025 (The supporting references in this figure are provided in Appendix A) [PITH_FULL_IMAGE:figures/full_fig_p003_2.png] view at source ↗

read the original abstract

Recently, quantum computing has gained attention in urban studies as a tool for complex transport planning problems, but its role remains unclear. This paper reviews quantum computing research in urban transport planning and highlights major limits in scalability, robustness, constraint handling, and engineering feasibility.Stable and reproducible advantages of quantum optimisation in real urban systems have yet to be shown. By comparing quantum methods with established classical optimisation methods, it is found that decomposition methods, metaheuristics, and reinforcement learning already provide transparent, scalable, and policy-interpretable solutions for medium and large-sized urban transport networks. In contrast, the contribution of quantum methods largely lies in the exploratory analysis of limited, discrete combinatorial subproblems rather than full system-level optimisation. It is argued in this paper for a shift from technology-driven application narrative towards problem-driven method selection. From an urban transport planning perspective, we have identified the specific problem types where the exploratory use of quantum computing may be relevant, including critical link and node vulnerability identification, combinatorial screening of congestion and failure scenarios, disaster-related condition analysis, constrained path option selection, and small-scale facility location and investment option assessment. It is concluded that hybrid frameworks represent a more realistic pathway for integrating quantum computing into urban transport research, in which classical methods ensure systemlevel consistency and policy interpretability while quantum methods support local combinatorial exploration. Until stable engineering advantages are demonstrated, public agencies and researchers should prioritise method validation, scenario suitability, and cross-disciplinary collaboration.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

This review tempers hype around quantum optimization for urban transport by showing classical methods still dominate at scale, while flagging narrow niches where quantum might add value.

read the letter

The paper's main point is that quantum optimization has not produced stable, reproducible gains for real urban transport networks. It reviews the literature and concludes that decomposition methods, metaheuristics, and reinforcement learning already deliver scalable, interpretable solutions for medium and large problems, while quantum approaches remain limited to small combinatorial subproblems like vulnerability screening or scenario analysis. The argument for hybrid setups, with classical methods ensuring system-wide consistency, follows directly from the scalability and constraint-handling gaps it identifies. This gives planners a clearer map of where to test quantum tools without expecting system-level breakthroughs soon. The specific use cases listed—critical link identification, congestion scenario screening, disaster analysis, path selection, and small facility location—turn the review into something actionable rather than purely cautionary. The shift toward problem-driven method choice over technology-driven adoption is a straightforward and needed reminder. As a review it does not introduce new derivations or experiments, so the strength of the claims rests on how well the cited comparisons hold up; the abstract is light on quantitative benchmarks, but the full text appears to draw from established gaps in robustness and engineering feasibility. No load-bearing assumptions look circular or invented. The paper is aimed at transport researchers and planners weighing new optimization tools. It deserves peer review because it organizes the current evidence into usable boundaries and avoids overclaiming. I would send it out with a request for one or two summary tables comparing performance metrics across methods.

Referee Report

2 major / 2 minor

Summary. The manuscript reviews quantum computing applications to urban transport planning, emphasizing limitations in scalability, robustness, constraint handling, and engineering feasibility. It argues that stable and reproducible quantum advantages have not been demonstrated in real urban systems, with classical methods like decomposition, metaheuristics, and reinforcement learning providing better solutions for medium and large networks. The paper identifies specific problem types suitable for quantum methods and advocates for hybrid classical-quantum frameworks.

Significance. This review is significant in providing a critical, evidence-based assessment of quantum optimization's role in urban transport. By contrasting quantum approaches with established classical techniques and highlighting practical problem types for potential quantum use, it promotes a shift towards problem-driven method selection. The call for hybrid frameworks and cross-disciplinary collaboration offers actionable insights for advancing the field responsibly.

major comments (2)

Abstract: The claim that classical methods 'already provide transparent, scalable, and policy-interpretable solutions for medium and large-sized urban transport networks' requires explicit citations to supporting studies with quantitative performance data; without them, the comparison to quantum methods' limitations rests on an unverified literature survey.
Abstract: The statement that 'stable and reproducible advantages of quantum optimisation in real urban systems have yet to be shown' lacks references to specific scalability thresholds or failed demonstrations from the surveyed literature, weakening the load-bearing comparison between quantum and classical approaches.

minor comments (2)

Abstract: Typographical error: 'systemlevel' should be hyphenated as 'system-level'.
Abstract: The enumerated list of problem types suitable for quantum methods would be clearer if each item included a brief parenthetical note on its combinatorial structure or scale.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the constructive feedback on our review manuscript. We agree that strengthening the abstract with explicit citations will improve clarity and substantiation of the comparisons drawn. We will incorporate the suggested revisions in the next version.

read point-by-point responses

Referee: Abstract: The claim that classical methods 'already provide transparent, scalable, and policy-interpretable solutions for medium and large-sized urban transport networks' requires explicit citations to supporting studies with quantitative performance data; without them, the comparison to quantum methods' limitations rests on an unverified literature survey.

Authors: We agree that the abstract would benefit from direct citations. In the revised manuscript, we will add specific references to established studies (e.g., on Benders decomposition and large-scale metaheuristics applied to urban networks) that report quantitative metrics such as solution times, scalability to networks with thousands of links, and policy interpretability via sensitivity analysis. These will anchor the claim in the surveyed literature without altering the overall argument. revision: yes
Referee: Abstract: The statement that 'stable and reproducible advantages of quantum optimisation in real urban systems have yet to be shown' lacks references to specific scalability thresholds or failed demonstrations from the surveyed literature, weakening the load-bearing comparison between quantum and classical approaches.

Authors: We accept this point and will revise the abstract to include targeted citations. These will reference recent surveys and benchmark studies documenting current quantum hardware limits (e.g., qubit counts below 1000 for practical instances, noise-induced variability in QAOA/VQE results on combinatorial problems) and cases where quantum solvers have not yet matched classical performance on transport-sized instances. This will make the statement evidence-based while preserving the review's critical tone. revision: yes

Circularity Check

0 steps flagged

No significant circularity

full rationale

This is a review paper whose central claims derive from comparisons to external literature on quantum and classical optimization methods. No internal equations, fitted parameters, predictions, or self-citation chains are present that reduce any result to its own inputs by construction. The argument for hybrid frameworks follows from documented gaps in the surveyed studies rather than any self-referential derivation.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

As a review paper, the claims rest on the surveyed literature rather than new derivations; no free parameters, axioms, or invented entities are introduced by the authors themselves.

pith-pipeline@v0.9.0 · 5566 in / 1091 out tokens · 43990 ms · 2026-05-13T19:44:04.633570+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

6 extracted references · 6 canonical work pages · 1 internal anchor

[1]

arXiv preprint arXiv:2306.08507

Qubit efficient quantum algorithms for the vehicle routing problem on NISQ processors. arXiv preprint arXiv:2306.08507. Li, K., Shao, C., Hu, Z. & Shahidehpour, M. 2022a. An MILP method for optimal planning of electric vehicle charging stations in coordinated urban power and transportation networks. IEEE Transactions on Power Systems, 38, 5406-5419. Li, Y...

work page arXiv
[2]

Transportmetrica A: Transport Science, 1-31

Reinforcement learning in dynamic job shop scheduling: a comprehensive review of AI-driven approaches in modern manufacturing. Journal of Intelligent Manufacturing, 1-16. Niu, C., Irannezhad, E., Myers, C. & Dixit, V. 2025a. Quantum Computing in Transport Science: A Review. arXiv preprint arXiv:2503.21302. Niu, C., Rastogi, P., Soman, J., Tamuli, K. & Dix...

work page arXiv
[3]

arXiv preprint arXiv:2509.11469

Requirements for Early Quantum Advantage and Quantum Utility in the Capacitated Vehicle Routing Problem. arXiv preprint arXiv:2509.11469. Pavez, M. L., Soza -Parra, J. & Herrera, J. C

work page internal anchor Pith review arXiv
[4]

A framework to formulate pathfinding problems for quantum computing,

A framework to formulate pathfinding problems for quantum computing. arXiv preprint arXiv:2404.10820. Schetakis, N., Bonfini, P., Alisoltani, N., Blazakis, K., Tsintzos, S. I., Askitopoulos, A., Aghamalyan, D., Fafoutellis, P. & Vlahogianni, E. I

work page arXiv
[5]

Applied Sciences (2076-3417),

MNATS: A Multi -Neighborhood Adaptive Tabu Search Algorithm for the Distributed No-Wait Flow Shop Scheduling Problem. Applied Sciences (2076-3417),

work page 2076
[6]

Transportation Research Part D: Transport and Environment, 143, 104756

Decoding urban transportation: Trade -offs in mode choices using big data. Transportation Research Part D: Transport and Environment, 143, 104756. Page 21 of 21 Appendix A: Representative literature review on quantum computing in transport research Authors Data Title Journal Neukart F, Compostella G, Seidel C, Von Dollen D, Yarkoni S, Parney B 2017 Traffi...

work page 2017

[1] [1]

arXiv preprint arXiv:2306.08507

Qubit efficient quantum algorithms for the vehicle routing problem on NISQ processors. arXiv preprint arXiv:2306.08507. Li, K., Shao, C., Hu, Z. & Shahidehpour, M. 2022a. An MILP method for optimal planning of electric vehicle charging stations in coordinated urban power and transportation networks. IEEE Transactions on Power Systems, 38, 5406-5419. Li, Y...

work page arXiv

[2] [2]

Transportmetrica A: Transport Science, 1-31

Reinforcement learning in dynamic job shop scheduling: a comprehensive review of AI-driven approaches in modern manufacturing. Journal of Intelligent Manufacturing, 1-16. Niu, C., Irannezhad, E., Myers, C. & Dixit, V. 2025a. Quantum Computing in Transport Science: A Review. arXiv preprint arXiv:2503.21302. Niu, C., Rastogi, P., Soman, J., Tamuli, K. & Dix...

work page arXiv

[3] [3]

arXiv preprint arXiv:2509.11469

Requirements for Early Quantum Advantage and Quantum Utility in the Capacitated Vehicle Routing Problem. arXiv preprint arXiv:2509.11469. Pavez, M. L., Soza -Parra, J. & Herrera, J. C

work page internal anchor Pith review arXiv

[4] [4]

A framework to formulate pathfinding problems for quantum computing,

A framework to formulate pathfinding problems for quantum computing. arXiv preprint arXiv:2404.10820. Schetakis, N., Bonfini, P., Alisoltani, N., Blazakis, K., Tsintzos, S. I., Askitopoulos, A., Aghamalyan, D., Fafoutellis, P. & Vlahogianni, E. I

work page arXiv

[5] [5]

Applied Sciences (2076-3417),

MNATS: A Multi -Neighborhood Adaptive Tabu Search Algorithm for the Distributed No-Wait Flow Shop Scheduling Problem. Applied Sciences (2076-3417),

work page 2076

[6] [6]

Transportation Research Part D: Transport and Environment, 143, 104756

Decoding urban transportation: Trade -offs in mode choices using big data. Transportation Research Part D: Transport and Environment, 143, 104756. Page 21 of 21 Appendix A: Representative literature review on quantum computing in transport research Authors Data Title Journal Neukart F, Compostella G, Seidel C, Von Dollen D, Yarkoni S, Parney B 2017 Traffi...

work page 2017