References

  1. Anaconda: Python for Data Science. https://www.anaconda.com/.
  2. Matplotlib. https://matplotlib.org/.
  3. NumPy. https://www.numpy.org/.
  4. Miriam Backens (2015): Making the stabilizer ZX-calculus complete for scalars. In: Chris Heunen, Peter Selinger & Jamie Vicary: Proceedings of the 12th International Workshop on Quantum Physics and Logic (QPL 2015), Electronic Proceedings in Theoretical Computer Science 195, pp. 17–32, doi:10.4204/EPTCS.195.2.
  5. Miriam Backens & Aleks Kissinger (2018): ZH: A Complete Graphical Calculus for Quantum Computations Involving Classical Non-linearity. arXiv preprint arXiv:1805.02175, doi:10.4204/EPTCS.287.2.
  6. Niel de Beaudrap & Dominic Horsman (2017): The ZX calculus is a language for surface code lattice surgery.
  7. Jianxin Chen, Fang Zhang, Mingcheng Chen, Cupjin Huang, Michael Newman & Yaoyun Shi (2018): Classical simulation of intermediate-size quantum circuits. arXiv preprint arXiv:1805.01450.
  8. B. Coecke & R. Duncan (2008): Interacting quantum observables. In: Proceedings of the 37th International Colloquium on Automata, Languages and Programming (ICALP), Lecture Notes in Computer Science, doi:10.1007/978-3-540-70583-3_25.
  9. B. Coecke & R. Duncan (2011): Interacting quantum observables: categorical algebra and diagrammatics. New Journal of Physics 13, pp. 043016, doi:10.1088/1367-2630/13/4/043016. arXiv:quant-ph/09064725.
  10. B. Coecke & A. Kissinger (2010): The compositional structure of multipartite quantum entanglement. In: Automata, Languages and Programming, Lecture Notes in Computer Science. Springer, pp. 297–308, doi:10.1007/978-3-642-14162-1_25. Extended version: arXiv:1002.2540.
  11. B. Coecke & A. Kissinger (2014): Picturing Quantum Processes. Cambridge University Press, doi:10.1007/978-3-319-91376-6_6.
  12. Andrew W Cross, Lev S Bishop, John A Smolin & Jay M Gambetta (2017): Open quantum assembly language. arXiv preprint arXiv:1707.03429.
  13. R. Duncan & S. Perdrix (2010): Rewriting measurement-based quantum computations with generalised flow. In: Proceedings of ICALP, Lecture Notes in Computer Science. Springer, pp. 285–296, doi:10.1007/978-3-642-14162-1_24.
  14. Ross Duncan, Aleks Kissinger, Simon Pedrix & John van de Wetering (2019): Graph-theoretic Simplification of Quantum Circuits with the ZX-calculus. arXiv preprint arXiv:1902.03178.
  15. Andrew Fagan & Ross Duncan (2019): Optimising Clifford Circuits with Quantomatic. In: Peter Selinger & Giulio Chiribella: Proceedings of the 15th International Conference on Quantum Physics and Logic (QPL), Electronic Proceedings in Theoretical Computer Science 287. Open Publishing Association, pp. 85–105, doi:10.4204/EPTCS.287.5.
  16. Amar Hadzihasanovic (2017): The algebra of entanglement and the geometry of composition. University of Oxford.
  17. 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, New York, NY, USA, pp. 502–511, doi:10.1145/3209108.3209128.
  18. Luke Ellis Heyfron & Earl Campbell (2018): An efficient quantum compiler that reduces T count. Quantum Science and Technology, doi:10.1088/2058-9565/aad604.
  19. 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.
  20. Project Jupyter: Project Jupyter Homepage. https://jupyter.org/index.html.
  21. Aleks Kissinger: Tikzit Homepage. https://tikzit.github.io/.
  22. Aleks Kissinger & Arianne Meijer-van de Griend (2019): CNOT circuit extraction for topologically-constrained quantum memories. arXiv preprint arXiv:1904.00633.
  23. Aleks Kissinger, Alex Merry & Matvey Soloviev (2014): Pattern graph rewrite systems. In: Benedikt Löwe & Glynn Winskel: Proceedings 8th International Workshop on Developments in Computational Models, Cambridge, United Kingdom, 17 June 2012, Electronic Proceedings in Theoretical Computer Science 143. Open Publishing Association, pp. 54–66, doi:10.4204/EPTCS.143.5.
  24. Aleks Kissinger & John van de Wetering: PyZX Documentation. https://pyzx.readthedocs.io.
  25. Aleks Kissinger & John van de Wetering (2019): Reducing T-count with the ZX-calculus. arXiv preprint arXiv:1903.10477.
  26. Aleks Kissinger & John van de Wetering (2019): Universal MBQC with generalised parity-phase interactions and Pauli measurements. Quantum 3, pp. 134, doi:10.22331/q-2019-04-26-134.
  27. Aleks Kissinger & Vladimir Zamdzhiev (2015): Quantomatic: A proof assistant for diagrammatic reasoning. In: International Conference on Automated Deduction, pp. 326–336, doi:10.1007/978-3-319-21401-6_22.
  28. Igor L Markov & Yaoyun Shi (2008): Simulating quantum computation by contracting tensor networks. SIAM Journal on Computing 38(3), pp. 963–981, doi:10.1137/050644756.
  29. Dmitri Maslov: Reversible Logic Synthesis Benchmarks Page. http://webhome.cs.uvic.ca/~dmaslov/.
  30. Yunseong Nam, Neil J Ross, Yuan Su, Andrew M Childs & Dmitri Maslov (2018): Automated optimization of large quantum circuits with continuous parameters. npj Quantum Information 4(1), pp. 23, doi:10.1038/s41534-018-0072-4.
  31. Kang Feng Ng, Amar Hadzihasanovic & Giovanni de Felice (2019): A diagrammatic calculus of fermionic quantum circuits 15. Episciences.org, doi:10.4230/LIPIcs.FSCD.2018.17.
  32. Peter Selinger: Quipper Language Homepage. https://www.mathstat.dal.ca/~selinger/quipper/.
  33. Renaud Vilmart (2018): A Near-Optimal Axiomatisation of ZX-Calculus for Pure Qubit Quantum Mechanics. Available at https://arxiv.org/abs/1812.09114.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org