papers

Publications (25)

quant-ph2024

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-ph2023

Fast equivalence checking of quantum circuits of Clifford gates

Dimitrios Thanos, Tim Coopmans, Alfons Laarman

Checking whether two quantum circuits are equivalent is important for the design and optimization of quantum-computer applications with real-world devices. We consider quantum circ…

quant-ph2024

Advancing Quantum Computing with Formal Methods

Arend-Jan Quist, Jingyi Mei, Tim Coopmans +1

This tutorial introduces quantum computing with a focus on the applicability of formal methods in this relatively new domain. We describe quantum circuits and convey an understandi…

quant-ph2026

Sector length distributions of recursively definable graph states through analytic combinatorics

Eloïc Vallée, Kenneth Goodenough, Paul E. Gunnells +2

The sector length distribution or Shor-Laflamme distribution (SLD) of quantum states is governed by the -body correlations amongst the different systems, and has been used to st…

quant-ph2019

A Link Layer Protocol for Quantum Networks

Axel Dahlberg, Matthew Skrzypczyk, Tim Coopmans +9

Quantum communication brings radically new capabilities that are provably impossible to attain in any classical network. Here, we take the first step from a physics experiment to a…

quant-ph2026

Faster algorithm for achieving minimal-size quantum decision diagrams

Juul Sanders, Sebastiaan Brand, Arend-Jan Quist +1

The decision diagram (DD) data structure enables fast linear-algebra calculations by bringing vectors into a normal form and subsequently merging equivalent ones, yielding a minima…

quant-ph2024

A Knowledge Compilation Map for Quantum Information

Lieuwe Vinkhuijzen, Tim Coopmans, Alfons Laarman

Quantum computing is finding promising applications in optimization, machine learning and physics, leading to the development of various models for representing quantum information…

quant-ph2024

Equivalence Checking of Quantum Circuits by Model Counting

Jingyi Mei, Tim Coopmans, Marcello Bonsangue +1

Verifying equivalence between two quantum circuits is a hard problem, that is nonetheless crucial in compiling and optimizing quantum algorithms for real-world devices. This paper…

quant-ph2026

Exact quantum decision diagrams with scaling guarantees for Clifford+ circuits and beyond

Arend-Jan Quist, Tim Coopmans, Alfons Laarman

A decision diagram (DD) is a graph-like data structure for homomorphic compression of Boolean and pseudo-Boolean functions. Over the past decades, decision diagrams have been succe…

quant-ph2023

LIMDD: A Decision Diagram for Simulation of Quantum Computing Including Stabilizer States

Lieuwe Vinkhuijzen, Tim Coopmans, David Elkouss +2

Efficient methods for the representation and simulation of quantum states and quantum operations are crucial for the optimization of quantum circuits. Decision diagrams (DDs), a we…

quant-ph2024

Aging and Reliability of Quantum Networks

Lisa T. Weinbrenner, Lina Vandré, Tim Coopmans +1

Quantum information science may lead to technological breakthroughs in computing, cryptography and sensing. For the implementation of these tasks, however, complex devices with man…

quant-ph2025

Quantum Data Management in the NISQ Era: Extended Version

Rihan Hai, Shih-Han Hung, Tim Coopmans +2

Quantum computing has emerged as a promising tool for transforming the landscape of computing technology. Recent efforts have applied quantum techniques to classical database chall…

quant-ph2019

Efficient computation of the waiting time and fidelity in quantum repeater chains

Sebastiaan Brand, Tim Coopmans, David Elkouss

Quantum communication enables a host of applications that cannot be achieved by classical communication means, with provably secure communication as one of the prime examples. The…

quant-ph2021

NetSquid, a NETwork Simulator for QUantum Information using Discrete events

Tim Coopmans, Robert Knegjens, Axel Dahlberg +13

In order to bring quantum networks into the real world, we would like to determine the requirements of quantum network protocols including the underlying quantum hardware. Because…

quant-ph2020

Optimizing Entanglement Generation and Distribution Using Genetic Algorithms

Francisco Ferreira da Silva, Ariana Torres-Knoop, Tim Coopmans +2

Long-distance quantum communication via entanglement distribution is of great importance for the quantum internet. However, scaling up to such long distances has proved challenging…

quant-ph2021

Tools for quantum network design

Koji Azuma, Stefan Bäuml, Tim Coopmans +2

Quantum networks will enable the implementation of communication tasks with qualitative advantages with respect to the communication networks we know today. While it is expected th…

quant-ph2023

Requirements for a processing-node quantum repeater on a real-world fiber grid

Guus Avis, Francisco Ferreira da Silva, Tim Coopmans +6

We numerically study the distribution of entanglement between the Dutch cities of Delft and Eindhoven realized with a processing-node quantum repeater and determine minimal hardwar…

quant-ph2022

Improved analytical bounds on delivery times of long-distance entanglement

Tim Coopmans, Sebastiaan Brand, David Elkouss

The ability to distribute high-quality entanglement between remote parties is a necessary primitive for many quantum communication applications. A large range of schemes for realiz…

quant-ph2020

Robust self-testing of two-qubit states

Tim Coopmans, Jędrzej Kaniewski, Christian Schaffner

It is well-known that observing nonlocal correlations allows us to draw conclusions about the quantum systems under consideration. In some cases this yields a characterisation whic…

quant-ph2024

Quantum Graph-State Synthesis with SAT

Sebastiaan Brand, Tim Coopmans, Alfons Laarman

In quantum computing and quantum information processing, graph states are a specific type of quantum states which are commonly used in quantum networking and quantum error correcti…

quant-ph2021

Efficient optimization of cut-offs in quantum repeater chains

Boxi Li, Tim Coopmans, David Elkouss

Quantum communication enables the implementation of tasks that are unachievable with classical resources. However, losses on the communication channel preclude the direct long-dist…

quant-ph2025

On noise in swap ASAP repeater chains: exact analytics, distributions and tight approximations

Kenneth Goodenough, Tim Coopmans, Don Towsley

Losses are one of the main bottlenecks for the distribution of entanglement in quantum networks, which can be overcome by the implementation of quantum repeaters. The most basic fo…

quant-ph2026

Quokka#: Quantum Computing with #SAT

Jingyi Mei, Dekel Zak, Muhammad Osama +2

We present Quokka#, a versatile, open-source Python library for quantum circuit analysis. Quokka# reduces various simulation, verification, and synthesis tasks to weighted model co…

quant-ph2025

Merging-Based Quantum Repeater

Maria Flors Mor-Ruiz, Jorge Miguel-Ramiro, Julius Wallnöfer +2

We introduce an alternative approach for the design of quantum repeaters based on generating entangled states of growing size. The scheme utilizes quantum merging operations, also…

quant-ph2023

Connecting Quantum Cities: Simulation of a Satellite-Based Quantum Network

Raja Yehia, Matteo Schiavon, Valentina Marulanda Acosta +4

We present and analyse an architecture for a European-scale quantum network using satellite links to connect Quantum Cities, which are metropolitan quantum networks with minimal ha…