Minors of the D-Wave hardware architecture graph.
Image: DLR SC-HPC. 
Conflicts in transatlantic flights resolved
with a D-Wave quantum annealer.
Image: DLR SC-HPC/NASA. 
Visualization of a quadratic unconstraint binary optimization
problem as is it amenable to D-Wave
quantum annealers. Image: DLR SC-HPC.
Quantum annealers are machines that solve combinatorial optimization problems. There are some indications, that such machines might outperform classical computers for certain problems. Our research goals are twofold: First, we are investigating hard combinatorial optimization problems from aerospace research with respect to their applicability to quantum annealers. In the course of this, a mapping from the original problem to a quadratic unconstrained binary optimization problem (QUBO) is needed. Second, it is necessary to study and understand the physical properties of quantum annealers in order to understand the limitations and performance influencing factors of these machines. In collaboration with NASA’s Quantum Artificial Intelligience Laboratory we investigate several aerospace planning and scheduling problems on a D-Wave quantum annealer.
 Lobe, Elisabeth (2016) Quadratische binäre Optimierung ohne Nebenbedingungen auf Chimera-Graphen. Masterarbeit, Otto-von-Guericke-Universität Magdeburg.
 Stollenwerk et. al. Quantum Annealing Applied to De-Conflicting Optimal Trajectories for Air Traffic Management” https://arxiv.org/abs/1711.04889