1 citations · 2 across the 6 of their papers we have counts for
6 papers · 1 filter
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…
Optimizing Variational Quantum Circuits Using Metaheuristic Strategies in Reinforcement Learning
Michael Kölle, Daniel Seidl, Maximilian Zorn +3
Quantum Reinforcement Learning (QRL) offers potential advantages over classical Reinforcement Learning, such as compact state space representation and faster convergence in certain…
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…
Towards Federated Learning on the Quantum Internet
Leo Sünkel, Michael Kölle, Tobias Rohe +1
While the majority of focus in quantum computing has so far been on monolithic quantum systems, quantum communication networks and the quantum internet in particular are increasing…
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…
Towards Turing-Complete Quantum Computing Coming From Classical Assembler
Thomas Gabor, Marian Lingsch Rosenfeld, Claudia Linnhoff-Popien
Instead of producing quantum languages that are fit for current quantum computers, we build a language from standard classical assembler and augment it with quantum capabilities so…