arXiv subjects

Tobias Stollenwerk

Publications and source records attributed to Tobias Stollenwerk.

27 records · Page 2Linked to original sources

arXiv2021

Performance of Domain-Wall Encoding for Quantum Annealing

In this paper we experimentally test the performance of the recently proposed domain-wall encoding of discrete variables from [Chancellor Quantum Sci. Technol. 4 045004] on Ising model flux qubit quantum annealers. We compare this encoding with the traditional one-hot methods and find that they outperform the one-hot encoding for three different problems at different sizes both of the problem and of the variables. From these results we conclude that the domain-wall encoding yields superior performance against a variety of metrics furthermore, we do not find a single metric by which one hot performs better. We even find that a 2000Q quantum annealer with a drastically less connected hardware graph but using the domain-wall encoding can outperform the next generation Advantage processor if that processor uses one-hot encoding.

quant-ph↗

arXiv2020

Embedding of Complete Graphs in Broken Chimera Graphs

In order to solve real world combinatorial optimization problems with a D-Wave quantum annealer it is necessary to embed the problem at hand into the D-Wave hardware graph, namely Chimera or Pegasus. Most hard real world problems exhibit a strong connectivity. For the worst case scenario of a complete graph, there exists an efficient solution for the embedding into the ideal Chimera graph. However, since real machines almost always have broken qubits it is necessary to find an embedding into the broken hardware graph. We present a new approach to the problem of embedding complete graphs into broken Chimera graphs. This problem can be formulated as an optimization problem, more precisely as a matching problem with additional linear constraints. Although being NP-hard in general it is fixed parameter tractable in the number of inaccessible vertices in the Chimera graph. We tested our exact approach on various instances of broken hardware graphs, both related to real hardware as well as randomly generated. For fixed runtime, we were able to embed larger complete graphs compared to previous, heuristic approaches. As an extension, we developed a fast heuristic algorithm which enables us to solve even larger instances. We compared the performance of our heuristic and exact approaches.

quant-ph↗

arXiv2020

Image Acquisition Planning for Earth Observation Satellites with a Quantum Annealer

We present a comparison study of state-of-the-art classical optimisation methods to a D-Wave 2000Q quantum annealer for the planning of Earth observation missions. The problem is to acquire high value images while obeying the attitude manoeuvring constraint of the satellite. In order to investigate close to real-world problems, we created benchmark problems by simulating realistic scenarios. Our results show that a tuned quantum annealing approach can run faster than a classical exact solver for some of the problem instances. Moreover, we find that the solution quality of the quantum annealer is comparable to the heuristic method used operationally for small problem instances, but degrades rapidly due to the limited precision of the quantum annealer.

quant-ph↗

arXiv2019

Performance of a Quantum Annealer for Ising Ground State Computations on Chimera Graphs

Quantum annealing is getting increasing attention in combinatorial optimization. The quantum processing unit by D-Wave is constructed to approximately solve Ising models on so-called Chimera graphs. Ising models are equivalent to quadratic unconstrained binary optimization (QUBO) problems and maximum cut problems on the associated graphs. We have tailored branch-and-cut as well as semidefinite programming algorithms for solving Ising models for Chimera graphs to provable optimality and use the strength of these approaches for comparing our solution values to those obtained on the current quantum annealing machine D-Wave 2000Q. This allows for the assessment of the quality of solutions produced by the D-Wave hardware. It has been a matter of discussion in the literature how well the D-Wave hardware performs at its native task, and our experiments shed some more light on this issue.

cs.DS↗

arXiv2019

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

We present the mapping of a class of simplified air traffic management (ATM) problems (strategic conflict resolution) to quadratic unconstrained boolean optimization (QUBO) problems. The mapping is performed through an original representation of the conflict-resolution problem in terms of a conflict graph, where nodes of the graph represent flights and 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 the study, 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.

quant-ph↗

arXiv2018

Flight Gate Assignment with a Quantum Annealer

Optimal flight gate assignment is a highly relevant optimization problem from airport management. Among others, an important goal is the minimization of the total transit time of the passengers. The corresponding objective function is quadratic in the binary decision variables encoding the flight-to-gate assignment. Hence, it is a quadratic assignment problem being hard to solve in general. In this work we investigate the solvability of this problem with a D-Wave quantum annealer. These machines are optimizers for quadratic unconstrained optimization problems (QUBO). Therefore the flight gate assignment problem seems to be well suited for these machines. We use real world data from a mid-sized German airport as well as simulation based data to extract typical instances small enough to be amenable to the D-Wave machine. In order to mitigate precision problems, we employ bin packing on the passenger numbers to reduce the precision requirements of the extracted instances. We find that, for the instances we investigated, the bin packing has little effect on the solution quality. Hence, we were able to solve small problem instances extracted from real data with the D-Wave 2000Q quantum annealer.

quant-ph↗

arXiv2018

TiGL - An Open Source Computational Geometry Library for Parametric Aircraft Design

This paper introduces the software TiGL: TiGL is an open source high-fidelity geometry modeler that is used in the conceptual and preliminary aircraft and helicopter design phase. It creates full three-dimensional models of aircraft from their parametric CPACS description. Due to its parametric nature, it is typically used for aircraft design analysis and optimization. First, we present the use-case and architecture of TiGL. Then, we discuss it's geometry module, which is used to generate the B-spline based surfaces of the aircraft. The backbone of TiGL is its surface generator for curve network interpolation, based on Gordon surfaces. One major part of this paper explains the mathematical foundation of Gordon surfaces on B-splines and how we achieve the required curve network compatibility. Finally, TiGL's aircraft component module is introduced, which is used to create the external and internal parts of aircraft, such as wings, flaps, fuselages, engines or structural elements.

cs.CG↗

arXiv2015

Theory of Curie temperature enhancement in electron-doped EuO

We present a comparative, theoretical study of the doping dependence of the critical temperature $T_C$ of the ferromagnetic insulator-metal transition in Gd-doped and O-deficient EuO, respectively. The strong $T_C$ enhancement in Eu$_{1-x}$Gd$_x$O is due to Kondo-like spin fluctuations on the Gd sites, which are absent in EuO$_{1-x}$. Moreover, we find that the $T_C$ saturation in Eu$_{1-x}$Gd$_x$O for large $x$ is due to a reduced activation of dopant electrons into the conduction band, in agreement with experiments, rather than antiferromagnetic long-range contributions of the RKKY interaction. The results shed light on possibilities for further increasing $T_C$.

cond-mat.mtrl-sci↗

arXiv2011

Efficient construction of maximally localized photonic Wannier functions: locality criterion and initial conditions

Wannier function expansions are well suited for the description of photonic- crystal-based defect structures, but constructing maximally localized Wannier functions by optimizing the phase degree of freedom of the Bloch modes is crucial for the efficiency of the approach. We systematically analyze different locality criteria for maximally localized Wannier functions in two- dimensional square and triangular lattice photonic crystals, employing (local) conjugate-gradient as well as (global) genetic-algorithm-based, stochastic methods. Besides the commonly used second moment (SM) locality measure, we introduce a new locality measure, namely the integrated modulus (IM) of the Wannier function. We show numerically that, in contrast to the SM criterion, the IM criterion leads to an optimization problem with a single extremum, thus allowing for fast and efficient construction of maximally localized Wannier functions using local optimization techniques. We also present an analytical formula for the initial choice of Bloch phases, which under certain conditions represents the global maximum of the IM criterion and, thus, further increases the optimization efficiency in the general case.

physics.optics↗