@@ -194,7 +194,7 @@ These will be specified in a modular way but tightly integrated upon compilation
on the mathematical foundations of quantum computing \cite{AbrCoe:CatSemQuant:2004,
%Coecke:2009db, CDKW-lics:2012qy,
Coecke2017Picturing-Quant}.
Powerful and flexible, the \zxcalculus can easily describe computations in both the circuit and measurement-based models of quantum computation (MBQC)~\cite{Raussendorf-2001,Duncan:2012uq,Duncan:2010aa} and can formulate and verify quantum error correcting codes \cite{Horsman:2011lr,Chancellor2016Coherent-Parity, Duncan:2013lr} and quantum algorithms \cite{Stefano-Gogioso2017Fully-graphical, Zeng2015The-Abstract-St}.
Powerful and flexible, the \zxcalculus can easily describe computations in both the circuit and measurement-based models of quantum computation (MBQC)~\cite{Raussendorf-2001,DanosV:meac,Duncan:2012uq,Duncan:2010aa} and can formulate and verify quantum error correcting codes \cite{Horsman:2011lr,Chancellor2016Coherent-Parity, Duncan:2013lr} and quantum algorithms \cite{Stefano-Gogioso2017Fully-graphical, Zeng2015The-Abstract-St}.
The calculus can be viewed both as a formal axiomatic theory of complementary observables in categorical algebra, and as a symbolic notation for tensor networks representing quantum states/linear operators. Reasoning is purely graphical.
% Terms in the \zxcalculus are labelled graphs; equations in the calculus are reified as a small number of graph rewrite rules.
