• Corpus ID: 92982931

Graphical Calculus for products and convolutions

@article{Miatto2019GraphicalCF,
  title={Graphical Calculus for products and convolutions},
  author={Filippo M. Miatto},
  journal={arXiv: Quantum Physics},
  year={2019}
}
  • F. Miatto
  • Published 4 March 2019
  • Mathematics
  • arXiv: Quantum Physics
Graphical calculus is an intuitive visual notation for manipulating tensors and index contractions. Using graphical calculus leads to simple and memorable derivations, and with a bit of practice one can learn to prove complex identities even without the need for pen and paper. This manuscript is meant as a demonstration of the power and flexibility of graphical notation and we advocate exploring the use of graphical calculus in undergraduate courses. In the first part we define the following… 
SZX-Calculus: Scalable Graphical Quantum Reasoning
TLDR
The Scalable ZX-calculus is introduced, a formal and compact graphical language for the design and verification of quantum computations and two examples of applications are provided, for graph states and error correcting codes.
Colored props for large scale graphical reasoning
TLDR
The prop formalism is extended to any prop, making it a general tool for graphical languages manipulation, and a solution to scalability problems when it comes to writing large diagrams for ZX-calculus.

References

SHOWING 1-10 OF 20 REFERENCES
Tensor networks and graphical calculus for open quantum systems
TLDR
A graphical calculus for completely positive maps is described and the theory of open quantum systems and other fundamental primitives of quantum information theory using the language of tensor networks is reviewed.
A Survey of Graphical Languages for Monoidal Categories
This article is intended as a reference guide to various notions of monoidal categories and their associated string diagrams. It is hoped that this will be useful not just to mathematicians, but also
Physics, Topology, Logic and Computation: A Rosetta Stone
In physics, Feynman diagrams are used to reason about quantum processes. In the 1980s, it became clear that underlying these diagrams is a powerful analogy between quantum physics and topology.
Charged string tensor networks
  • J. Biamonte
  • Physics
    Proceedings of the National Academy of Sciences
  • 2017
TLDR
Liu et al. (7) recently developed a topological variant of tensor networks that led to their discovery of an elegant charged string braiding for the controlled NOT gate (also known as the Feynman gate).
Towards an algebraic theory of Boolean circuits
Some properties of matrix product and its applications in nonnegative tensor decomposition
Some prosperities of matrix product are presented in the paper, Kronecker product, Khatri-Rao product, Hadamard product and outer product are involved. And we get some results that a multilinear
A Complete Axiomatisation of the ZX-Calculus for Clifford+T Quantum Mechanics
TLDR
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.
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
Quantum picturalism
Why did it take us 50 years since the birth of the quantum mechanical formalism to discover that unknown quantum states cannot be cloned? Yet, the proof of the ‘no-cloning theorem’ is easy, and its
Atemporal Diagrams for Quantum Circuits
A system of diagrams is introduced that allows the representation of various elements of a quantum circuit, including measurements, in a form which makes no reference to time (hence “atemporal”). It
...
...