Procedurally optimised ZX-diagram cutting for efficient T-decomposition in classical simulation

DOI10.4204/EPTCS.406.3MaRDI QIDQ6934071zbMATH OpenFDO

Authors Matthew Sutcliffe, Aleks Kissinger

Publication date 3 September 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4204/EPTCS.406.3

zbMATH Keywords

T-gatesvertex cutsZX-calculus

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68)

Cites work

• A simplified stabilizer ZX-calculus
• Annealing optimisation of mixed ZX phase circuits
• Classical simulation of quantum circuits with partial and graphical stabiliser decompositions
• Flow-preserving ZX-calculus Rewrite Rules for Optimisation and Obfuscation
• scientific article; zbMATH DE number 7453183 (Why is no real title available?)
• scientific article; zbMATH DE number 7651038 (Why is no real title available?)
• Hybrid quantum-classical circuit simplification with the ZX-calculus
• Interacting quantum observables: categorical algebra and diagrammatics
• Picturing quantum processes. A first course in quantum theory and diagrammatic reasoning
• Tensor network rewriting strategies for satisfiability and counting

This page was built for publication: Procedurally optimised ZX-diagram cutting for efficient T-decomposition in classical simulation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6934071)