12 citations · 32 across the 7 of their papers we have counts for
7 papers
Approximative lookup-tables and arbitrary function rotations for facilitating NISQ-implementations of the HHL and beyond
Petros Stougiannidis, Jonas Stein, David Bucher +3
Many promising applications of quantum computing with a provable speedup center around the HHL algorithm. Due to restrictions on the hardware and its significant demand on qubits a…
Evidence that PUBO outperforms QUBO when solving continuous optimization problems with the QAOA
Jonas Stein, Farbod Chamanian, Maximilian Zorn +4
Quantum computing provides powerful algorithmic tools that have been shown to outperform established classical solvers in specific optimization tasks. A core step in solving optimi…
Pattern QUBOs: Algorithmic construction of 3SAT-to-QUBO transformations
Sebastian Zielinski, Jonas Nüßlein, Jonas Stein +3
3SAT instances need to be transformed into instances of Quadratic Unconstrained Binary Optimization (QUBO) to be solved on a quantum annealer. Although it has been shown that the c…
Influence of Different 3SAT-to-QUBO Transformations on the Solution Quality of Quantum Annealing: A Benchmark Study
Sebastian Zielinski, Jonas Nüßlein, Jonas Stein +3
To solve 3SAT instances on quantum annealers they need to be transformed to an instance of Quadratic Unconstrained Binary Optimization (QUBO). When there are multiple transformatio…
Solving (Max) 3-SAT via Quadratic Unconstrained Binary Optimization
Jonas Nüßlein, Sebastian Zielinski, Thomas Gabor +2
We introduce a novel approach to translate arbitrary 3-SAT instances to Quadratic Unconstrained Binary Optimization (QUBO) as they are used by quantum annealing (QA) or the quantum…
Approximate Approximation on a Quantum Annealer
Irmi Sax, Sebastian Feld, Sebastian Zielinski +3
Many problems of industrial interest are NP-complete, and quickly exhaust resources of computational devices with increasing input sizes. Quantum annealers (QA) are physical device…
Assessing Solution Quality of 3SAT on a Quantum Annealing Platform
Thomas Gabor, Sebastian Zielinski, Sebastian Feld +6
When solving propositional logic satisfiability (specifically 3SAT) using quantum annealing, we analyze the effect the difficulty of different instances of the problem has on the q…