8 papers · 1 filter
From Tensor Networks to Tractable Circuits, and back
Arend-Jan Quist, Marc Farreras Bartra, Alexis de Colnet +2
Tensor networks and circuits are widely used data structures to represent pseudo-Boolean functions. These two formalisms have been studied primarily in separate communities, and th…
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…
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…
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…
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…