Fetching the paper…
Reading the bibliography…
ZX-calculus is a graphical language for quantum computing which is complete in the sense that calculation in matrices can be done in a purely diagrammatic way.
John van de Wetering & Sal Wolffs (2019): Completeness of the Phase-free ZH-calculus · 1904
Earlier work this paper cites.
To appear in Proceedings 17th International Conference on Quantum Physics and Logic
Anthony Munson, Bob Coecke & Quanlong Wang (2020): AND-gates in ZX-calculus: spider nest identities and QBC-completeness · 1910
Earlier work this paper cites.
Bulletin of the American Mathematical Society
Saunders MacLane (1965): Categorical algebra · 1965
Earlier work this paper cites.
To appear in Proceedings 17th International Conference on Quantum Physics and Logic
Louis Lemonnier, John van de Wetering & Aleks Kissinger (2020): Hypergraph simplification: Linking the path-sum approach to the ZH-calculus · 2003
Earlier work this paper cites.
To appear in Proceedings 17th International Conference on Quantum Physics and Logic
Niel de Beaudrap, Aleks Kissinger & Konstantinos Meichanetzidis (2020): Tensor Network Rewriting Strategies for Satisfiability and Counting · 2004
Earlier work this paper cites.
Mathematical Theory and Computational Practice
Ross Duncan & Simon Perdrix (2009): Graph States and the Necessity of Euler Decomposition · 2009
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.
In: Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Bob Coecke, Ross Duncan, Aleks Kissinger & Quanlong Wang (2012): Strong Complementarity and Non-locality in Categorical Quantum Mechanics · 2012
Cited alongside, same era.
Cambridge University Press, 10.1017/9781316219317
Bob Coecke & Aleks Kissinger (2017): Picturing quantum processes · 2017
Cited alongside, same era.
Kang Feng Ng & Quanlong Wang (2017): A universal completion of the ZX-calculus · 2017
Cited alongside, same era.
In: Proceedings of the 15th International Workshop on Quantum Physics and Logic, QPL 2018, Halifax, Canada, 3-7th June 2018
Miriam Backens & Aleks Kissinger (2018): ZH: A Complete Graphical Calculus for Quantum Computations Involving Classical Non-linearity · 2018
Cited alongside, same era.
Theory and Applications of Categories
John C. Baez, Brandon Coya & Franciscus Rebro (2018): Props in Network Theory · 2018
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
Later among the works it cites.
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
Later among the works it cites.
Kang Feng Ng & Quanlong Wang (2018): Completeness of the ZX-calculus for Pure Qubit Clifford+T Quantum Mechanics · 2018
Later among the works it cites.
In Bob Coecke & Matthew Leifer, editors: Proceedings 16th International Conference on Quantum Physics and Logic,
Niel de Beaudrap, Xiaoning Bian & Quanlong Wang (2020): Techniques to Reduce π / 4 \pi/4 -Parity-Phase Circuits, Motivated by the ZX Calculus · 2019
Closest in time.
In: 34th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2019, Vancouver, BC, Canada, June 24-27, 2019
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
In: Proceedings of the 10th International Conference, Reversible Computation 2018
Bob Coecke & Quanlong Wang (2018): ZX-rules for 2-qubit Clifford+T Quantum Circuits · 2018
Cited alongside, same era.
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
Cited alongside, same era.
Emmanuel Jeandel, Simon Perdrix & Renaud Vilmart (2019): A Generic Normal Form for ZX-Diagrams and Application to the Rational Angle Completeness · 2019
Closest in time.
In: 34th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2019, Vancouver, BC, Canada, June 24-27, 2019
Renaud Vilmart (2019): A Near-Minimal Axiomatisation of ZX-Calculus for Pure Qubit Quantum Mechanics · 2019
Closest in time.
In Steven T. Flammia, editor: 15th Conference on the Theory of Quantum Computation, Communication and Cryptography, TQC 2020, June 9-12, 2020, Riga, Latvia
Niel de Beaudrap, Xiaoning Bian & Quanlong Wang (2020): Fast and Effective Techniques for T-Count Reduction via Spider Nest Identities · 2020
Closest in time.