most citedSampling Problems on a Quantum Computer

3 citations · 5 across the 5 of their papers we have counts for

collaborators
Showing quant-phShow all

5 papers · 1 filter

quant-ph20241 cited

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…

quant-ph2024

Qandle: Accelerating State Vector Simulation Using Gate-Matrix Caching and Circuit Splitting

Gerhard Stenzel, Sebastian Zielinski, Michael Kölle +3

To address the computational complexity associated with state-vector simulation for quantum circuits, we propose a combination of advanced techniques to accelerate circuit executio…

quant-ph20241 cited

Quantum Optimization for the Future Energy Grid: Summary and Quantum Utility Prospects

Jonas Blenninger, David Bucher, Giorgio Cortiana +6

In this project summary paper, we summarize the key results and use-cases explored in the German Federal Ministry of Education and Research (BMBF) funded project "Q-GRID" which aim…

quant-ph20243 cited

Sampling Problems on a Quantum Computer

Maximilian Balthasar Mansky, Jonas Nüßlein, David Bucher +3

Due to the advances in the manufacturing of quantum hardware in the recent years, significant research efforts have been directed towards employing quantum methods to solving probl…

quant-ph20231 cited

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…