References

  1. M. Backens (2014): The ZX-calculus is complete for stabilizer quantum mechanics. New Journal of Physics 16(9), pp. 093021, doi:10.1088/1367-2630/16/9/093021. [arXiv:1307.7025].
  2. M. Backens, S. Perdrix & Q. Wang (2017): Towards a Minimal Stabilizer ZX-calculus. [arXiv:1709.08903].
  3. Niel de Beaudrap, Xiaoning Bian & Quanlong Wang (2020): Fast and effective techniques for T-count reduction via spider nest identities. In: Proceedings of TQC 2020 (to appear). [arXiv:2004.05164].
  4. Niel de Beaudrap & Dominic Horsman (2020): The ZX calculus is a language for surface code lattice surgery. Quantum 4, pp. 218, doi:10.22331/q-2020-01-09-218. [arXiv:1704.08670].
  5. Daniel E. Browne, Elham Kashefi, Mehdi Mhalla & Simon Perdrix (2007): Generalized flow and determinism in measurement-based quantum computation. New Journal of Physics 9, doi:10.1088/1367-2630/9/8/250. [arXiv:quant-ph/0702212].
  6. Daniel E Browne & Terry Rudolph (2005): Resource-efficient linear optical quantum computation. Physical Review Letters 95(1), pp. 010501, doi:10.1103/PhysRevLett.95.010501. [arXiv:quant-ph/0405157].
  7. Titouan Carette, Emmanuel Jeandel, Simon Perdrix & Renaud Vilmart (2019): Completeness of Graphical Languages for Mixed States Quantum Mechanics. In: Christel Baier, Ioannis Chatzigiannakis, Paola Flocchini & Stefano Leonardi: 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019), Leibniz International Proceedings in Informatics (LIPIcs) 132. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, pp. 108:1–108:15, doi:10.4230/LIPIcs.ICALP.2019.108. [arXiv:1902.07143].
  8. Nicholas Chancellor, Aleks Kissinger, Joschka Roffe, Stefan Zohren & Dominic Horsman (2016): Graphical structures for design and verification of quantum error correction. [arXiv:1611.08012].
  9. Bob Coecke & Ross Duncan (2011): Interacting Quantum Observables: Categorical Algebra and Diagrammatics. New Journal of Physics 13(4), pp. 043016, doi:10.1088/1367-2630/13/4/043016. [arXiv:0906.4725].
  10. Bob Coecke & Aleks Kissinger (2017): Picturing Quantum Processes: A first course in quantum theory and diagrammatic reasoning. Cambridge University Press.
  11. Alexander Cowtan, Silas Dilkes, Ross Duncan, Alexandre Krajenbrink, Will Simmons & Seyon Sivarajah (2019): On the qubit routing problem. In: 14th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2019), pp. art. 5, doi:10.4230/LIPIcs.TQC.2019.5. [arXiv:1902.08091].
  12. Vincent Danos & Elham Kashefi (2006): Determinism in the one-way model. Physical Review A 74, doi:10.1103/PhysRevA.74.052310. [arXiv:quant-ph/0506062].
  13. Vincent Danos, Elham Kashefi, Prakash Panangaden & Simon Perdrix (2010): Extended Measurement Calculus. Semantic Techniques in Quantum Computation, pp. 235–310, doi:10.1017/CBO9781139193313.008.
  14. Ross Duncan, Aleks Kissinger, Simon Pedrix & John van de Wetering (2019): Graph-theoretic Simplification of Quantum Circuits with the ZX-calculus. [arXiv:1902.03178].
  15. Ross Duncan & Maxime Lucas (2013): Verifying the Steane code with Quantomatic. In: QPL 2013, Electronic Proceedings in Theoretical Computer Science, pp. 33–49, doi:10.4204/EPTCS.171.4. [arXiv:1306.4532].
  16. Ross Duncan & Simon Perdrix (2010): Rewriting Measurement-Based Quantum Computations with Generalised Flow. In: Samson Abramsky, Cyril Gavoille, Claude Kirchner, Friedhelm Meyer auf der Heide & Paul G. Spirakis: Automata, Languages and Programming. Springer Berlin Heidelberg, Berlin, Heidelberg, pp. 285–296, doi:10.1007/978-3-642-14162-1_24.
  17. Ross Duncan & Simon Perdrix (2013): Pivoting Makes the ZX-Calculus Complete for Real Stabilizers. In: QPL 2013, Electronic Proceedings in Theoretical Computer Science, pp. 50–62, doi:10.4204/EPTCS.171.5. [arXiv:1307.7048].
  18. Craig Gidney & Austin G Fowler (2019): Efficient magic state factories with a catalyzed 69640972 CCZ"526930B to 269640972 T"526930B transformation. Quantum 3, pp. 135, doi:10.22331/q-2019-04-30-135. [arXiv:1812.01238].
  19. Google: https://ai.googleblog.com/2018/03/a-preview-of-bristlecone-googles-new.html. Accessed 10/04/2019.
  20. 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.
  21. C. Horsman, A. G Fowler, S. Devitt & R. Van Meter (2012): Surface code quantum computing by lattice surgery. New Journal of Physics 14(12), pp. 123011, doi:10.1088/1367-2630/14/12/123011.
  22. IBM: https://www.research.ibm.com/ibm-q/. Accessed 10/04/2019.
  23. 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). ACM, pp. 559–568, doi:10.1145/3209108.3209131. [arXiv:1705.11151].
  24. 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. [arXiv:1801.10142].
  25. Emmanuel Jeandel, Simon Perdrix & Renaud Vilmart (2019): A Generic Normal Form for ZX-Diagrams and Application to the Rational Angle Completeness. In: Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), doi:10.1109/LICS.2019.8785754. [arXiv:1805.05296].
  26. Aleks Kissinger & Arianne Meijer-van de Griend (2019): CNOT circuit extraction for topologically-constrained quantum memories. [arXiv:1904.00633].
  27. Pieter Kok (2009): Five Lectures on Optical Quantum Computing. Theoretical Foundations of Quantum Information Processing and Communication: Selected Topics 787, pp. 187, doi:10.1007/978-3-642-02871-7_7.
  28. Mehdi Mhalla & Simon Perdrix (2008): Finding Optimal Flows Efficiently. In: International Colloquium on Automata, Languages, and Programming (ICALP'10). Springer Berlin Heidelberg, Berlin, Heidelberg, pp. 857–868, doi:10.1007/978-3-540-70575-8_70. [arXiv:0709.2670].
  29. Simon Perdrix & Luc Sanselme (2017): Determinism and Computational Power of Real Measurement-based Quantum Computation. In: FCT'17- 21st International Symposium on Fundamentals of Computation Theory, Bordeaux, France, pp. 395–408, doi:10.1007/978-3-662-55751-8_31. Available at https://hal.archives-ouvertes.fr/hal-01377339. [arXiv:1610.02824].
  30. Renaud Vilmart (2019): A Near-Optimal Axiomatisation of ZX-Calculus for Pure Qubit Quantum Mechanics. In: Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), doi:10.1109/LICS.2019.8785765. [arXiv:1812.09114].

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org