6 papers · 1 filter
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…