Completeness of the ZH-calculus

From MaRDI portal
Publication:6050005

DOI10.32408/COMPOSITIONALITY-5-5zbMATH Open1522.81051arXiv2103.06610OpenAlexW3135453135MaRDI QIDQ6050005FDOQ6050005


Authors: Miriam Backens, Aleks Kissinger, Hector Miller-Bakewell, John van de Wetering Edit this on Wikidata


Publication date: 11 October 2023

Published in: Compositionality (Search for Journal in Brave)

Abstract: There are various gate sets used for describing quantum computation. A particularly popular one consists of Clifford gates and arbitrary single-qubit phase gates. Computations in this gate set can be elegantly described by the ZX-calculus, a graphical language for a class of string diagrams describing linear maps between qubits. The ZX-calculus has proven useful in a variety of areas of quantum information, but is less suitable for reasoning about operations outside its natural gate set such as multi-linear Boolean operations like the Toffoli gate. In this paper we study the ZH-calculus, an alternative graphical language of string diagrams that does allow straightforward encoding of Toffoli gates and other more complicated Boolean logic circuits. We find a set of simple rewrite rules for this calculus and show it is complete with respect to matrices over mathbbZ[frac12], which correspond to the approximately universal Toffoli+Hadamard gateset. Furthermore, we construct an extended version of the ZH-calculus that is complete with respect to matrices over any ring R where 1+1 is not a zero-divisor.


Full work available at URL: https://arxiv.org/abs/2103.06610




Recommendations




Cited In (7)





This page was built for publication: Completeness of the ZH-calculus

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