Scalable Spider Nests (...Or How to Graphically Grok Transversal Non-Clifford Gates)

Abstract

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 complex rules involving ZX-diagrams, called spider nest identities, can be captured succinctly using the scalable ZX-calculus, and all such identities can be proved inductively from a single new rule using the Clifford ZX-calculus. This can be combined with the ZX picture of CSS codes, developed in the first "grokking" paper, to give a simple characterisation of the set of all transversal diagonal gates at the third level of the Clifford hierarchy implementable in an arbitrary CSS code.

arXiv commentIn Proceedings QPL 2024, arXiv:2408.05113

References in corpus (21)

• Universal Quantum Computation with ideal Clifford gates and noisy ancillas
• Improved Simulation of Stabilizer Circuits
• A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
• Magic state distillation with low overhead
• Interacting Quantum Observables: Categorical Algebra and Diagrammatics
• Reducing T-count with the ZX-calculus
• The ZX-calculus is complete for stabilizer quantum mechanics
• A unified framework for magic state distillation and multi-qubit gate-synthesis with reduced resource cost
• Diagonal gates in the Clifford hierarchy
• On Optimality of CSS Codes for Transversal $T$
• T-count optimization and Reed-Muller codes
• Techniques to Reduce $\pi /4$-Parity-Phase Circuits, Motivated by the ZX Calculus
• A Finite Presentation of CNOT-Dihedral Operators
• Classification of Small Triorthogonal Codes
• Completeness of the ZX-Calculus
• Quantum Pin Codes
• Transversal Diagonal Logical Operators for Stabiliser Codes
• Phase-free ZX diagrams are CSS codes (...or how to graphically grok the surface code)
• Supplementarity is Necessary for Quantum Diagram Reasoning
• AND-gates in ZX-calculus: Spider Nest Identities and QBC-completeness
• Quantum Circuit Optimization with AlphaTensor

Cited by in corpus (2)

• String Diagrams for Defect-Based Surface Code Computing
• A Complete Equational Theory for Quantum Circuits with Generalized Control