151 citations · 431 across the 17 of their papers we have counts for
19 papers
SpiderCSS: Scalable Fault-Tolerant CSS State Preparation
Boldizsár Poór, Andrey Boris Khesin, Sarah Meng Li +3
Fault-tolerant preparation of logical states is a critical primitive for the realization of large-scale fault-tolerant quantum computing. This paper introduces SpiderCSS, a scalabl…
A Complete and Natural Rule Set for Multi-Qudit Clifford Circuits in All Odd Prime Dimensions
Xiaoning Bian, Sarah Meng Li, Neil J. Ross +2
We present a complete set of rewrite rules for multi-qudit Clifford circuits in all odd prime dimensions. Completeness means that any two Clifford circuits representing the sa…
ZX-Flow: A Flexible Criterion for Deterministic Computation with ZX-Diagrams
Aleks Kissinger, John van de Wetering
Flow criteria are used to efficiently extract computations, either in the form of measurement patterns or quantum circuits, from ZX-diagrams. Existing criteria such as causal flow,…
SpiderCat: Optimal Fault-Tolerant Cat State Preparation
Andrey Boris Khesin, Sarah Meng Li, Boldizsár Poór +3
The ability to fault-tolerantly prepare CAT states, also known as multi-qubit GHZ states, is an important primitive for quantum error correction. It is required for Shor-style synd…
A Complete and Natural Rule Set for Multi-Qutrit Clifford Circuits
Sarah Meng Li, Michele Mosca, Neil J. Ross +2
We present a complete set of rewrite rules for n-qutrit Clifford circuits where n is any non-negative integer. This is the first completeness result for any fragment of quantum cir…
Quantum Circuit Optimization with AlphaTensor
Francisco J. R. Ruiz, Tuomas Laakkonen, Johannes Bausch +10
A key challenge in realizing fault-tolerant quantum computers is circuit optimization. Focusing on the most expensive gates in fault-tolerant quantum computation (namely, the T gat…
The Qupit Stabiliser ZX-travaganza: Simplified Axioms, Normal Forms and Graph-Theoretic Simplification
Boldizsár Poór, Robert I. Booth, Titouan Carette +2
We present a smorgasbord of results on the stabiliser ZX-calculus for odd prime-dimensional qudits (i.e. qupits). We derive a simplified rule set that closely resembles the origina…
Quantum Theory from Principles, Quantum Software from Diagrams
John van de Wetering
This thesis consists of two parts. The first part is about how quantum theory can be recovered from first principles, while the second part is about the application of diagrammatic…
ZX-calculus for the working quantum computer scientist
John van de Wetering
The ZX-calculus is a graphical language for reasoning about quantum computation that has recently seen an increased usage in a variety of areas such as quantum circuit optimisation…
The three types of normal sequential effect algebras
Abraham Westerbaan, Bas Westerbaan, John van de Wetering
A sequential effect algebra (SEA) is an effect algebra equipped with a sequential product operation modeled after the Lüders product on C*-algebras…
There and back again: A circuit extraction tale
Miriam Backens, Hector Miller-Bakewell, Giovanni de Felice +2
Translations between the quantum circuit model and the measurement-based one-way model are useful for verification and optimisation of quantum computations. They make crucial use o…
A characterisation of ordered abstract probabilities
Abraham Westerbaan, Bas Westerbaan, John van de Wetering
In computer science, especially when dealing with quantum computing or other non-standard models of computation, basic notions in probability theory like "a predicate" vary wildly.…
Commutativity in Jordan Operator Algebras
John van de Wetering
While Jordan algebras are commutative, their non-associativity makes it so that the Jordan product operators do not necessarily commute. When the product operators of two elements…
Graphical Fourier Theory and the Cost of Quantum Addition
Stach Kuijpers, John van de Wetering, Aleks Kissinger
The ZX-calculus is a convenient formalism for expressing and reasoning about quantum circuits at a low level, whereas the recently-proposed ZH-calculus yields convenient expression…
Completeness of the Phase-free ZH-calculus
John van de Wetering, Sal Wolffs
The ZH-calculus is a graphical calculus for linear maps between qubits that allows a natural representation of the Toffoli+Hadamard gate set. The original version of the calculus,…
PyZX: Large Scale Automated Diagrammatic Reasoning
Aleks Kissinger, John van de Wetering
The ZX-calculus is a graphical language for reasoning about ZX-diagrams, a type of tensor networks that can represent arbitrary linear maps between qubits. Using the ZX-calculus, w…
Reducing T-count with the ZX-calculus
Aleks Kissinger, John van de Wetering
Reducing the number of non-Clifford quantum gates present in a circuit is an important task for efficiently implementing quantum computations, especially in the fault-tolerant regi…
An algebraic semi-automated proof of the fundamental identity of Jordan algebras
John van de Wetering
The fundamental identity of quadratic Jordan algebras is commonly proven as a consequence of MacDonalds theorem or using more analytic methods. In this shor…
Pure Maps between Euclidean Jordan Algebras
Abraham Westerbaan, Bas Westerbaan, John van de Wetering
We propose a definition of purity for positive linear maps between Euclidean Jordan Algebras (EJA) that generalizes the notion of purity for quantum systems. We show that this defi…