most citedSampling Problems on a Quantum Computer

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

collaborators

7 papers

quant-ph2024★ 1 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

From Problem to Solution: A general Pipeline to Solve Optimisation Problems on Quantum Hardware

Tobias Rohe, Simon Grätz, Michael Kölle +3

With constant improvements of quantum hardware and quantum algorithms, quantum advantage comes within reach. Parallel to the development of the computer at the end of the twentieth…

quant-ph2024

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…

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-ph2024★ 3 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-ph2024★ 2 cited

Quantum Denoising Diffusion Models

Michael Kölle, Gerhard Stenzel, Jonas Stein +3

In recent years, machine learning models like DALL-E, Craiyon, and Stable Diffusion have gained significant attention for their ability to generate high-resolution images from conc…

quant-ph2023★ 1 cited

Transformation-Dependent Performance-Enhancement of Digital Annealer for 3-SAT

Christian Münch, Fritz Schinkel, Sebastian Zielinski +1

Quadratic Unconstrained Binary Optimization (QUBO) problems are NP-hard problems and many real-world problems can be formulated as QUBO. Currently there are no algorithms known tha…