Speedy Contraction of ZX Diagrams with Triangles via Stabiliser Decompositions

Abstract

Recent advances in classical simulation of Clifford+T circuits make use of the ZX calculus to iteratively decompose and simplify magic states into stabiliser terms. We improve on this method by studying stabiliser decompositions of ZX diagrams involving the triangle operation. We show that this technique greatly speeds up the simulation of quantum circuits involving multi-controlled gates which can be naturally represented using triangles. We implement our approach in the QuiZX library and demonstrate a significant simulation speed-up (up to multiple orders of magnitude) for random circuits and a variation of previously used benchmarking circuits. Furthermore, we use our software to contract diagrams representing the gradient variance of parametrised quantum circuits, which yields a tool for the automatic numerical detection of the barren plateau phenomenon in ansätze used for quantum machine learning. Compared to traditional statistical approaches, our method yields exact values for gradient variances and only requires contracting a single diagram. The performance of this tool is competitive with tensor network approaches, as demonstrated with benchmarks against the quimb library.

References in corpus (10)

• Exact synthesis of multiqubit Clifford+T circuits
• Barren plateaus in quantum tensor network optimization
• Analyzing the barren plateau phenomenon in training quantum neural networks with the ZX-calculus
• Simulating quantum circuits with ZX-calculus reduced stabiliser decompositions
• Toward Trainability of Quantum Neural Networks
• Quantum circuit compilation and hybrid computation using Pauli-based computation
• Completeness of the ZX-calculus for Pure Qubit Clifford+T Quantum Mechanics
• Completeness for arbitrary finite dimensions of ZXW-calculus, a unifying calculus
• How to Sum and Exponentiate Hamiltonians in ZXW Calculus
• Quantum Machine Learning using the ZXW-Calculus

Cited by in corpus (3)

• Differentiating and Integrating ZX Diagrams with Applications to Quantum Machine Learning
• ZX-calculus is Complete for Finite-Dimensional Hilbert Spaces
• Polynomial-Time Classical Simulation of Hidden Shift Circuits via Confluent Rewriting of Symbolic Sums