Scalable spider nests ({\dots}or how to graphically grok transversal non-Clifford gates)

DOI10.4204/EPTCS.406.4MaRDI QIDQ6934069zbMATH OpenFDO

Authors Aleks Kissinger, John van de Wetering

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.4

zbMATH Keywords

grokkingnon-Clifford gatesspider nests

Mathematics Subject Classification ID

Quantum gates (81P65) Quantum computation (81P68)

Cites work

• A finite presentation of CNOT-dihedral operators
• And-gates in ZX-calculus: spider nest identities and QBC-completeness
• Completeness of the ZX-calculus
• scientific article; zbMATH DE number 7651038 (Why is no real title available?)
• Interacting Quantum Observables
• Interacting quantum observables: categorical algebra and diagrammatics
• Quantum Pin Codes
• Supplementarity is necessary for quantum diagram reasoning
• SZX-calculus: scalable graphical quantum reasoning
• T-Count Optimization and Reed–Muller Codes
• Techniques to reduce /4-parity-phase circuits, motivated by the ZX calculus
• The ZX-calculus is complete for stabilizer quantum mechanics
• Transversal diagonal logical operators for stabiliser codes
• Universal quantum computation with ideal Clifford gates and noisy ancillas
• ZX-rules for 2-qubit \(\text{2-qubit Clifford}+\text{T}\) quantum circuits

This page was built for publication: Scalable spider nests ({\dots}or how to graphically grok transversal non-Clifford gates)

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