@misc{Vandewetering2020,
  author        = {van de Wetering, John},
  title         = {{ZX-calculus for the working quantum computer scientist}},
  year          = {2020},
  month         = dec,
  archiveprefix = {arXiv},
  eprint        = {2012.13966},
  abstract      = {The ZX-calculus is a graphical language for reasoning about quantum computation that has recently seen an increased usage in a variety of areas such as quantum circuit optimisation, surface codes and lattice surgery, measurement-based quantum computation, and quantum foundations. The first half of this review gives a gentle introduction to the ZX-calculus suitable for those familiar with the basics of quantum computing. The aim here is to make the reader comfortable enough with the ZX-calculus that they could use it in their daily work for small computations on quantum circuits and states. The latter sections give a condensed overview of the literature on the ZX-calculus. We discuss Clifford computation and graphically prove the Gottesman-Knill theorem, we discuss a recently introduced extension of the ZX-calculus that allows for convenient reasoning about Toffoli gates, and we discuss the recent completeness theorems for the ZX-calculus that show that, in principle, all reasoning about quantum computation can be done using ZX-diagrams. Additionally, we discuss the categorical and algebraic origins of the ZX-calculus and we discuss several extensions of the language which can represent mixed states, measurement, classical control and higher-dimensional qudits.},
  keywords      = {zx-calculus, category theory},
  bibsource     = qplbib
}

{"_id":"iYdk9LSz7PCtRXypJ","bibbaseid":"vandewetering-zxcalculusfortheworkingquantumcomputerscientist-2020","author_short":["van de Wetering, J."],"bibdata":{"bibtype":"misc","type":"misc","author":[{"propositions":["van","de"],"lastnames":["Wetering"],"firstnames":["John"],"suffixes":[]}],"title":"ZX-calculus for the working quantum computer scientist","year":"2020","month":"December","archiveprefix":"arXiv","eprint":"2012.13966","abstract":"The ZX-calculus is a graphical language for reasoning about quantum computation that has recently seen an increased usage in a variety of areas such as quantum circuit optimisation, surface codes and lattice surgery, measurement-based quantum computation, and quantum foundations. The first half of this review gives a gentle introduction to the ZX-calculus suitable for those familiar with the basics of quantum computing. The aim here is to make the reader comfortable enough with the ZX-calculus that they could use it in their daily work for small computations on quantum circuits and states. The latter sections give a condensed overview of the literature on the ZX-calculus. We discuss Clifford computation and graphically prove the Gottesman-Knill theorem, we discuss a recently introduced extension of the ZX-calculus that allows for convenient reasoning about Toffoli gates, and we discuss the recent completeness theorems for the ZX-calculus that show that, in principle, all reasoning about quantum computation can be done using ZX-diagrams. Additionally, we discuss the categorical and algebraic origins of the ZX-calculus and we discuss several extensions of the language which can represent mixed states, measurement, classical control and higher-dimensional qudits.","keywords":"zx-calculus, category theory","bibsource":"Quantum Programming Languages & Verification Bibliography, https://git.io/qpl-bib","bibtex":"@misc{Vandewetering2020,\n author = {van de Wetering, John},\n title = {{ZX-calculus for the working quantum computer scientist}},\n year = {2020},\n month = dec,\n archiveprefix = {arXiv},\n eprint = {2012.13966},\n abstract = {The ZX-calculus is a graphical language for reasoning about quantum computation that has recently seen an increased usage in a variety of areas such as quantum circuit optimisation, surface codes and lattice surgery, measurement-based quantum computation, and quantum foundations. The first half of this review gives a gentle introduction to the ZX-calculus suitable for those familiar with the basics of quantum computing. The aim here is to make the reader comfortable enough with the ZX-calculus that they could use it in their daily work for small computations on quantum circuits and states. The latter sections give a condensed overview of the literature on the ZX-calculus. We discuss Clifford computation and graphically prove the Gottesman-Knill theorem, we discuss a recently introduced extension of the ZX-calculus that allows for convenient reasoning about Toffoli gates, and we discuss the recent completeness theorems for the ZX-calculus that show that, in principle, all reasoning about quantum computation can be done using ZX-diagrams. Additionally, we discuss the categorical and algebraic origins of the ZX-calculus and we discuss several extensions of the language which can represent mixed states, measurement, classical control and higher-dimensional qudits.},\n keywords = {zx-calculus, category theory},\n bibsource = qplbib\n}\n\n","author_short":["van de Wetering, J."],"key":"Vandewetering2020","id":"Vandewetering2020","bibbaseid":"vandewetering-zxcalculusfortheworkingquantumcomputerscientist-2020","role":"author","urls":{},"keyword":["zx-calculus","category theory"],"metadata":{"authorlinks":{}}},"bibtype":"misc","biburl":"https://raw.githubusercontent.com/QuantumPL/bib/main/bbt.bib","dataSources":["JG9W34HAXfSxsC6ML"],"keywords":["zx-calculus","category theory"],"search_terms":["calculus","working","quantum","computer","scientist","van de wetering"],"title":"ZX-calculus for the working quantum computer scientist","year":2020}