49 citations · 241 across the 28 of their papers we have counts for
28 papers
Exact Synthesis of Multiqutrit Clifford-Cyclotomic Circuits
Andrew N. Glaudell, Neil J. Ross, John van de Wetering +1
It is known that the matrices that can be exactly represented by a multiqubit circuit over the Toffoli+Hadamard, Clifford+, or, more generally, Clifford-cyclotomic gate set are…
Catalysing Completeness and Universality
Aleks Kissinger, Neil J. Ross, John van de Wetering
A catalysis state is a quantum state that is used to make some desired operation possible or more efficient, while not being consumed in the process. Recent years have seen catalys…
Scalable Spider Nests (...Or How to Graphically Grok Transversal Non-Clifford Gates)
Aleks Kissinger, John van de Wetering
This is the second in a series of "graphical grokking" papers in which we study how stabiliser codes can be understood using the ZX-calculus. In this paper we show that certain com…
Optimal compilation of parametrised quantum circuits
John van de Wetering, Richie Yeung, Tuomas Laakkonen +1
Parametrised quantum circuits contain phase gates whose phase is determined by a classical algorithm prior to running the circuit on a quantum device. Such circuits are used in var…
Optimising quantum circuits is generally hard
John van de Wetering, Matt Amy
In order for quantum computations to be done as efficiently as possible it is important to optimise the number of gates used in the underlying quantum circuits. In this paper we fi…
The Qudit ZH-Calculus: Generalised Toffoli+Hadamard and Universality
Patrick Roy, John van de Wetering, Lia Yeh
We introduce the qudit ZH-calculus and show how to generalise all the phase-free qubit rules to qudits. We prove that for prime dimensions d, the phase-free qudit ZH-calculus is un…
Self-duality and Jordan structure of quantum theory follow from homogeneity and pure transitivity
Howard Barnum, Cozmin Ududec, John van de Wetering
Quantum theory satisfies the mathematically powerful property of self-duality, meaning that its state and effect spaces are made isomorphic by an inner product. This is why both qu…
Picturing Counting Reductions with the ZH-Calculus
Tuomas Laakkonen, Konstantinos Meichanetzidis, John van de Wetering
Counting the solutions to Boolean formulae defines the problem #SAT, which is complete for the complexity class #P. We use the ZH-calculus, a universal and complete graphical langu…
Classically Simulating Quantum Supremacy IQP Circuits through a Random Graph Approach
Julien Codsi, John van de Wetering
Quantum Supremacy is a demonstration of a computation by a quantum computer that can not be performed by the best classical computer in a reasonable time. A well-studied approach t…
A Graphical #SAT Algorithm for Formulae with Small Clause Density
Tuomas Laakkonen, Konstantinos Meichanetzidis, John van de Wetering
We study the counting version of the Boolean satisfiability problem #SAT using the ZH-calculus, a graphical language originally introduced to reason about quantum circuits. Using t…
Building Qutrit Diagonal Gates from Phase Gadgets
John van de Wetering, Lia Yeh
Phase gadgets have proved to be an indispensable tool for reasoning about ZX-diagrams, being used in optimisation and simulation of quantum circuits and the theory of measurement-b…
Constructing all qutrit controlled Clifford+T gates in Clifford+T
Lia Yeh, John van de Wetering
For a number of useful quantum circuits, qudit constructions have been found which reduce resource requirements compared to the best known or best possible qubit construction. Howe…
Qutrit metaplectic gates are a subset of Clifford+T
Andrew Glaudell, Neil J. Ross, John van de Wetering +1
A popular universal gate set for quantum computing with qubits is Clifford+T, as this can be readily implemented on many fault-tolerant architectures. For qutrits, there is an equi…
Classical simulation of quantum circuits with partial and graphical stabiliser decompositions
Aleks Kissinger, John van de Wetering, Renaud Vilmart
Recent developments in classical simulation of quantum circuits make use of clever decompositions of chunks of magic states into sums of efficiently simulable stabiliser states. We…
Circuit Extraction for ZX-diagrams can be #P-hard
Niel de Beaudrap, Aleks Kissinger, John van de Wetering
The ZX-calculus is a graphical language for reasoning about quantum computation using ZX-diagrams, a certain flexible generalisation of quantum circuits that can be used to represe…
Spin-networks in the ZX-calculus
Richard D. P. East, Pierre Martin-Dussaud, John Van de Wetering
The ZX-calculus, and the variant we consider in this paper (ZXH-calculus), are formal diagrammatic languages for qubit quantum computing. We show that it can also be used to descri…
A computer scientist's reconstruction of quantum theory
Bas Westerbaan, John van de Wetering
The rather unintuitive nature of quantum theory has led numerous people to develop sets of (physically motivated) principles that can be used to derive quantum mechanics from the g…
Simulating quantum circuits with ZX-calculus reduced stabiliser decompositions
Aleks Kissinger, John van de Wetering
We introduce an enhanced technique for strong classical simulation of quantum circuits which combines the `sum-of-stabilisers' method with an automated simplification strategy base…
A Categorical Construction of the Real Unit Interval
John van de Wetering
The real unit interval is the fundamental building block for many branches of mathematics like probability theory, measure theory, convex sets and homotopy theory. However, a prior…
Completeness of the ZH-calculus
Miriam Backens, Aleks Kissinger, Hector Miller-Bakewell +2
There are various gate sets used for describing quantum computation. A particularly popular one consists of Clifford gates and arbitrary single-qubit phase gates. Computations in t…
Constructing quantum circuits with global gates
John van de Wetering
There are various gate sets that can be used to describe a quantum computation. A particularly popular gate set in the literature on quantum computing consists of arbitrary single-…
AKLT-states as ZX-diagrams: diagrammatic reasoning for quantum states
Richard D. P. East, John van de Wetering, Nicholas Chancellor +1
From Feynman diagrams to tensor networks, diagrammatic representations of computations in quantum mechanics have catalysed progress in physics. These diagrams represent the underly…
Hypergraph Simplification: Linking the Path-sum Approach to the ZH-calculus
Louis Lemonnier, John van de Wetering, Aleks Kissinger
The ZH-calculus is a complete graphical calculus for linear maps between qubits that admits a straightforward encoding of hypergraph states and circuits arising from the Toffoli+Ha…
Dichotomy between Deterministic and Probabilistic Models in Countably Additive Effectus Theory
Kenta Cho, Bas Westerbaan, John van de Wetering
Effectus theory is a relatively new approach to categorical logic that can be seen as an abstract form of generalized probabilistic theories (GPTs). While the scalars of a GPT are…