2 citations · 3 across the 15 of their papers we have counts for
17 papers
When Can Quantum Extreme Learning Machines Replace Quantum Reservoirs?
Markus Baumann, Gerhard Stenzel, Jonas Stein +1
Quantum reservoir computers (QRCs) retain information from earlier inputs, whereas reset-window quantum extreme learning machines (QELMs) start afresh and receive only a recent inp…
Emergent Problem-Graph Alignment in RL-Discovered Entanglement Topologies for QAOA
Tobias Rohe, Federico Harjes Ruiloba, Markus Baumann +4
In the Quantum Approximate Optimization Algorithm (QAOA), the entanglement topology, where qubit pairs are connected by two-qubit gates, is conventionally set equal to the edge set…
Detrimental Agnostic Entanglement: The Case Against Hardware-Efficient Ansätze for Combinatorial Optimization
Tobias Rohe, Markus Baumann, Federico Harjes Ruiloba +3
Variational quantum algorithms (VQAs) for combinatorial optimization routinely employ entangling gates as a default design choice, yet the role of entanglement, in its amount and s…
Illustration of Barren Plateaus in Quantum Computing
Gerhard Stenzel, Tobias Rohe, Michael Kölle +3
Variational Quantum Circuits (VQCs) have emerged as a promising paradigm for quantum machine learning in the NISQ era. While parameter sharing in VQCs can reduce the parameter spac…
Reinforcement Learning for Parameterized Quantum State Preparation: A Comparative Study
Gerhard Stenzel, Isabella Debelic, Michael Kölle +4
We extend directed quantum circuit synthesis (DQCS) with reinforcement learning from purely discrete gate selection to parameterized quantum state preparation with continuous singl…
Emergent Cooperation in Quantum Multi-Agent Reinforcement Learning Using Communication
Michael Kölle, Christian Reff, Leo Sünkel +3
Emergent cooperation in classical Multi-Agent Reinforcement Learning has gained significant attention, particularly in the context of Sequential Social Dilemmas (SSDs). While class…
Quantum King-Ring Domination in Chess: A QAOA Approach
Gerhard Stenzel, Michael Kölle, Tobias Rohe +4
The Quantum Approximate Optimization Algorithm (QAOA) is extensively benchmarked on synthetic random instances such as MaxCut, TSP, and SAT problems, but these lack semantic struct…
Topology-Guided Quantum GANs for Constrained Graph Generation
Tobias Rohe, Markus Baumann, Michael Poppel +3
Quantum computing (QC) promises theoretical advantages, benefiting computational problems that would not be efficiently classically simulatable. However, much of this theoretical s…
Evolutionary-Based Circuit Optimization for Distributed Quantum Computing
Leo Sünkel, Jonas Stein, Gerhard Stenzel +3
In this work, we evaluate an evolutionary algorithm (EA) to optimize a given circuit in such a way that it reduces the required communication when executed in the Distributed Quant…
Solving graph problems using permutation-invariant quantum machine learning
Maximilian Balthasar Mansky, Tobias Rohe, Gerhard Stenzel +7
Many computational problems are unchanged under some symmetry operation. In classical machine learning, this can be reflected with the layer structure of the neural network. In qua…
Quantum Circuit Construction and Optimization through Hybrid Evolutionary Algorithms
Leo Sünkel, Philipp Altmann, Michael Kölle +3
We apply a hybrid evolutionary algorithm to minimize the depth of circuits in quantum computing. More specifically, we evaluate two different variants of the algorithm. In the firs…
Evaluating Mutation Techniques in Genetic Algorithm-Based Quantum Circuit Synthesis
Michael Kölle, Tom Bintener, Maximilian Zorn +4
Quantum computing leverages the unique properties of qubits and quantum parallelism to solve problems intractable for classical systems, offering unparalleled computational potenti…
PIMAEX: Multi-Agent Exploration through Peer Incentivization
Michael Kölle, Johannes Tochtermann, Julian Schönberger +3
While exploration in single-agent reinforcement learning has been studied extensively in recent years, considerably less work has focused on its counterpart in multi-agent reinforc…
Optimizing Sensor Redundancy in Sequential Decision-Making Problems
Jonas Nüßlein, Maximilian Zorn, Fabian Ritz +5
Reinforcement Learning (RL) policies are designed to predict actions based on current observations to maximize cumulative future rewards. In real-world applications (i.e., non-simu…
A Study on Optimization Techniques for Variational Quantum Circuits in Reinforcement Learning
Michael Kölle, Timo Witter, Tobias Rohe +3
Quantum Computing aims to streamline machine learning, making it more effective with fewer trainable parameters. This reduction of parameters can speed up the learning process and…
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…
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…