A Simplified Stabilizer ZX-calculus

  title={A Simplified Stabilizer ZX-calculus},
  author={Miriam Backens and Simon Perdrix and Quanlong Wang},
The stabilizer ZX-calculus is a rigorous graphical language for reasoning about quantum mechanics.The language is sound and complete: a stabilizer ZX-diagram can be transformed into another one if and only if these two diagrams represent the same quantum evolution or quantum state. We show that the stabilizer ZX-calculus can be simplified, removing unnecessary equations while keeping only the essential axioms which potentially capture fundamental structures of quantum mechanics. We thus give a… 

Figures from this paper

Towards a Minimal Stabilizer ZX-calculus

It is shown that most of the remaining rules of the language are necessary, however leaving as an open question the necessity of two rules, including the bialgebra rule, which is an axiomatisation of complementarity, the cornerstone of the ZX-calculus.

A Complete Axiomatisation of the ZX-Calculus for Clifford+T Quantum Mechanics

The ZX-Calculus is made complete for the so-called Clifford+T quantum mechanics by adding two new axioms to the language, and it is proved that the π/4-fragment of the ZX -Calculus represents exactly all the matrices over some finite dimensional extension of the ring of dyadic rationals.

Towards Minimality of Clifford + T ZX-Calculus

ZX-calculus is a high-level graphical language used for quantum computation. A complete set of axioms for ZX-calculus has been found very recently. This thesis works towards minimizing axioms of

Complete ZX-Calculi for the Stabiliser Fragment in Odd Prime Dimensions

A family of ZX-calculi which axiomatise the stabiliser fragment of quantum theory in odd prime dimensions are introduced, and it is proved that these calculi are complete, i.e. provide a set of rewrite rules which can be used to prove any equality of stabiliser quantum operations.

Completeness of the ZX-Calculus

This work improves on the known-to-be-complete presentation for the so-called Clifford fragment of the ZX-Calculus, and provides a complete axiomatisation for an altered version of the language which involves an additional generator, making the presentation simpler.

The rational fragment of the ZX-calculus

A new axiomatisation of the rational fragment of the ZX-calculus, a diagrammatic language for quantum mechanics, does not use any metarule, but relies instead on a more natural rule, called the cyclotomic supplementarity rule, that was introduced previously in the literature.

Circuit Relations for Real Stabilizers: Towards TOF+H

This work completes the category CNOT generated by the controlled not gate and the computational ancillary bits, presented by circuit relations, to the real stabilizer fragment of quantum mechanics, and discusses how this could potentially lead to a complete axiomatization, in terms of circuit Relations, for the approximately universal fragment ofquantum mechanicsgenerated by the Toffoli gate, Hadamard gate and computational anCillary bits.

A ZX-Calculus with Triangles for Toffoli-Hadamard, Clifford+T, and Beyond

A ZX-calculus augmented with triangle nodes is considered, and the form of the matrices it represents is precisely shown, and an axiomatisation is provided which makes the language complete for the Toffoli-Hadamard quantum mechanics.

The ZX-Calculus is a powerful graphical language for quantum reasoning and quantum computing introduced

This work improves on the known-to-be-complete presentation for the so-called Clifford fragment of the ZX-Calculus and provides a complete axiomatisation for an altered version of the language which involves an additional generator, making the presentation simpler.

Y-Calculus: A language for real Matrices derived from the ZX-Calculus

A ZX-like diagrammatic language devoted to manipulating real matrices - and rebits -, with its own set of axioms, is introduced, and it is proved that some restriction of the language is complete.



The ZX-calculus is complete for stabilizer quantum mechanics

The ZX-calculus is a graphical calculus for reasoning about quantum systems and processes. It is known to be universal for pure state qubit quantum mechanics (QM), meaning any pure state, unitary

Making the stabilizer ZX-calculus complete for scalars

This work replaces those scalar-free rewrite rules with correctly scaled ones and shows that, by adding one new diagram element and a new rewrite rule, the calculus can be made complete for pure qubit stabilizer quantum mechanics with scalars.

Supplementarity is Necessary for Quantum Diagram Reasoning

It is proved that its π 4-fragment is not complete, in other words the ZX-calculus is notcomplete for the so called "Clifford+T quantum mechanics".

Pivoting makes the ZX-calculus complete for real stabilizers

An angle-free version of the ZX-calculus is derived and it is shown that it is complete for real stabilizer quantum mechanics and does not imply local complementation of graph states.

Graph States and the Necessity of Euler Decomposition

A new equation is introduced, for the Euler decomposition of the Hadamard gate, and it is demonstrated that Van den Nest's theorem--locally equivalent graphs represent the same entanglement--is equivalent to this new axiom.

The Heisenberg Representation of Quantum Computers

Since Shor`s discovery of an algorithm to factor numbers on a quantum computer in polynomial time, quantum computation has become a subject of immense interest. Unfortunately, one of the key features

Interacting Quantum Observables

Using a general categorical formulation, it is shown that pairs of mutually unbiased quantum observables form bialgebra-like structures that enable all observables of finite dimensional Hilbert space quantum mechanics to be described.

The ZX calculus is incomplete for quantum mechanics

We prove that the ZX-calculus is incomplete for quantum mechanics. We suggest the addition of a new 'color-swap' rule, of which currently no analytical formulation is known and which we suspect may

Stabilizer Codes and Quantum Error Correction

An overview of the field of quantum error correction and the formalism of stabilizer codes is given and a number of known codes are discussed, the capacity of a quantum channel, bounds on quantum codes, and fault-tolerant quantum computation are discussed.

Quantum computation and quantum information

  • T. Paul
  • Physics
    Mathematical Structures in Computer Science
  • 2007
This special issue of Mathematical Structures in Computer Science contains several contributions related to the modern field of Quantum Information and Quantum Computing. The first two papers deal