• Corpus ID: 237605126

A non-anyonic qudit ZW-calculus

@inproceedings{Wang2021ANQ,
  title={A non-anyonic qudit ZW-calculus},
  author={Quanlong Wang},
  year={2021}
}
  • Quanlong Wang
  • Published 23 September 2021
  • Mathematics, Computer Science
ZW-calculus is a useful graphical language for pure qubit quantum computing. It is via the translation of the completeness of ZW-calculus that the first proof of completeness of ZX-calculus was obtained. A d-level generalisation of qubit ZW-calculus (anyonic qudit ZW-calculus) has been given in [7] which is universal for pure qudit quantum computing. However, the interpretation of the W spider in this type of ZW-calculus has so-called q-binomial coe ffi cients involved, thus makes computation… 

Figures and Tables from this paper

Qufinite ZX-calculus: a unified framework of qudit ZX-calculi

This paper generalises qubit ZX-calculus to qudit ZX -calculus in any finite dimension by introducing suitable generators, especially a carefully chosen triangle node, and obtains a set of rewriting rules which can be seen as a direct generalisation of qubit rules, and a normal form for any qudit vectors.

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.

Differentiating and Integrating ZX Diagrams with Applications to Quantum Machine Learning

The new analytic framework of ZX-calculus is illustrated by applying it in context of quantum machine learning for the analysis of barren plateaus by elevating ZX to an analytical perspective.

Differentiating and Integrating ZX Diagrams

ZX-calculus has proved to be a useful tool for quantum technology with a wide range of successful applications. Most of these applications are of an algebraic nature. However, other tasks that

References

SHOWING 1-10 OF 13 REFERENCES

Qufinite ZX-calculus: a unified framework of qudit ZX-calculi

This paper generalises qubit ZX-calculus to qudit ZX -calculus in any finite dimension by introducing suitable generators, especially a carefully chosen triangle node, and obtains a set of rewriting rules which can be seen as a direct generalisation of qubit rules, and a normal form for any qudit vectors.

Two complete axiomatisations of pure-state qubit quantum computing

Extended versions of ZW and ZX calculus are presented, and their completeness for pure-state qubit theory is proved by a strategy that rewrites all diagrams into a normal form, thus solving two major open problems in categorical quantum mechanics.

A Diagrammatic Axiomatisation for Qubit Entanglement

  • Amar Hadzihasanovic
  • Mathematics
    2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science
  • 2015
This paper presents a full graphical axiomatisation of the relations between GHZ and W: the ZW calculus, which refines a version of the preexisting ZX calculus, while keeping its most desirable characteristics: undirected ness, a large degree of symmetry, and an algebraic underpinning.

The Compositional Structure of Multipartite Quantum Entanglement

It is shown that multipartite quantum entanglement admits a compositional structure, and hence is subject to modern computer science methods, and induces a generalised graph state paradigm for measurement-based quantum computing.

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.

Algebraic complete axiomatisation of ZX-calculus with a norm form via elementary matrix operations

In this paper we give a complete axiomatisation of qubit ZX-calculus via elementary transformations which are basic operations in linear algebra. This formalism has two main advantages. First, all

An Algebraic Axiomatisation of ZX-calculus

  • Quanlong Wang
  • Mathematics
    Electronic Proceedings in Theoretical Computer Science
  • 2021
In this paper we give an algebraic complete axiomatisation of ZX-calculus in the sense that there are only ring operations involved for phases, without any need of trigonometry functions such as sin

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 categorical semantics of quantum protocols

  • S. AbramskyB. Coecke
  • Computer Science
    Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004.
  • 2004
This paper focuses on quantum information protocols, which exploit quantum-mechanical effects in an essential way and form the basis for novel and potentially very important applications to secure and fault-tolerant communication and computation.