ZH: A Complete Graphical Calculus for Quantum Computations Involving Classical Non-linearity

Citations Over TimeTop 10% of 2019 papers

Abstract

We present a new graphical calculus that is sound and complete for a universal family of quantum circuits, which can be seen as the natural string-diagrammatic extension of the approximately (real-valued) universal family of Hadamard+CCZ circuits. The diagrammatic language is generated by two kinds of nodes: the so-called 'spider' associated with the computational basis, as well as a new arity-N generalisation of the Hadamard gate, which satisfies a variation of the spider fusion law. Unlike previous graphical calculi, this admits compact encodings of non-linear classical functions. For example, the AND gate can be depicted as a diagram of just 2 generators, compared to ~25 in the ZX-calculus. Consequently, N-controlled gates, hypergraph states, Hadamard+Toffoli circuits, and diagonal circuits at arbitrary levels of the Clifford hierarchy also enjoy encodings with low constant overhead. This suggests that this calculus will be significantly more convenient for reasoning about the interplay between classical non-linear behaviour (e.g. in an oracle) and purely quantum operations. After presenting the calculus, we will prove it is sound and complete for universal quantum computation by demonstrating the reduction of any diagram to an easily describable normal form.

Related Papers

• → Elementary Quantum Gate Realizations for Multiple-Control Toffoli Gates(2011)136 cited
• → Realization of a deterministic quantum Toffoli gate with a single photon(2021)19 cited
• → Improving the Realization of Multiple-Control Toffoli Gates Using the NCVW Quantum Gate Library(2016)10 cited
• → Enhancing the W State Fusion Process With a Toffoli Gate and a CNOT Gate via One-Way Quantum Computation and Linear Optics(2015)15 cited
• → New Structural Quantum Circuit Simulating a Toffoli Gate(2005)2 cited