• Home
  • Aktuelles
  • Technologie
  • Forschung
  • Lehre
  • Wirtschaft
  • Jobs
  • Home
  • Aktuelles
  • Technologie
  • Forschung
  • Lehre
  • Wirtschaft
  • Jobs
Kontakt
  • de
  • en

  • Home
  • Aktuelles
  • Technologie
  • Forschung
  • Lehre
  • Wirtschaft
  • Jobs
Kontakt
  • de
  • en

Unsere Forschungsschwerpunkte

Die Forschungsschwerpunkte des QAR-Labs sind Quantum Optimization und Quantum Artificial Intelligence. Ferner arbeiten wir aktuell an einer Software Plattform, deren Kernstück die Middleware UQO für einen einheitlichen und einfachen Zugriff auf Quantenhardware darstellt.

Unsere Forschungsergebnisse

Alle Quantum Optimization Quantum Artificial Intelligence Quantum Software Platform
The UQ Platform: A Unified Approach To Quantum Annealing

The UQ platform provides a unified interface to various means of solving QUBO that allows for a seamless switch between classical and quantum methods while implementing features such as load and user...

Weiterlesen

A Quantum Annealing Algorithm for Finding Pure Nash Equilibria in Graphical Games

We empirically evaluate Q-Nash on D-Wave’s Quantum Annealer 2000Q using different graphical game topologies. The results with respect to solution quality and computing time are compared to a Brute...

Weiterlesen

Approximating Archetypal Analysis Using Quantum Annealing

In this work, archetypal analysis is linked with quantum annealing. For both steps, i.e. the determination of archetypes and the assignment of data points, we derive a QUBO formulation which is...

Weiterlesen

A Flexible Pipeline for the Optimization of Construction Trees

In this paper, we present a systematic comparison of newly developed and existing tree optimization methods and propose a flexible processing pipeline with a focus on tree editability. The pipeline...

Weiterlesen

The Dynamic Time Warping Distance Measure as QUBO Formulation

With this paper we investigate whether it is possible to transfer the DTW distance measure into a QUBO formulation. The motivation behind is the hope on an accelerated execution once the QA hardware...

Weiterlesen

Insights on Training Neural Networks for QUBO Tasks

Analyzing this representation via autoencoders shows that there is way more information included than necessary to solve the original TSP. Then we show that neural networks can be used to solve TSP...

Weiterlesen

The Holy Grail of Quantum Artificial Intelligence: Challenges in Accelerating the Machine Learning Pipeline

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...

Weiterlesen

Approximate Approximation on a Quantum Annealer

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...

Weiterlesen

Optimizing Geometry Compression using Quantum Annealing

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....

Weiterlesen

Torwards understanding Approximation Complexity on a Quantum Annealer (Extended Abstract)

We experimentally investigate if and how the degree of approximability influences implementation and run-time performance. Our experiments indicate a discrepancy between classical approximation...

Weiterlesen

Integration and Evaluation of Quantum Accelerators for Data-Driven User Functions

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...

Weiterlesen

Cross Entropy Hyperparameter Optimization for Constrained Problem Hamiltonians Applied to QAOA

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...

Weiterlesen

A Hybrid Solution Method for the Capacitated Vehicle Routing Problem Using a Quantum Annealer

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...

Weiterlesen

Quantum Technology and Optimization Problems: First International Workshop

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...

Weiterlesen

Assessing Solution Quality of 3SAT on a Quantum Annealing Platform

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...

Weiterlesen


A Quantum Annealing Algorithm for Finding Pure Nash Equilibria in Graphical Games

We empirically evaluate Q-Nash on D-Wave’s Quantum Annealer 2000Q using different graphical game topologies. The results with respect to solution quality and computing time are compared to a Brute...

Weiterlesen

Approximating Archetypal Analysis Using Quantum Annealing

In this work, archetypal analysis is linked with quantum annealing. For both steps, i.e. the determination of archetypes and the assignment of data points, we derive a QUBO formulation which is...

Weiterlesen

A Flexible Pipeline for the Optimization of Construction Trees

In this paper, we present a systematic comparison of newly developed and existing tree optimization methods and propose a flexible processing pipeline with a focus on tree editability. The pipeline...

Weiterlesen

The Dynamic Time Warping Distance Measure as QUBO Formulation

With this paper we investigate whether it is possible to transfer the DTW distance measure into a QUBO formulation. The motivation behind is the hope on an accelerated execution once the QA hardware...

Weiterlesen

Approximate Approximation on a Quantum Annealer

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...

Weiterlesen

Optimizing Geometry Compression using Quantum Annealing

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....

Weiterlesen

Torwards understanding Approximation Complexity on a Quantum Annealer (Extended Abstract)

We experimentally investigate if and how the degree of approximability influences implementation and run-time performance. Our experiments indicate a discrepancy between classical approximation...

Weiterlesen

Cross Entropy Hyperparameter Optimization for Constrained Problem Hamiltonians Applied to QAOA

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...

Weiterlesen

A Hybrid Solution Method for the Capacitated Vehicle Routing Problem Using a Quantum Annealer

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...

Weiterlesen

Quantum Technology and Optimization Problems: First International Workshop

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...

Weiterlesen

Assessing Solution Quality of 3SAT on a Quantum Annealing Platform

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...

Weiterlesen


Insights on Training Neural Networks for QUBO Tasks

Analyzing this representation via autoencoders shows that there is way more information included than necessary to solve the original TSP. Then we show that neural networks can be used to solve TSP...

Weiterlesen

The Holy Grail of Quantum Artificial Intelligence: Challenges in Accelerating the Machine Learning Pipeline

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...

Weiterlesen

Integration and Evaluation of Quantum Accelerators for Data-Driven User Functions

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...

Weiterlesen

Quantum Technology and Optimization Problems: First International Workshop

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...

Weiterlesen


The UQ Platform: A Unified Approach To Quantum Annealing

The UQ platform provides a unified interface to various means of solving QUBO that allows for a seamless switch between classical and quantum methods while implementing features such as load and user...

Weiterlesen


QAR-Lab – Quantum Applications and Research Laboratory
Ludwig-Maximilians-Universität München
Oettingenstr. 67
80538 München
Telefon: +49 89 2180-9153
E-Mail: qar-lab@mobile.ifi.lmu.de

© Copyright 2021

Allgemein

Team
Kontakt
Impressum

Social Media

Twitter
Linkedin
Github

Sprache

  • de
  • en