Explore projects

Here we perform a hybrid, Grover based optimization to find the single network parameter change that leads to the largest reduction of the critical failure probability in a cascading network

A python package to formulate the Assembly Line Balancing Problem as Quadratic Unconstrained Binary Optimization Problem.

Demonstrator for Zero-Noise Extrapolation (ZNE) and Inverted-Circuit ZNE

A demonstrator for the Sequoia End-to-End project which shows how scenario-based route planning to safeguard automotive driving functions can be implemented to run on a quantum computer

This notebook illustrates using the Quantum Approximate Optimization Algorithm (QAOA) to find optimized configurations for feature models with attributed costs on a quantum computer.

Solving truck routing problem using Annealing on Dwave Advantage systems

In this demonstration, we present a Quantum Alternating Algorithm designed to address Mixed Integer Linear Problems (MILP). The algorithm's efficacy is showcased through the resolution of an energy use case, employing CPU and GPU quantum simulators, as well as the IBM Quantum System at Ehningen.

An alternative problem encoding for QAOA is used to accelerate cost function computation