activity
20182025
most citedReusability Report: Comparing gradient descent and monte carlo tree search optimization of quantum annealing schedules

5 citations · 5 across the 4 of their papers we have counts for

collaborators
Showing quant-phShow all

5 papers · 1 filter

quant-ph2025

Nonstabilizerness Estimation using Graph Neural Networks

Vincenzo Lipardi, Domenica Dibenedetto, Georgios Stamoulis +2

This article proposes a Graph Neural Network (GNN) approach to estimate nonstabilizerness in quantum circuits, measured by the stabilizer Rényi entropy (SRE). Nonstabilizerness is…

quant-ph2025

Quantum Checkers: The Development and Analysis of a Quantum Combinatorial Game

Marien Raat, Luuk van den Nouweland, Matthias Müller-Brockhausen +2

This paper develops and analyses a novel quantum combinatorial game: quantum checkers (codenamed Cheqqers). The concepts of superposition, entanglement, measurements and interferen…

quant-ph20241 cited

Optimising entanglement distribution policies under classical communication constraints assisted by reinforcement learning

Jan Li, Tim Coopmans, Patrick Emonts +3

Quantum repeaters play a crucial role in the effective distribution of entanglement over long distances. The nearest-future type of quantum repeater requires two operations: entang…

quant-ph20225 cited

Reusability Report: Comparing gradient descent and monte carlo tree search optimization of quantum annealing schedules

Matteo M. Wauters, Evert van Nieuwenburg

We provide a reusability report of the method presented by Chen et al. in "Optimizing quantum annealing schedules with Monte Carlo tree search enhanced with neural networks" and ad…

quant-ph2018

Reinforcement Learning Decoders for Fault-Tolerant Quantum Computation

Ryan Sweke, Markus S. Kesselring, Evert P. L. van Nieuwenburg +1

Topological error correcting codes, and particularly the surface code, currently provide the most feasible roadmap towards large-scale fault-tolerant quantum computation. As such,…