34 citations · 187 across the 34 of their papers we have counts for
4 papers · 2 filters
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…
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…