Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Deep-Dive Research & Critique: IQM/Deutsche Bahn Hybrid Quantum Railway Scheduling

Rowan Brad Quni-Gudzinas

Published Jul 22, 2026• 0 citations
Publisher

Abstract

A deep-dive research analysis and red-team critique of IQM Quantum Computers and Deutsche Bahn's July 2026 hybrid quantum-classical railway scheduling demonstration. The work evaluates claims made in The Qubit Report article, the IQM technical whitepaper, and the arXiv preprint (arXiv:2606.11383). The critique finds the demonstration is an honest proof-of-concept, substantially overclaimed in marketing: p=1 QAOA on fewer than or equal to 20-qubit subgraphs adds zero demonstrated advantage over classical methods, the central finding was measured with a classical solver, and no classical baseline was reported. Genuine contribution identified: clean MWIS reformulation of rolling stock planning. Includes literature cross-reference, calibration register, and 5-role red-team adversarial challenge.

DOI
10.5281/zenodo.21481125

Related papers

Quadratic and higher-order unconstrained binary optimization of railway rescheduling for quantum computing

Krzysztof Domino, Akash Kundu, Özlem Salehi +1 more

Abstract As consequences of disruptions in railway traffic affect passenger experience and satisfaction, appropriate rerouting and/or rescheduling is necessary. These problems are known to be NP-hard, given the numerous restrictions of traffic nature. With the recent advances in quantum technologies, quantum annealing has become an alternative method to solve such optimization problems. To use quantum annealing, the problem needs to be encoded in quadratic unconstrained binary optimization (QUBO) or higher-order binary optimization (HOBO) formulation that can be recast as a QUBO. This paper introduces QUBO and HOBO representations for rescheduling problems of railway traffic management; the latter is a new approach up to our knowledge. This new approach takes into account not only the single-track lines but also the double- and multi-track lines, as well as stations composed of tracks and switches. We consider the conditions of minimal headway between trains, minimal stay on stations, track occupation, and rolling stock circulation. Furthermore, a hybrid quantum-classical procedure is presented that includes rerouting. We demonstrate the proof of concept implementation on the D-Wave Quantum Processing Unit and D-Wave hybrid solver.

arXiv:2107.03234•Quantum Information Processing•Sep 29, 2022•26 citations

Hybrid quantum-classical computation for automatic guided vehicles scheduling

Tomasz Śmierzchalski, Jakub Pawłowski, Artur Przybysz +6 more

Motivated by recent efforts to develop quantum computing for practical, industrial-scale challenges, we demonstrate the effectiveness of state-of-the-art hybrid (not necessarily quantum) solvers in addressing the business-centric optimization problem of scheduling Automatic Guided Vehicles (AGVs). Some solvers can already leverage noisy intermediate-scale quantum (NISQ) devices. In our study, we utilize D-Wave hybrid solvers that implement classical heuristics with potential assistance from a quantum processing unit. This hybrid methodology performs comparably to existing classical solvers. However, due to the proprietary nature of the software, the precise contribution of quantum computation remains unclear. Our analysis focuses on a practical, business-oriented scenario: scheduling AGVs within a factory constrained by limited space, simulating a realistic production setting. Our approach maps a realistic AGVs problem onto one reminiscent of railway scheduling and demonstrates that the AGVs problem is better suited to quantum computing than its railway counterpart, the latter being denser in terms of the average number of constraints per variable. The main idea here is to highlight the potential usefulness of a hybrid approach for handling AGVs scheduling problems of practical sizes. We show that a scenario involving up to 21 AGVs, significant due to possible deadlocks, can be efficiently addressed by a hybrid solver in seconds.

arXiv:2309.03088•Scientific Reports•Sep 18, 2024•9 citations

EMU circulation planning for Silesian Railways: case study and a quantum approach

Ewa Kędziera, Wojciech Gamon, Mátyás Koniorczyk +3 more

We study daily rolling stock circulation planning for electric multiple units (EMUs) on a regional passenger network, focusing on services where identical EMUs may be coupled in pairs on selected routes. Motivated by the operational needs of the regional operator Silesian Railways in Poland, we formulate an acyclic mixed-integer linear program on a one-day horizon that incorporates depot balance constraints, demand-driven seat and bicycle capacity limits, and simple crew availability constraints. Using a graph/hyper-graph representation of train movements, we first solve an ILP formulation. We then derive a Quadratic Unconstrained Binary Optimization (QUBO) reformulation and evaluate its solution by quantum annealing on D-Wave Advantage systems and by the classical quantum-inspired VeloxQ solver. In computational experiments on real-world instances from the Silesian network, with up to 404 train trips and 11 EMU types, the ILP approach yields high-quality daily circulation plans within at most about 40 minutes. The quantum and quantum-inspired solvers are restricted to substantially smaller sub-instances due to the large number of terms in the QUBO and embedding limitations in the case of quantum hardware. These results quantify the present frontier of QUBO-based methods for rolling stock circulation. They can be helpful in designing a hybrid classical-quantum approach.

quant-pharXiv:2512.19340•Dec 23, 2025

Quantum computing for railway rescheduling: Literature review and future directions

Alexander Schuler, Steven Travis Waller, Riccardo Bassoli +1 more

The demand for rail transport is expected to increase due to growing mobility needs and shifts in transport policies. This growth will lead to a higher capacity utilization of existing networks, making disturbances more frequent. To minimize their impact, dispatchers engage in real-time traffic management by adjusting the timetable to resolve the arising conflicts. Given the limited time to identify high-quality solutions, developing computer-based optimization methods to support dispatchers can significantly enhance rail transport efficiency. However, this is a challenging task with high computational complexity particularly in large and dense railway networks. Quantum computing offers a possible research direction, as it may offer advantages over classical computing due to its unique properties. This paper introduces the fundamentals of quantum computing and explores its challenges and opportunities for real-time railway traffic management. For this purpose, the paper reviews existing approaches that use quantum computing in railway operations and related fields, and highlights open challenges. Finally, several further research directions are identified, ranging from detailed benchmarking to new algorithm development.

Transportation Research Interdisciplinary Perspectives•Jan 20, 2026•1 citation

Rolling Stock Planning Using the Quantum Approximate Optimization Algorithm

Jiří Guth Jarkovský, Patricia Bickert, Elisabeth Wybo +1 more

Rolling stock planning is a complex optimization problem in railway management that involves assigning physical trains to scheduled trips while minimizing operational costs. In this work, we address a specific instance of this problem featuring 190 trips over two days, subject to constraints such as mandatory maintenance stops. We reformulate the problem as a Maximum-Weight Independent Set (MWIS) problem on a graph where nodes represent feasible train cycles. To handle the computational complexity of the large search space, we propose a hybrid divide-and-conquer algorithm. This approach iteratively selects subgraphs and solves the MWIS problem using various solvers, including exact classical methods and the Quantum Approximate Optimization Algorithm (QAOA). We evaluate the algorithm's performance by comparing these methods and analyzing the scaling with respect to subgraph size, with QAOA assessed through both classical simulation and execution on a quantum device (IQM Emerald). Our results indicate that increasing the subgraph size generally improves solution quality, demonstrating that the hybrid framework can effectively bridge the gap between polynomial-time approximate solvers and exponential-time exact methods.

quant-pharXiv:2606.11383•Jun 11, 2026•0 citations

Auditing the BQNN: Does a Tunable Quantum Neural Network on Trapped-Ion and Superconducting Hardware Demonstrate a Route to Near-Term Quantum Advantage?

Rowan Brad Quni-Gudzinas

We audit the BQNN paper by Lakhdar-Hamina et al. (2025, PRL / arXiv:2507.21222v2) which implements a tunable quantum neural network on three quantum computing platforms. Through a complete Phase 1-4 research pipeline including a 5-adversary red-team audit, we evaluate every claim against the Physics of Computation criterion (joules-per-solution < classical alternative). We find the paper's strongest claim (multi-platform QNN benchmarking methodology) is sustained, while its quantum advantage claims are not sustained. Includes 5 calibration register predictions for future verification.

•Jul 25, 2026•0 citations
A deep-dive research analysis and red-team critique of IQM Quantum Computers and Deutsche Bahn's July 2026 hybrid quantum-classical railway scheduling demonstration. The work evaluates claims made in The Qubit Report article, the IQM technical whitepaper, and the arXiv preprint (arXiv:2606.11383). The critique finds the demonstration is an honest proof-of-concept, substantially overclaimed in marketing: p=1 QAOA on fewer than or equal to 20-qubit subgraphs adds zero demonstrated advantage over classical methods, the central finding was measured with a classical solver, and no classical baseline was reported. Genuine contribution identified: clean MWIS reformulation of rolling stock planning. Includes literature cross-reference, calibration register, and 5-role red-team adversarial challenge.
Abstract As consequences of disruptions in railway traffic affect passenger experience and satisfaction, appropriate rerouting and/or rescheduling is necessary. These problems are known to be NP-hard, given the numerous restrictions of traffic nature. With the recent advances in quantum technologies, quantum annealing has become an alternative method to solve such optimization problems. To use quantum annealing, the problem needs to be encoded in quadratic unconstrained binary optimization (QUBO) or higher-order binary optimization (HOBO) formulation that can be recast as a QUBO. This paper introduces QUBO and HOBO representations for rescheduling problems of railway traffic management; the latter is a new approach up to our knowledge. This new approach takes into account not only the single-track lines but also the double- and multi-track lines, as well as stations composed of tracks and switches. We consider the conditions of minimal headway between trains, minimal stay on stations, track occupation, and rolling stock circulation. Furthermore, a hybrid quantum-classical procedure is presented that includes rerouting. We demonstrate the proof of concept implementation on the D-Wave Quantum Processing Unit and D-Wave hybrid solver.
Motivated by recent efforts to develop quantum computing for practical, industrial-scale challenges, we demonstrate the effectiveness of state-of-the-art hybrid (not necessarily quantum) solvers in addressing the business-centric optimization problem of scheduling Automatic Guided Vehicles (AGVs). Some solvers can already leverage noisy intermediate-scale quantum (NISQ) devices. In our study, we utilize D-Wave hybrid solvers that implement classical heuristics with potential assistance from a quantum processing unit. This hybrid methodology performs comparably to existing classical solvers. However, due to the proprietary nature of the software, the precise contribution of quantum computation remains unclear. Our analysis focuses on a practical, business-oriented scenario: scheduling AGVs within a factory constrained by limited space, simulating a realistic production setting. Our approach maps a realistic AGVs problem onto one reminiscent of railway scheduling and demonstrates that the AGVs problem is better suited to quantum computing than its railway counterpart, the latter being denser in terms of the average number of constraints per variable. The main idea here is to highlight the potential usefulness of a hybrid approach for handling AGVs scheduling problems of practical sizes. We show that a scenario involving up to 21 AGVs, significant due to possible deadlocks, can be efficiently addressed by a hybrid solver in seconds.
We study daily rolling stock circulation planning for electric multiple units (EMUs) on a regional passenger network, focusing on services where identical EMUs may be coupled in pairs on selected routes. Motivated by the operational needs of the regional operator Silesian Railways in Poland, we formulate an acyclic mixed-integer linear program on a one-day horizon that incorporates depot balance constraints, demand-driven seat and bicycle capacity limits, and simple crew availability constraints. Using a graph/hyper-graph representation of train movements, we first solve an ILP formulation. We then derive a Quadratic Unconstrained Binary Optimization (QUBO) reformulation and evaluate its solution by quantum annealing on D-Wave Advantage systems and by the classical quantum-inspired VeloxQ solver. In computational experiments on real-world instances from the Silesian network, with up to 404 train trips and 11 EMU types, the ILP approach yields high-quality daily circulation plans within at most about 40 minutes. The quantum and quantum-inspired solvers are restricted to substantially smaller sub-instances due to the large number of terms in the QUBO and embedding limitations in the case of quantum hardware. These results quantify the present frontier of QUBO-based methods for rolling stock circulation. They can be helpful in designing a hybrid classical-quantum approach.
The demand for rail transport is expected to increase due to growing mobility needs and shifts in transport policies. This growth will lead to a higher capacity utilization of existing networks, making disturbances more frequent. To minimize their impact, dispatchers engage in real-time traffic management by adjusting the timetable to resolve the arising conflicts. Given the limited time to identify high-quality solutions, developing computer-based optimization methods to support dispatchers can significantly enhance rail transport efficiency. However, this is a challenging task with high computational complexity particularly in large and dense railway networks. Quantum computing offers a possible research direction, as it may offer advantages over classical computing due to its unique properties. This paper introduces the fundamentals of quantum computing and explores its challenges and opportunities for real-time railway traffic management. For this purpose, the paper reviews existing approaches that use quantum computing in railway operations and related fields, and highlights open challenges. Finally, several further research directions are identified, ranging from detailed benchmarking to new algorithm development.
Rolling stock planning is a complex optimization problem in railway management that involves assigning physical trains to scheduled trips while minimizing operational costs. In this work, we address a specific instance of this problem featuring 190 trips over two days, subject to constraints such as mandatory maintenance stops. We reformulate the problem as a Maximum-Weight Independent Set (MWIS) problem on a graph where nodes represent feasible train cycles. To handle the computational complexity of the large search space, we propose a hybrid divide-and-conquer algorithm. This approach iteratively selects subgraphs and solves the MWIS problem using various solvers, including exact classical methods and the Quantum Approximate Optimization Algorithm (QAOA). We evaluate the algorithm's performance by comparing these methods and analyzing the scaling with respect to subgraph size, with QAOA assessed through both classical simulation and execution on a quantum device (IQM Emerald). Our results indicate that increasing the subgraph size generally improves solution quality, demonstrating that the hybrid framework can effectively bridge the gap between polynomial-time approximate solvers and exponential-time exact methods.
We audit the BQNN paper by Lakhdar-Hamina et al. (2025, PRL / arXiv:2507.21222v2) which implements a tunable quantum neural network on three quantum computing platforms. Through a complete Phase 1-4 research pipeline including a 5-adversary red-team audit, we evaluate every claim against the Physics of Computation criterion (joules-per-solution < classical alternative). We find the paper's strongest claim (multi-platform QNN benchmarking methodology) is sustained, while its quantum advantage claims are not sustained. Includes 5 calibration register predictions for future verification.