Cover Image

Completeness of the ZH-calculus

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Backens, Miriam, Kissinger, Aleks, Miller-Bakewell, Hector, van de Wetering, John, Wolffs, Sal
Format:	Preprint
Published:	2021
Subjects:	Quantum Physics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Catalysing Completeness and Universality
by: Kissinger, Aleks, et al.
Published: (2024)

ZX-Flow: A Flexible Criterion for Deterministic Computation with ZX-Diagrams
by: Kissinger, Aleks, et al.
Published: (2026)

Scalable Spider Nests (...Or How to Graphically Grok Transversal Non-Clifford Gates)
by: Kissinger, Aleks, et al.
Published: (2024)

Optimal compilation of parametrised quantum circuits
by: van de Wetering, John, et al.
Published: (2024)

Completeness for Fault Equivalence of Clifford ZX Diagrams
by: Rüsch, Maximilian, et al.
Published: (2025)

A full dichotomy for Holant$^c$, inspired by quantum computation
by: Backens, Miriam
Published: (2022)

Fast Classical Simulation of Quantum Circuits via Parametric Rewriting in the ZX-Calculus
by: Sutcliffe, Matthew, et al.
Published: (2024)

Procedurally Optimised ZX-Diagram Cutting for Efficient T-Decomposition in Classical Simulation
by: Sutcliffe, Matthew, et al.
Published: (2024)

Hybrid Quantum-Classical Machine Learning with String Diagrams
by: Koziell-Pipe, Alexander, et al.
Published: (2024)

Ultra Low Overhead Syndrome Extraction for the Steane code
by: Poór, Boldizsár, et al.
Published: (2025)

Fault Tolerance by Construction
by: Rodatz, Benjamin, et al.
Published: (2025)

Floquetifying stabiliser codes with distance-preserving rewrites
by: Rodatz, Benjamin, et al.
Published: (2024)

An algebraic interpretation of Pauli flow, leading to faster flow-finding algorithms
by: Mitosek, Piotr, et al.
Published: (2024)

Inserting Planar-Measured Qubits into MBQC Patterns while Preserving Flow
by: Backens, Miriam, et al.
Published: (2025)

Finding trail covers: near-optimal decompositions of graph states as linear fusion networks
by: Cashman, William, et al.
Published: (2025)

Efficient Classical Simulation of Low-Rank-Width Quantum Circuits Using ZX-Calculus
by: Kuyanov, Fedor, et al.
Published: (2026)

A complete logic for causal consistency
by: Simmons, Will, et al.
Published: (2024)

Quantum Supermaps are Characterized by Locality
by: Wilson, Matt, et al.
Published: (2022)

Equivariant Reinforcement Learning for Clifford Quantum Circuit Synthesis
by: Yeung, Richie, et al.
Published: (2026)

An effect-theoretic reconstruction of quantum theory
by: van de Wetering, John
Published: (2018)

Automated quantum circuit optimization with randomized replacements
by: Szyniszewski, Marcin, et al.
Published: (2026)

Preserving MWPM-Decodability in Fault-Equivalent Rewrites
by: Schweikart, Maximilian, et al.
Published: (2026)

Graphical Algebraic Geometry: From Ideals and Varieties to Quantum Calculi
by: Gao, Dichuan, et al.
Published: (2026)

Classically Simulating Quantum Supremacy IQP Circuits through a Random Graph Approach
by: Codsi, Julien, et al.
Published: (2022)

Optimising quantum circuits is generally hard
by: van de Wetering, John, et al.
Published: (2023)

A Complete and Natural Rule Set for Multi-Qutrit Clifford Circuits
by: Li, Sarah Meng, et al.
Published: (2025)

Simple qudit ZX and ZH calculi, via integrals
by: de Beaudrap, Niel, et al.
Published: (2023)

ZX-calculus is Complete for Finite-Dimensional Hilbert Spaces
by: Poór, Boldizsár, et al.
Published: (2024)

Exact Synthesis of Multiqutrit Clifford-Cyclotomic Circuits
by: Glaudell, Andrew N., et al.
Published: (2024)

The Qudit ZH Calculus for Arbitrary Finite Fields: Universality and Application
by: Gao, Dichuan
Published: (2024)

Unifying flavors of fault tolerance with the ZX calculus
by: Bombin, Hector, et al.
Published: (2023)

Completeness of qufinite ZXW calculus, a graphical language for finite-dimensional quantum theory
by: Wang, Quanlong, et al.
Published: (2023)

SpiderCat: Optimal Fault-Tolerant Cat State Preparation
by: Khesin, Andrey Boris, et al.
Published: (2026)

Bounds on Fluctuations of First Passage Times for Counting Observables in Classical and Quantum Markov Processes
by: Bakewell-Smith, George, et al.
Published: (2024)

From Tensor Networks to Tractable Circuits, and back
by: Quist, Arend-Jan, et al.
Published: (2026)

Qubit-count optimization using ZX-calculus
by: Vandaele, Vivien
Published: (2024)

Holographic codes seen through ZX-calculus
by: Wan, Kwok Ho, et al.
Published: (2026)

Application of ZX-calculus to Quantum Architecture Search
by: Ewen, Tom, et al.
Published: (2024)

Bridging wire and gate cutting with ZX-calculus
by: Schumann, Marco, et al.
Published: (2025)

The decohered ZX-calculus
by: Carette, Titouan, et al.
Published: (2025)