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

Quantum Annealing for Air Traffic Management

Tobias Stollenwerk

Published Jul 26, 2016• 0 citations
OpenAlex

Abstract

The scheduling and maneuver planning for transatlantic flights is a hard real world problem. We report on our recent efforts to map a this problem to the D-Wave quantum annealer.

Related papers

Combinatorial Optimization of Aerospace Problems with Adiabatic Quantum Computers

Tobias Stollenwerk

We report on the mapping of hard optimization problems from aerospace research to the D-Wave quantum annealer.

•Oct 4, 2016•0 citations

Quantum Annealing Applied to De-Conflicting Optimal Trajectories for Air Traffic Management

Tobias Stollenwerk, Bryan O’Gorman, Davide Venturelli +6 more

We present the mapping of a class of simplified air traffic management problems (strategic conflict resolution) to quadratic unconstrained Boolean optimization problems. The mapping is performed through an original representation of the conflict-resolution problem in terms of a conflict graph, where the nodes of the graph represent flights and the edges represent a potential conflict between flights. The representation allows a natural decomposition of a real-world instance related to wind-optimal trajectories over the Atlantic Ocean into smaller subproblems that can be discretized and are amenable to be programmed in quantum annealers. In this paper, we tested the new programming techniques, and we benchmark the hardness of the instances using both classical solvers and the D-Wave 2X and D-Wave 2000Q quantum chip. The preliminary results show that for reasonable modeling choices, the most challenging subproblems which are programmable in the current devices are solved to optimality with 99% of probability within a second of annealing time.

arXiv:1711.04889•IEEE Transactions on Intelligent Transportation Systems•Feb 18, 2019•146 citations

Quantum Annealing for Aerospace Applications

Tobias Stollenwerk

In the recent years quantum annealing became increasingly important. Beside the investigation of fundamental properties it is imperative to find possible real world application for this technology. We will report on our efforts to map real world planning problems from aerospace research to a D-Wave quantum annealer.

•Jan 1, 2017•0 citations

Distributed Quantum Annealing on D-Wave for the Single Machine Total Weighted Tardiness Scheduling Problem

Wojciech Bożejko, Jarosław Pempera, Mariusz Uchroński +1 more

Lecture notes in computer science•Jan 1, 2022•7 citations

Constrained Quantum Optimization for Scheduling Aircraft Arrivals

Gaspard Cassassolles, Hian Lee Kwa, Teck Yoong Chai +1 more

Communications in computer and information science•Jan 1, 2026•0 citations

Quantum versus simulated annealing in wireless interference network optimization

Chi Wang, Huo Chen, EDMOND A. JONCKHEERE

Quantum annealing (QA) serves as a specialized optimizer that is able to solve many NP-hard problems and that is believed to have a theoretical advantage over simulated annealing (SA) via quantum tunneling. With the introduction of the D-Wave programmable quantum annealer, a considerable amount of effort has been devoted to detect and quantify quantum speedup. While the debate over speedup remains inconclusive as of now, instead of attempting to show general quantum advantage, here, we focus on a novel real-world application of D-Wave in wireless networking-more specifically, the scheduling of the activation of the air-links for maximum throughput subject to interference avoidance near network nodes. In addition, D-Wave implementation is made error insensitive by a novel Hamiltonian extra penalty weight adjustment that enlarges the gap and substantially reduces the occurrence of interference violations resulting from inevitable spin bias and coupling errors. The major result of this paper is that quantum annealing benefits more than simulated annealing from this gap expansion process, both in terms of ST99 speedup and network queue occupancy. It is the hope that this could become a real-word application niche where potential benefits of quantum annealing could be objectively assessed.

Scientific Reports•May 16, 2016•36 citations
We present the mapping of a class of simplified air traffic management problems (strategic conflict resolution) to quadratic unconstrained Boolean optimization problems. The mapping is performed through an original representation of the conflict-resolution problem in terms of a conflict graph, where the nodes of the graph represent flights and the edges represent a potential conflict between flights. The representation allows a natural decomposition of a real-world instance related to wind-optimal trajectories over the Atlantic Ocean into smaller subproblems that can be discretized and are amenable to be programmed in quantum annealers. In this paper, we tested the new programming techniques, and we benchmark the hardness of the instances using both classical solvers and the D-Wave 2X and D-Wave 2000Q quantum chip. The preliminary results show that for reasonable modeling choices, the most challenging subproblems which are programmable in the current devices are solved to optimality with 99% of probability within a second of annealing time.
Quantum annealing (QA) serves as a specialized optimizer that is able to solve many NP-hard problems and that is believed to have a theoretical advantage over simulated annealing (SA) via quantum tunneling. With the introduction of the D-Wave programmable quantum annealer, a considerable amount of effort has been devoted to detect and quantify quantum speedup. While the debate over speedup remains inconclusive as of now, instead of attempting to show general quantum advantage, here, we focus on a novel real-world application of D-Wave in wireless networking-more specifically, the scheduling of the activation of the air-links for maximum throughput subject to interference avoidance near network nodes. In addition, D-Wave implementation is made error insensitive by a novel Hamiltonian extra penalty weight adjustment that enlarges the gap and substantially reduces the occurrence of interference violations resulting from inevitable spin bias and coupling errors. The major result of this paper is that quantum annealing benefits more than simulated annealing from this gap expansion process, both in terms of ST99 speedup and network queue occupancy. It is the hope that this could become a real-word application niche where potential benefits of quantum annealing could be objectively assessed.