References

  1. Miriam 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. Available at http://stacks.iop.org/1367-2630/16/i=9/a=093021.
  2. Miriam Backens (2014): The ZX-calculus is complete for the single-qubit Clifford+T group. In: Proceedings of the 11th workshop on Quantum Physics and Logic (QPL 2014), EPTCS 172, pp. 293–303, doi:10.4204/EPTCS.172.21.
  3. 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.
  4. Miriam Backens, Simon Perdrix & Quanlong Wang (2016): A Simplified Stabilizer ZX-calculus. In: R. Duncan & C. Heunen: Proceedings 13th International Conference on Quantum Physics and Logic (QPL 2016), Electronic Proceedings in Theoretical Computer Science 236, pp. 1–20, doi:10.4204/EPTCS.236.1.
  5. Adriano Barenco, Charles H. Bennett, Richard Cleve, David P. DiVincenzo, Norman Margolus, Peter Shor, Tycho Sleator, John A. Smolin & Harald Weinfurter (1995): Elementary gates for quantum computation. Phys. Rev. A 52, pp. 3457–3467, doi:10.1103/PhysRevA.52.3457.
  6. S. Bravyi & A Kitaev (2005): Universal Quantum Computation with ideal Clifford gates and noisy ancillas. Phys. Rev. A 71(022316), doi:10.1103/PhysRevA.71.022316.
  7. Earl T. Campbell (2016): The smallest interesting colour code. Blog post. Available at https://earltcampbell.com/2016/09/26/the-smallest-interesting-colour-code/.
  8. Earl T. Campbell & Mark Howard (2017): Unified framework for magic state distillation and multiqubit gate synthesis with reduced resource cost. Phys. Rev. A 95, pp. 022316, doi:10.1103/PhysRevA.95.022316. Available at https://link.aps.org/doi/10.1103/PhysRevA.95.022316.
  9. Earl T. Campbell & Mark Howard (2017): Unifying gate-synthesis and magic state distillation. Phys. Rev. Lett. 118(6), doi:10.1103/PhysRevLett.118.060501.
  10. Nicholas Chancellor, Aleks Kissinger, Stefan Zohren & Dominic Horsman (2016): Coherent Parity Check Construction for Quantum Error Correction. arXiv.org preprint arXiv:1611.08012.
  11. Bob Coecke & Ross Duncan (2008): Interacting Quantum Observables. In: L. Aceto, I. Damgård, L. A. Goldberg, M. M. Halldórsson, A Ingólfsdóttir & I. Walukiewic: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part II, Lecture Notes in Computer Science 5126. Springer, pp. 298–310, doi:10.1007/978-3-540-70583-3_25.
  12. Bob Coecke & Ross Duncan (2011): Interacting Quantum Observables: Categorical Algebra and Diagrammatics. New J. Phys 13(043016), doi:10.1088/1367-2630/13/4/043016. Available at http://iopscience.iop.org/1367-2630/13/4/043016/.
  13. Bob Coecke, Ross Duncan, Aleks Kissinger & Quanlong Wang (2015): Generalised Compositional Theories and Diagrammatic Reasoning. In: G. Chirabella & R. Spekkens: Quantum Theory: Informational Foundations and Foils. Springer, doi:10.1007/978-94-017-7303-4_10.
  14. Ross Duncan & Kevin Dunne (2016): Interacting Frobenius Algebras are Hopf. In: Martin Grohe, Eric Koskinen & Natarajan Shankar: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, LICS '16, New York, NY, USA, July 5-8, 2016, LICS '16. ACM, pp. 535–544, doi:10.1145/2933575.2934550.
  15. Ross Duncan & Maxime Lucas (2014): Verifying the Steane code with Quantomatic. In: Bob Coecke & Matty Hoban: Proceedings 10th International Workshop on Quantum Physics and Logic (QPL 2013), Electronic Proceedings in Theoretical Computer Science 171, pp. 33–49, doi:10.4204/EPTCS.171.4.
  16. Ross Duncan & Simon Perdrix (2009): Graph States and the necessity of Euler Decomposition. In: K. Ambos-Spies, B. Löwe & W. Merkle: Computability in Europe: Mathematical Theory and Computational Practice (CiE'09), Lecture Notes in Computer Science 5635. Springer, pp. 167–177, doi:10.1007/978-3-642-03073-4.
  17. Ross Duncan & Simon Perdrix (2014): Pivoting makes the ZX-calculus complete for real stabilizers. In: Bob Coecke & Matty Hoban: Proceedings 10th International Workshop on Quantum Physics and Logic, Castelldefels (Barcelona), Spain, 17th to 19th July 2013, Electronic Proceedings in Theoretical Computer Science 171. Open Publishing Association, pp. 50–62, doi:10.4204/EPTCS.171.5.
  18. Thomas Häner, Damian S. Steiger, Krysta Svore & Matthias Troyer (2016): A Software Methodology for Compiling Quantum Programs. Quantum Science and Technology, doi:10.1088/2058-9565/aaa5cc.
  19. A. Kissinger, L. Dixon, R. Duncan, B. Frot, A. Merry, D. Quick, M. Soloviev & V. Zamdzhiev: Quantomatic. Available at https://sites.google.com/site/quantomatic/.
  20. 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 (DCM 2012), Cambridge, United Kingdom, 17 June 2012, Electronic Proceedings in Theoretical Computer Science 143, pp. 54–66., doi:10.4204/EPTCS.143.5.
  21. Aleks Kissinger & David Quick (2014): Tensors, !-graphs, and non-commutative quantum structures. In: Bob Coecke, Ichiro Hasuo & Prakash Panangaden: Proceedings of QPL 2014, Electronic Proceedings in Theoretical Computer Science 172, pp. 56–67, doi:10.4204/EPTCS.172.5.
  22. Aleks Kissinger & David Quick (2015): A First-Order Logic for String Diagrams. In: Lawrence S. Moss & Pawel Sobocinski: 6th Conference on Algebra and Coalgebra in Computer Science (CALCO 2015), Leibniz International Proceedings in Informatics (LIPIcs) 35. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, pp. 171–189, doi:10.4230/LIPIcs.CALCO.2015.171.
  23. Aleks Kissinger & Pawel Sobocinski (2014): Notes on Graphical Normalisation. Personal correspondence.
  24. Aleks Kissinger & Vladimir Zamdzhiev (2015): Quantomatic: A Proof Assistant for Diagrammatic Reasoning. In: P. Amy Felty & Aart Middeldorp: Automated Deduction - CADE-25: 25th International Conference on Automated Deduction, Berlin, Germany, August 1-7, 2015, Proceedings. Springer, pp. 326–336, doi:10.1007/978-3-319-21401-6_22.
  25. Stephen Lack (2004): Composing PROPs. Theory and Applications of Categories 13(9), pp. 147–163.
  26. Joe O'Gorman & Earl T. Campbell (2017): Quantum computation with realistic magic-state factories. Phys. Rev. A 95, pp. 032338, doi:10.1103/PhysRevA.95.032338. Available at https://link.aps.org/doi/10.1103/PhysRevA.95.032338.
  27. Simon Perdrix & Quanlong Wang (2016): Supplementarity is Necessary for Quantum Diagram Reasoning. In: Piotr Faliszewski, Anca Muscholl & Rolf Niedermeier: 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016), Leibniz International Proceedings in Informatics (LIPIcs) 58. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, pp. 76:1–76:14, doi:10.4230/LIPIcs.MFCS.2016.76. Available at http://drops.dagstuhl.de/opus/volltexte/2016/6506.
  28. David Quick (2015): !-Logic. Oxford University.
  29. Peter Selinger & Xiaoning Bian (2016): Relations for 2-qubit Clifford+T operator group. Talk slides.

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