Reducing T-count with the ZX-calculus
Aleks Kissinger, John van de Wetering

TL;DR
This paper introduces a ZX-calculus-based method for reducing T-gates in quantum circuits, achieving significant improvements over previous methods, especially in ancilla-free scenarios, by employing phase teleportation and circuit simplification techniques.
Contribution
It presents a novel T-count reduction technique using ZX-calculus and phase teleportation, applicable to arbitrary non-Clifford phases and validated by circuit equality checks.
Findings
Up to 50% T-count reduction on benchmark circuits
Method matches or exceeds previous T-count reduction approaches
Implemented in open-source library PyZX
Abstract
Reducing the number of non-Clifford quantum gates present in a circuit is an important task for efficiently implementing quantum computations, especially in the fault-tolerant regime. We present a new method for reducing the number of T-gates in a quantum circuit based on the ZX-calculus, which matches or beats previous approaches to T-count reduction on the majority of our benchmark circuits in the ancilla-free case, in some cases yielding up to 50% improvement. Our method begins by representing the quantum circuit as a ZX-diagram, a tensor network-like structure that can be transformed and simplified according to the rules of the ZX-calculus. We then show that a recently-proposed simplification strategy can be extended to reduce T-count using a new technique called phase teleportation. This technique allows non-Clifford phases to combine and cancel by propagating non-locally through a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
