7 papers · 1 filter
IF-QAOA: A Penalty-Free Approach to Accelerating Constrained Quantum Optimization
David Bucher, Jonas Stein, Sebastian Feld +1
Traditional methods for handling (inequality) constraints in the Quantum Approximate Optimization Ansatz (QAOA) typically rely on penalty terms and slack variables, which increase…
Reducing QUBO Density by Factoring Out Semi-Symmetries
Jonas NüÃlein, Leo Sünkel, Jonas Stein +6
Quantum Approximate Optimization Algorithm (QAOA) and Quantum Annealing are prominent approaches for solving combinatorial optimization problems, such as those formulated as Quadra…
Reducing QAOA Circuit Depth by Factoring out Semi-Symmetries
Jonas NüÃlein, Leo Sünkel, Jonas Stein +4
QAOA is a quantum algorithm for solving combinatorial optimization problems. It is capable of searching for the minimizing solution vector of a QUBO problem . The number…
Solving Max-3SAT Using QUBO Approximation
Sebastian Zielinski, Jonas NüÃlein, Michael Kölle +3
As contemporary quantum computers do not possess error correction, any calculation performed by these devices can be considered an involuntary approximation. To solve a problem on…
Challenges for Reinforcement Learning in Quantum Circuit Design
Philipp Altmann, Jonas Stein, Michael Kölle +5
Quantum computing (QC) in the current NISQ era is still limited in size and precision. Hybrid applications mitigating those shortcomings are prevalent to gain early insight and adv…
Using an Evolutionary Algorithm to Create (MAX)-3SAT QUBOs
Sebastian Zielinski, Maximilian Zorn, Thomas Gabor +2
A common way of solving satisfiability instances with quantum methods is to transform these instances into instances of QUBO, which in itself is a potentially difficult and expensi…