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

@article{Backens2019ZHAC,
  title={ZH: A Complete Graphical Calculus for Quantum Computations Involving Classical Non-linearity},
  author={Miriam Backens and Aleks Kissinger},
  journal={Electronic Proceedings in Theoretical Computer Science},
  year={2019}
}
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… 

Figures from this paper

Completeness of the ZH-calculus

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

Graphical Fourier Theory and the Cost of Quantum Addition

The ZX-calculus is a convenient formalism for expressing and reasoning about quantum circuits at a low level, whereas the recently-proposed ZH-calculus yields convenient expressions of mid-level

ZX-calculus for the working quantum computer scientist

This review discusses Clifford computation and graphically prove the Gottesman-Knill theorem, a recently introduced extension of the ZX-calculus that allows for convenient reasoning about Toffoli gates, and the recent completeness theorems that show that, in principle, all reasoning about quantum computation can be done using Zx-diagrams.

Completeness of Graphical Languages for Mixed States Quantum Mechanics

A new construction, the discard construction, is introduced, which transforms any †-symmetric monoidal category into a symmetric Monoidal category equipped with a discard map, which provides an extension for several graphical languages that are proved to be complete for general quantum operations.

Circuit Extraction for ZX-diagrams can be #P-hard

This paper proves that any oracle that takes as input a ZX-diagram description of a unitary and produces samples of the output of the associated quantum computation enables efficient probabilistic solutions to NP-complete problems.

Completeness of the Phase-free ZH-calculus

The fragment of the ZH-calculus that is phase-free is studied, and thus is closer aligned to physically implementable maps and the completeness result follows by reducing to Vilmart's rule-set for the phase- free $\Delta$ZX-Calculus.

Diagrammatic Analysis for Parameterized Quantum Circuits

Extensions of the ZX-calculus especially suitable for parameterized quantum circuits, in particular for computing observable expectation values as functions of or for parameters, which are important algorithmic quantities in a variety of applications ranging from combinatorial optimization to quantum chemistry are described.

Graphical Calculi and their Conjecture Synthesis

This work continues the exploration of graphical calculi, inside and outside of the quantum computing setting, by investigating the algebraic structures with which the authors label diagrams, and introduces two important new calculi here.

Finite Verification of Infinite Families of Diagram Equations

The ZX, ZW and ZH calculi are all graphical calculi for reasoning about pure state qubit quantum mechanics. All of these languages use certain diagrammatic decorations, called !-boxes and phase

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.
...

References

SHOWING 1-10 OF 26 REFERENCES

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.

Interacting quantum observables: categorical algebra and diagrammatics

The ZX-calculus is introduced, an intuitive and universal graphical calculus for multi-qubit systems, which greatly simplifies derivations in the area of quantum computation and information and axiomatize phase shifts within this framework.

Picturing Quantum Processes: A First Course in Quantum Theory and Diagrammatic Reasoning

This entirely diagrammatic presentation of quantum theory represents the culmination of ten years of research, uniting classical techniques in linear algebra and Hilbert spaces with cutting-edge developments in quantum computation and foundations.

Both Toffoli and controlled-NOT need little help to do universal quantum computing

It is proved that Controlled-NOT plus any single-qubit real gate that does not preserve the computational basis and is not Hadamard (or its alike) are universal for quantum computing.

The algebra of entanglement and the geometry of composition

The ZW calculus is presented, the first complete diagrammatic axiomatisation of the theory of qubits, and a notion of regular polygraph is proposed, barring cell boundaries that are not homeomorphic to a disk of the appropriate dimension, and the existence of weak units is equivalent to a representability property.

A graphical approach to measurement-based quantum computing

  • R. Duncan
  • Computer Science, Physics
    Quantum Physics and Linguistics
  • 2013
This work demonstrates the use of the ZX-calculus in reasoning about measurement-based quantum computing, where the graphical syntax directly captures the structure of the entangled states used to represent computations, and shows that the notion of information flow within the entangledStates gives rise to rewriting strategies for proving the correctness of quantum programs.

A Simple Proof that Toffoli and Hadamard are Quantum Universal

Recently Shi proved that Toffoli and Hadamard are universal for quantum computation. This is perhaps the simplest universal set of gates that one can hope for, conceptually; It shows that one only

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.

Hierarchy of universal entanglement in 2D measurement-based quantum computation

This work utilizes recent advances in the subject of symmetry-protected topological order (SPTO) to introduce a novel MQC resource state, whose physical and computational behavior differs fundamentally from the cluster state.

Quantomatic: A proof assistant for diagrammatic reasoning

This work briefly outlines the theoretical basis of Quantomatic's rewriting engine, then gives an overview of the core features and architecture and gives a simple example project that computes normal forms for commutative bialgebras.