University of Birmingham > Talks@bham > Theoretical computer science seminar > ZX-calculus and its applications

ZX-calculus and its applications

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Dan Ghica.

ZX-calculus is a graphical language for quantum computing featured by strong complementarity. It can also be seen as a detailed version of Categorical Quantum Mechanics (CQM) in the sense that it could fill in any box (morphism) of CQM with green and red spiders. In this talk, I will first show some results on the theoretical side of ZX-calculus: completeness, algebraic axiomatisation, and generalisations to the cases of commutative rings and semirings, even a unified framework for all dimensional qudit ZX-calculus. Then I will give some results on applications of ZX-calculus: spider nest identities, T-count reduction, and fast probabilistic algorithm.

This talk is part of the Theoretical computer science seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


Talks@bham, University of Birmingham. Contact Us | Help and Documentation | Privacy and Publicity.
talks@bham is based on from the University of Cambridge.