18 citations · 55 across the 25 of their papers we have counts for
19 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…
Profiling quantum circuits for their efficient execution on single- and multi-core architectures
Medina Bandic, Pablo le Henaff, Anabel Ovide +8
Application-specific quantum computers offer the most efficient means to tackle problems intractable by classical computers. Realizing these architectures necessitates a deep under…
YAQQ: Yet Another Quantum Quantizer -- Design Space Exploration of Quantum Gate Sets using Novelty Search
Aritra Sarkar, Akash Kundu, Matthew Steinberg +5
In the standard circuit model of quantum computation, the number and quality of the quantum gates composing the circuit influence the runtime and fidelity of the computation. The f…