6 papers
Speed-oriented quantum circuit backend
Sören Wilkening
We present a new software package for efficient quantum circuit generation, designed to achieve optimal runtime performance. Despite being in an early stage of development, our imp…
Constraint-oriented biased quantum search for general constrained combinatorial optimization problems
Sören Wilkening
We present a quantum algorithmic routine that extends the realm of Grover-based heuristics for tackling combinatorial optimization problems with arbitrary efficiently computable ob…
Constraint-oriented biased quantum search for linear constrained combinatorial optimization problems
Sören Wilkening, Timo Ziegler, Maximilian Hess
In this paper, we extend a previously presented Grover-based heuristic to tackle general combinatorial optimization problems with linear constraints. We further describe the introd…
A quantum search method for quadratic and multidimensional knapsack problems
Sören Wilkening, Andreea-Iulia Lefterovici, Lennart Binkowski +5
Solving combinatorial optimization problems is a promising application area for quantum algorithms in real-world scenarios. In this work, we extend the "Quantum Tree Generator" (QT…
Quantum tree generator improves QAOA state-of-the-art for the knapsack problem
Paul Christiansen, Lennart Binkowski, Debora Ramacciotti +1
This paper introduces a novel approach to the Quantum Approximate Optimization Algorithm (QAOA), specifically tailored to the knapsack problem. We combine the recently proposed qua…
Runtime-coherence trade-offs for hybrid SAT-solvers
Vahideh Eshaghian, Sören Wilkening, Johan Åberg +1
Many search-based quantum algorithms that achieve a theoretical speedup are not practically relevant since they require extraordinarily long coherence times, or lack the paralleliz…