18 citations · 71 across the 11 of their papers we have counts for
12 papers
Design rules for fault-tolerant multi-gate teleportation
Mathys Rennela
Multi-gate teleportation (MGT) packages remote gates into a single ebit via a 1-ebit fan-out quantum circuit, saving entangled pairs relative to sequential gate telepor…
Quasilinear Equivalence Checking for Detector Error Models
Mathys Rennela
A Detector Error Model (DEM) is a structured representation of error mechanisms in quantum circuits, which has gained popularity in quantum compilation pipelines for its ability to…
Efficient Gate Reordering for Distributed Quantum Compiling in Data Centers
Riccardo Mengoni, Walter Nadalin, Mathys Rennela +5
Just as classical computing relies on distributed systems, the quantum computing era requires new kinds of infrastructure and software tools. Quantum networks will become the backb…
Low bit-flip rate probabilistic error cancellation
Mathys Rennela, Harold Ollivier
Noise remains one of the most significant challenges in the development of reliable and scalable quantum processors. While quantum error correction and mitigation techniques offer…
Join Inverse Rig Categories for Reversible Functional Programming, and Beyond
Robin Kaarsgaard, Mathys Rennela
Reversible computing is a computational paradigm in which computations are deterministic in both the forward and backward direction, so that programs have well-defined forward and…
Hybrid divide-and-conquer approach for tree search algorithms
Mathys Rennela, Sebastiaan Brand, Alfons Laarman +1
One of the challenges of quantum computers in the near- and mid- term is the limited number of qubits we can use for computations. Finding methods that achieve useful quantum impro…
Quantum Programming with Inductive Datatypes: Causality and Affine Type Theory
Romain Péchoux, Simon Perdrix, Mathys Rennela +1
Inductive datatypes in programming languages allow users to define useful data structures such as natural numbers, lists, trees, and others. In this paper we show how inductive dat…
Classical Control, Quantum Circuits and Linear Logic in Enriched Category Theory
Mathys Rennela, Sam Staton
We describe categorical models of a circuit-based (quantum) functional programming language. We show that enriched categories play a crucial role. Following earlier work on QWire b…
Infinite-Dimensionality in Quantum Foundations: W*-algebras as Presheaves over Matrix Algebras
Mathys Rennela, Sam Staton, Robert Furber
In this paper, W*-algebras are presented as canonical colimits of diagrams of matrix algebras and completely positive maps. In other words, matrix algebras are dense in W*-algebras…
Convexity and Order in Probabilistic Call-by-Name FPC
Mathys Rennela
Kegelspitzen are mathematical structures coined by Keimel and Plotkin, in order to encompass the structure of a convex set and the structure of a dcpo. In this paper, we ask oursel…
Operator Algebras in Quantum Computation
Mathys Rennela
In this master thesis, I discuss how the theory of operator algebras, also called operator theory, can be applied in quantum computer science.
Privacy in Quantum Communication Complexity
Iordanis Kerenidis, Mathieu Laurière, François Le Gall +1
In two-party quantum communication complexity, Alice and Bob receive some classical inputs and wish to compute some function that depends on both these inputs, while minimizing the…