Miriam Backens & Aleks Kissinger (2018):
ZH: A Complete Graphical Calculus for Quantum Computations Involving Classical Non-linearity.
In: Proceedings of the 15th International Workshop on Quantum Physics and Logic, QPL 2018, Halifax, Canada, 3-7th June 2018.,
pp. 23–42,
doi:10.4204/ EPTCS.287.2.
Miriam Backens, Simon Perdrix & Quanlong Wang (2017):
A Simplified Stabilizer ZX-calculus.
EPTCS 236,
pp. 1–20,
doi:10.4204/EPTCS.236.1.
John C. Baez, Brandon Coya & Franciscus Rebro (2018):
Props in Network Theory.
Theory and Applications of Categories 33(25),
pp. 727 – 783.
arXiv:1707.08321.
Niel de Beaudrap, Xiaoning Bian & Quanlong Wang (2020):
Fast and Effective Techniques for T-Count Reduction via Spider Nest Identities.
In: Steven T. Flammia: 15th Conference on the Theory of Quantum Computation, Communication and Cryptography, TQC 2020, June 9-12, 2020, Riga, Latvia,
LIPIcs 158.
Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
pp. 11:1–11:23,
doi:10.4230/LIPIcs.TQC.2020.11.
Niel de Beaudrap, Xiaoning Bian & Quanlong Wang (2020):
Techniques to Reduce π/4-Parity-Phase Circuits, Motivated by the ZX Calculus.
In: Bob Coecke & Matthew Leifer: Proceedings 16th International Conference on Quantum Physics and Logic, Chapman University, Orange, CA, USA., 10-14 June 2019,
Electronic Proceedings in Theoretical Computer Science 318.
Open Publishing Association,
pp. 131–149,
doi:10.4204/EPTCS.318.9.
Niel de Beaudrap, Aleks Kissinger & Konstantinos Meichanetzidis (2020):
Tensor Network Rewriting Strategies for Satisfiability and Counting.
To appear in Proceedings 17th International Conference on Quantum Physics and Logic.
arXiv:2004.06455.
Bob Coecke, Ross Duncan, Aleks Kissinger & Quanlong Wang (2012):
Strong Complementarity and Non-locality in Categorical Quantum Mechanics.
In: Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science,
LICS '12.
IEEE Computer Society,
pp. 245–254,
doi:10.1109/LICS.2012.35.
Bob Coecke & Aleks Kissinger (2017):
Picturing quantum processes.
Cambridge University Press,
doi:10.1017/9781316219317.
Bob Coecke & Quanlong Wang (2018):
ZX-rules for 2-qubit Clifford+T Quantum Circuits.
In: Proceedings of the 10th International Conference, Reversible Computation 2018,
LNCS,
pp. 144–161,
doi:10.1007/978-3-319-99498-7_10.
Ross Duncan & Simon Perdrix (2009):
Graph States and the Necessity of Euler Decomposition.
Mathematical Theory and Computational Practice 5635,
pp. 167–177,
doi:10.1007/978-3-642-03073-4_18.
Amar Hadzihasanovic, Kang Feng Ng & Quanlong Wang (2018):
Two Complete Axiomatisations of Pure-state Qubit Quantum Computing.
In: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science,
LICS '18.
ACM,
pp. 502–511,
doi:10.1145/3209108.3209128.
Emmanuel Jeandel, Simon Perdrix & Renaud Vilmart (2018):
A Complete Axiomatisation of the ZX-Calculus for Clifford+T Quantum Mechanics.
In: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science,
LICS '18.
ACM,
New York, NY, USA,
pp. 559–568,
doi:10.1145/3209108.3209131.
Emmanuel Jeandel, Simon Perdrix & Renaud Vilmart (2018):
Diagrammatic Reasoning Beyond Clifford+T Quantum Mechanics.
In: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science,
LICS '18.
ACM,
New York, NY, USA,
pp. 569–578,
doi:10.1145/3209108.3209139.
Emmanuel Jeandel, Simon Perdrix & Renaud Vilmart (2019):
A Generic Normal Form for ZX-Diagrams and Application to the Rational Angle Completeness.
In: 34th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2019, Vancouver, BC, Canada, June 24-27, 2019,
pp. 1–10,
doi:10.1109/LICS.2019.8785754.
Louis Lemonnier, John van de Wetering & Aleks Kissinger (2020):
Hypergraph simplification: Linking the path-sum approach to the ZH-calculus.
To appear in Proceedings 17th International Conference on Quantum Physics and Logic.
arXiv:2003.13564.
Saunders MacLane (1965):
Categorical algebra.
Bulletin of the American Mathematical Society 71(1),
pp. 40–106,
doi:10.1090/S0002-9904-1965-11234-4.
https://projecteuclid.org:443/euclid.bams/1183526392.
Anthony Munson, Bob Coecke & Quanlong Wang (2020):
AND-gates in ZX-calculus: spider nest identities and QBC-completeness.
To appear in Proceedings 17th International Conference on Quantum Physics and Logic.
arXiv:1910.06818.
Kang Feng Ng & Quanlong Wang (2017):
A universal completion of the ZX-calculus.
arXiv:1706.09877.
Kang Feng Ng & Quanlong Wang (2018):
Completeness of the ZX-calculus for Pure Qubit Clifford+T Quantum Mechanics.
arXiv:1801.07993.
Renaud Vilmart (2019):
A Near-Minimal Axiomatisation of ZX-Calculus for Pure Qubit Quantum Mechanics.
In: 34th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2019, Vancouver, BC, Canada, June 24-27, 2019,
pp. 1–10,
doi:10.1109/LICS.2019.8785765.
John van de Wetering & Sal Wolffs (2019):
Completeness of the Phase-free ZH-calculus.
arXiv:1904.07545.