Completeness of the Phase-free ZH-calculus

Abstract

The ZH-calculus is a graphical calculus for linear maps between qubits that allows a natural representation of the Toffoli+Hadamard gate set. The original version of the calculus, which allows every generator to be labelled by an arbitrary complex number, was shown to be complete by Backens and Kissinger. Even though the calculus is complete, this does not mean it allows one to easily reason in restricted settings such as is the case in quantum computing. In this paper we study the fragment of the ZH-calculus that is phase-free, and thus is closer aligned to physically implementable maps. We present a modified rule-set for the phase-free ZH-calculus and show that it is complete. We further discuss the minimality of this rule-set and we give an intuitive interpretation of the rules. Our completeness result follows by reducing to Vilmart's rule-set for the phase-free $\Delta$ZX-calculus.

arXiv comment12 pages + 12 page appendix

References in corpus (5)

• Reducing T-count with the ZX-calculus
• The ZX calculus is a language for surface code lattice surgery
• A universal completion of the ZX-calculus
• Optimising Clifford Circuits with Quantomatic
• A ZX-Calculus with Triangles for Toffoli-Hadamard, Clifford+T, and Beyond

Cited by in corpus (6)

• ZX-calculus for the working quantum computer scientist
• Tensor Network Rewriting Strategies for Satisfiability and Counting
• Completeness of the ZH-calculus
• Rewriting and Completeness of Sum-Over-Paths in Dyadic Fragments of Quantum Computing
• Quantum Theory from Principles, Quantum Software from Diagrams
• Minimal Equational Theories for Quantum Circuits