On the qubit routing problem. | 1 | 0.36 | 2019 |
Optimising Clifford Circuits with Quantomatic. | 1 | 0.36 | 2019 |
Graph-theoretic Simplification of Quantum Circuits with the ZX-calculus. | 0 | 0.34 | 2019 |
Verifying the Smallest Interesting Colour Code with Quantomatic. | 7 | 0.50 | 2017 |
Interacting Frobenius Algebras are Hopf. | 10 | 0.62 | 2016 |
Symmetry, Compact Closure and Dagger Compactness for Categories of Convex Operational Models. | 2 | 0.50 | 2013 |
Verifying The Steane Code With Quantomatic | 15 | 0.80 | 2013 |
Pivoting Makes The Zx-Calculus Complete For Real Stabilizers | 9 | 0.62 | 2013 |
Tutorial: Graphical Calculus for Quantum Circuits. | 0 | 0.34 | 2012 |
Strong Complementarity and Non-locality in Categorical Quantum Mechanics | 21 | 1.56 | 2012 |
Open Graphs And Computational Reasoning | 6 | 0.65 | 2010 |
Rewriting measurement-based quantum computations with generalised flow | 26 | 1.84 | 2010 |
Interacting Quantum Observables: Categorical Algebra and Diagrammatics | 60 | 3.62 | 2009 |
Graphical reasoning in compact closed categories for quantum computation | 15 | 1.53 | 2009 |
Graph States and the Necessity of Euler Decomposition | 16 | 1.53 | 2009 |
Extending Graphical Representations for Compact Closed Categories with Applications to Symbolic Quantum Computation | 2 | 0.46 | 2008 |
Interacting Quantum Observables | 20 | 2.18 | 2008 |
A categorical quantum logic | 15 | 2.12 | 2006 |