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 Aerospace Applications

Tobias Stollenwerk

Published Jan 1, 2017• 0 citations
OpenAlex

Abstract

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.

Related papers

Quantum Annealing for Air Traffic Management

Tobias Stollenwerk

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.

•Jul 26, 2016•0 citations

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 for industry applications: introduction and review

Sheir Yarkoni, Elena Raponi, Thomas Bäck +1 more

Quantum annealing (QA) is a heuristic quantum optimization algorithm that can be used to solve combinatorial optimization problems. In recent years, advances in quantum technologies have enabled the development of small- and intermediate-scale quantum processors that implement the QA algorithm for programmable use. Specifically, QA processors produced by D-Wave systems have been studied and tested extensively in both research and industrial settings across different disciplines. In this paper we provide a literature review of the theoretical motivations for QA as a heuristic quantum optimization algorithm, the software and hardware that is required to use such quantum processors, and the state-of-the-art applications and proofs-of-concepts that have been demonstrated using them. The goal of our review is to provide a centralized and condensed source regarding applications of QA technology. We identify the advantages, limitations, and potential of QA for both researchers and practitioners from various fields.

arXiv:2112.07491•Reports on Progress in Physics•Aug 24, 2022•429 citations

Kernel Approximation on a Quantum Annealer for Remote Sensing Regression Tasks

Edoardo Pasetto, Morris Riedel, Kristel F. L. Michielsen +1 more

The increased development of quantum computing hardware in recent years has led to increased interest in its application to various areas. Finding effective ways to apply this technology to real-world use-cases is a current area of research in the (RS) community. This paper proposes an (AQKS) kernel approximation algorithm with parallel quantum annealing on the D-Wave Advantage quantum annealer. The proposed implementation is applied to (SVR) and (GPR) algorithms. To evaluate its performance, a regression problem related to estimating chlorophyll concentration in water is considered. The proposed algorithm was tested on two real-world datasets and its results were compared with those obtained by a classical implementation of kernel-based algorithms and a (RKS) implementation. On average, the parallel (AQKS) achieved comparable results to the benchmark methods, indicating its potential for future applications.

IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing•Jan 1, 2024•5 citations

Recent Perspectives on Quantum Annealers

Masamichi J. Miyama, Masayuki Ohzeki

We will review the principles and applications of recently developing quantum annealers represented by D-Wave machines, and discuss the applicability to material materials science.

Vacuum and Surface Science•Mar 9, 2020•0 citations

Optimizing traffic flow using quantum annealing and classical machine learning

Florian Neukart, G. Compostella, Christian Seidel +3 more

Quantum annealing algorithms belong to the class of meta-heuristic tools, applicable for solving binary optimization problems. Hardware implementations of quantum annealing, such as the quantum processing units (QPUs) produced by D-Wave Systems, have been subject to multiple analyses in research, with the aim of characterizing the technology's usefulness for optimization and sampling tasks. In this paper, we present a real-world application that uses quantum technologies. Specifically, we show how to map certain parts of the real-world traffic flow optimization problem to be suitable for quantum annealing. We show that time-critical optimization tasks, such as continuous redistribution of position data for cars in dense road networks, are suitable candidates for quantum applications. Due to the limited size and connectivity of current-generation D-Wave QPUs, we use a hybrid quantum and classical approach to solve the traffic flow problem.

•Aug 4, 2017•1 citation
Quantum annealing (QA) is a heuristic quantum optimization algorithm that can be used to solve combinatorial optimization problems. In recent years, advances in quantum technologies have enabled the development of small- and intermediate-scale quantum processors that implement the QA algorithm for programmable use. Specifically, QA processors produced by D-Wave systems have been studied and tested extensively in both research and industrial settings across different disciplines. In this paper we provide a literature review of the theoretical motivations for QA as a heuristic quantum optimization algorithm, the software and hardware that is required to use such quantum processors, and the state-of-the-art applications and proofs-of-concepts that have been demonstrated using them. The goal of our review is to provide a centralized and condensed source regarding applications of QA technology. We identify the advantages, limitations, and potential of QA for both researchers and practitioners from various fields.
The increased development of quantum computing hardware in recent years has led to increased interest in its application to various areas. Finding effective ways to apply this technology to real-world use-cases is a current area of research in the (RS) community. This paper proposes an (AQKS) kernel approximation algorithm with parallel quantum annealing on the D-Wave Advantage quantum annealer. The proposed implementation is applied to (SVR) and (GPR) algorithms. To evaluate its performance, a regression problem related to estimating chlorophyll concentration in water is considered. The proposed algorithm was tested on two real-world datasets and its results were compared with those obtained by a classical implementation of kernel-based algorithms and a (RKS) implementation. On average, the parallel (AQKS) achieved comparable results to the benchmark methods, indicating its potential for future applications.
Quantum annealing algorithms belong to the class of meta-heuristic tools, applicable for solving binary optimization problems. Hardware implementations of quantum annealing, such as the quantum processing units (QPUs) produced by D-Wave Systems, have been subject to multiple analyses in research, with the aim of characterizing the technology's usefulness for optimization and sampling tasks. In this paper, we present a real-world application that uses quantum technologies. Specifically, we show how to map certain parts of the real-world traffic flow optimization problem to be suitable for quantum annealing. We show that time-critical optimization tasks, such as continuous redistribution of position data for cars in dense road networks, are suitable candidates for quantum applications. Due to the limited size and connectivity of current-generation D-Wave QPUs, we use a hybrid quantum and classical approach to solve the traffic flow problem.