Fetching the paper…
Reading the bibliography…
Recent developments in the ZX-Calculus have resulted in complete axiomatisations first for an approximately universal restriction of the language, and then for the whole language.
In: Matrix analysis
Roger A. Horn & Charles R. Johnson (1985): Positive definite matrices · 1985
Earlier work this paper cites.
Mathematical Theory and Computational Practice
Ross Duncan & Simon Perdrix (2009): Graphs States and the necessity of Euler Decomposition · 2009
Earlier work this paper cites.
Lecture Notes in Computer Science
Ross Duncan & Simon Perdrix (2010): Rewriting measurement-based quantum computations with generalised flow · 2010
Earlier work this paper cites.
New Journal of Physics
Bob Coecke & Ross Duncan (2011): Interacting quantum observables: categorical algebra and diagrammatics · 2011
Earlier work this paper cites.
Master’s thesis, University of Oxford
Anne Hillebrand (2011): Quantum Protocols involving Multiparticle Entanglement and their Representations · 2011
Earlier work this paper cites.
New Journal of Physics
Clare Horsman (2011): Quantum picturalism for topological cluster-state computing · 2011
Earlier work this paper cites.
Available at https://sites.google.com/site/quantomatic/
A. Kissinger, L. Dixon, R. Duncan, B. Frot, A. Merry, D. Quick, M. Soloviev & V. Zamdzhiev (2011): Quantomatic · 2011
Earlier work this paper cites.
Mathematical Structures in Computer Science
Bob Coecke, Dusko Pavlovic & Jamie Vicary (2012): A new description of orthogonal bases · 2012
Earlier work this paper cites.
In: Quantum Physics and Linguistics
Ross Duncan (2013): A Graphical Approach to Measurement-BasedQuantum Computing · 2013
Earlier work this paper cites.
In: QPL 2013
Ross Duncan & Simon Perdrix (2013): Pivoting makes the ZX-calculus complete for real stabilizers · 2013
Earlier work this paper cites.
New Journal of Physics
Miriam Backens (2014): The ZX-calculus is complete for stabilizer quantum mechanics · 2014
Cited alongside, same era.
Electronic Proceedings in Theoretical Computer Science
Miriam Backens (2014): The ZX-calculus is complete for the single-qubit Clifford+T group · 2014
Cited alongside, same era.
Foundations of Physics
Miriam Backens & Ali Nabi Duman (2014): A complete graphical calculus for Spekkens’ toy bit theory · 2014
Cited alongside, same era.
Electronic Proceedings in Theoretical Computer Science
Ross Duncan & Maxime Lucas (2014): Verifying the Steane code with Quantomatic · 2014
Cited alongside, same era.
In: QPL 2014
Christian Schröder de Witt & Vladimir Zamdzhiev (2014): The ZX-calculus is incomplete for quantum mechanics · 2014
Cited alongside, same era.
Logical Methods in Computer Science
Peter Selinger (2015): Generators and relations for n-qubit Clifford operators · 2015
Cited alongside, same era.
Cambridge University Press, doi: 10.1017/9781316219317
Bob Coecke & Aleks Kissinger (2017): Picturing Quantum Processes: A First Course in Quantum Theory and Diagrammatic Reasoning · 2017
Later among the works it cites.
Available at https://arxiv.org/abs/1706.02717
Ross Duncan & Liam Garvie (2017): Verifying the Smallest Interesting Colour Code with Quantomatic · 2017
Later among the works it cites.
In Kim G. Larsen, Hans L. Bodlaender & Jean-Francois Raskin, editors: 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)
Emmanuel Jeandel, Simon Perdrix, Renaud Vilmart & Quanlong Wang (2017): ZX-Calculus: Cyclotomic Supplementarity and Incompleteness for Clifford+T Quantum Mechanics · 2017
Later among the works it cites.
Available at https://arxiv.org/abs/1611.08012
Nicholas Chancellor, Aleks Kissinger, Joschka Roffe, Stefan Zohren & Dominic Horsman (2016): Graphical Structures for Design and Verification of Quantum Error Correction · 2018
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
In: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science
Ross Duncan & Kevin Dunne (2016): Interacting Frobenius Algebras Are Hopf · 2016
Cited alongside, same era.
In: 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)
Simon Perdrix & Quanlong Wang (2016): Supplementarity is Necessary for Quantum Diagram Reasoning · 2016
Cited alongside, same era.
ArXiv e-prints
M. Backens, S. Perdrix & Q. Wang (2017): Towards a Minimal Stabilizer ZX-calculus · 2017
Cited alongside, same era.
In: Novi Commentarii academiae scientiarum Petropolitanae 20
Leonhard Euler (1776): Formulae Generales Pro Translatione Quacunque Corporum Rigidorum
Cited in the paper.
Bob Coecke & Quanlong Wang (2018): ZX-Rules for 2-qubit Clifford+T Quantum Circuits
2018
Closest in time.
In: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science
Amar Hadzihasanovic, Kang Feng Ng & Quanlong Wang (2018): Two Complete Axiomatisations of Pure-state Qubit Quantum Computing · 2018
Closest in time.
In: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science
Emmanuel Jeandel, Simon Perdrix & Renaud Vilmart (2018): A Complete Axiomatisation of the ZX-Calculus for Clifford+T Quantum Mechanics · 2018
Closest in time.
In: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science
Emmanuel Jeandel, Simon Perdrix & Renaud Vilmart (2018): Diagrammatic Reasoning Beyond Clifford+T Quantum Mechanics · 2018
Closest in time.
Available at https://github.com/Quantomatic/pyzx
A. Kissinger & John van de Wetering (2018): PyZX · 2018
Closest in time.