3 citations · 4 across the 17 of their papers we have counts for
13 papers · 1 filter
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…
Exploiting Symmetry in Quantum Reservoir Computing
Markus Baumann, Michael Poppel, Thomas Gabor +3
Quantum reservoir computing (QRC) uses a quantum processor without training it. The input is encoded into a quantum state, a fixed random circuit evolves it, selected observables a…
From Quantum Shots to Training Data: Reorganizing Measurement Records in Quantum Machine Learning
Markus Baumann, Maximilian Zorn, Thomas Gabor +2
Between keeping every shot as a noisy training example and averaging all shots into one clean feature lies an entire spectrum of data organizations that quantum machine learning us…
Quantum Optimization Algorithms
Jonas Stein, Maximilian Zorn, Leo Sünkel +1
Quantum optimization allows for up to exponential quantum speedups for specific, possibly industrially relevant problems. As the key algorithm in this field, we motivate and discus…
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…
Time-Aware Qubit Assignment and Circuit Optimization for Distributed Quantum Computing
Leo Sünkel, Jonas Stein, Maximilian Zorn +2
The emerging paradigm of distributed quantum computing promises a potential solution to scaling quantum computing to currently unfeasible dimensions. While this approach itself is…
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…
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…
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…
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…
Applying an Evolutionary Algorithm to Minimize Teleportation Costs in Distributed Quantum Computing
Leo Sünkel, Manik Dawar, Thomas Gabor
By connecting multiple quantum computers (QCs) through classical and quantum channels, a quantum communication network can be formed. This gives rise to new applications such as bl…