Quantum Annealing is an algorithm for solving instances of quadratic unconstrained binary optimization (QUBO) that is implemented in hardware utilizing quantum effects to quickly find approximate...
A Quantum Annealing Algorithm for Finding Pure Nash Equilibria in Graphical Games Christoph Roch, Thomy Phan, Sebastian Feld, Robert Müller, Thomas Gabor, Carsten Hahn, Claudia Linnhoff-Popien...
Approximating Archetypal Analysis Using Quantum Annealing S. Feld, C. Roch, K. Geirhos, and T. Gabor Abstract Archetypes are those extreme values of a data set that can jointly represent all other...
CSG trees are an intuitive, yet powerful technique for the representation of geometry using a combination of Boolean set-operations and geometric primitives. In general, there exists an infinite...
The Dynamic Time Warping Distance Measure as QUBO Formulation S. Feld, C. Roch, T. Gabor, M. To, and C. Linnhoff-Popien Abstract Dynamic Time Warping (DTW) is a representative of a distance measure...
Insights on Training Neural Networks for QUBO Tasks T. Gabor, S. Feld, H. Safi, T. Phan, and C. Linnhoff-Popien Abstract Current hardware limitations restrict the potential when solving quadratic...
We discuss the synergetic connection between quantum computing and artificial intelligence. After surveying current approaches to quantum artificial intelligence and relating them to a formal model...
In this paper, we explore how problems’ approximate versions of varying degree can be systematically constructed for quantum annealer programs, and how this influences result quality or the...
We describe existing Ising formulations for the maximum clique search problem and the smallest exact cover problem, both of which are important building blocks of the proposed compression pipeline....
We experimentally investigate if and how the degree of approximability influences implementation and run-time performance. Our experiments indicate a discrepancy between classical approximation...
In this work we propose a system architecture for the integration of quantum accelerators. In order to evaluate our proposed system architecture we implemented various algorithms including a...
In this study we apply a Cross-Entropy method to shape this landscape, which allows the classical optimizer to find better parameter more easily and hence results in an improved performance. We...
This work presents a quantum-classic hybrid solution method for the CVRP. It clarifies whether the implementation of such a method pays off in comparison to existing classical solution methods...
This book comprises a section containing a keynote and four sections with scientific papers. The sessions deal with the following topics that are crucial to the development of future improvements in...
We show that the phase transition regarding the computational complexity of the problem, which is well-known to occur for 3SAT on classical machines (where it causes a detrimental increase in...
