![]() |
![]() |
University of Birmingham > Talks@bham > Theoretical computer science seminar > Completing the ZX-calculus
![]() Completing the ZX-calculusAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Jamie Vicary. The category-theoretical formulation of quantum theory has given rise to a number of graphical calculi for reasoning about quantum computations. The most well-known of these, the ZX-calculus, was first introduced by Coecke and Duncan in 2007. After a decade of work, the ZX-calculus has now been completed, meaning that whenever two diagrams have the same interpretation, one can be transformed into the other using the graphical rewrite rules. I will present the main completeness theorems and the resulting applications of the ZX-calculus in areas such as the design and analysis of quantum error-correcting codes or the simplification of quantum circuits. I will also discuss the difficulties with determining which rewrite rules are actually necessary, i.e. not derivable from the other rules. This talk is part of the Theoretical computer science seminar series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsType the title of a new list here Midlands Logic Seminar PIPS - Postgraduate Informal Physics SeminarsOther talks[Friday seminar]: Irradiated brown dwarfs in the desert Signatures of structural criticality and universality in the cellular anatomy of the brain Provably Convergent Plug-and-Play Quasi-Newton Methods for Imaging Inverse Problems The percolating cluster is invisible to image recognition with deep learning |