References

  1. S. Abramsky & B. Coecke (2004): A Categorical Semantics of Quantum Protocols. In: Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science: LICS 2004. IEEE Computer Society, pp. 415–425, doi:10.1109/LICS.2004.1319636.
  2. Helle Bechmann-Pasquinucci & Asher Peres (2000): Quantum Cryptography with 3-State Systems. Phys. Rev. Lett. 85(15), pp. 3313–3316, doi:10.1103/PhysRevLett.85.3313.
  3. Charles H. Bennett, Gilles Brassard, Claude Crépeau, Richard Jozsa, Asher Peres & William K. Wootters (1993): Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels. Phys. Rev. Lett. 70(13), pp. 1895–1899, doi:10.1103/PhysRevLett.70.1895.
  4. Mohamed Bourennane, Anders Karlsson & Gunnar Björk (2001): Quantum key distribution using multilevel encoding. Phys. Rev. A 64(1), pp. 012306, doi:10.1103/PhysRevA.64.012306.
  5. D. Bruß & C. Macchiavello (2002): Optimal Eavesdropping in Cryptography with Three-Dimensional Quantum States. Phys. Rev. Lett. 88(12), pp. 127901, doi:10.1103/PhysRevLett.88.127901.
  6. B. Coecke & A. Kissinger (2010): The compositional structure of multipartite quantum entanglement. In: Automata, Languages and Programming 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II, doi:10.1007/978-3-642-14162-1_25.
  7. B. Coecke, D. Pavlovic & J. Vicary (2009): A new description of orthogonal bases. Mathematical Structures in Computer Science. 13 pp., to appear, arXiv:0810.0812.
  8. W. Dür, G. Vidal & J. I. Cirac (2000): Three qubits can be entangled in two inequivalent ways. Phys. Rev. A 62(6), pp. 062314, doi:10.1103/PhysRevA.62.062314.
  9. L. Lamata, J. León, D. Salgado & E. Solano (2006): Inductive classification of multipartite entanglement under stochastic local operations and classical communication. Phys. Rev. A 74(5), pp. 052336, doi:10.1103/PhysRevA.74.052336.
  10. L. Lamata, J. León, D. Salgado & E. Solano (2007): Inductive entanglement classification of four qubits under stochastic local operations and classical communication. Phys. Rev. A 75(2), pp. 022318, doi:10.1103/PhysRevA.75.022318.
  11. Saunders Mac Lane (1998): Categories for the Working Mathematician (Graduate Texts in Mathematics), 2nd edition. Springer.
  12. P. Mathonet, S. Krins, M. Godefroid, L. Lamata, E. Solano & T. Bastin (2010): Entanglement equivalence of N-qubit symmetric states. Phys. Rev. A 81(5), pp. 052315, doi:10.1103/PhysRevA.81.052315.
  13. Michael A. Nielsen & Isaac L. Chuang (2000): Quantum Computation and Quantum Information. Cambridge University Press, doi:10.2277/0521635039.
  14. Shibdas Roy (2010): A Compositional Characterization of Multipartite Quantum States. University of Oxford. Available at http://www.cs.ox.ac.uk/people/bob.coecke/Shibdas.pdf.
  15. Peter Selinger (2004): Towards a quantum programming language. Mathematical Structures in Computer Science 14, pp. 527–586, doi:10.1017/S0960129504004256.
  16. Peter Selinger (2007): Dagger Compact Closed Categories and Completely Positive Maps: (Extended Abstract). Electronic Notes in Theoretical Computer Science 170, pp. 139 – 163, doi:10.1016/j.entcs.2006.12.018. Proceedings of the 3rd International Workshop on Quantum Programming Languages (QPL 2005).
  17. Peter Selinger (2011): A Survey of Graphical Languages for Monoidal Categories. In: Bob Coecke: New Structures for Physics, 1st edition, chapter 4, Lecture Notes in Physics 813. Springer, pp. 289–355, doi:10.1007/978-3-642-12821-9_4.
  18. F. Verstraete, J. Dehaene, B. De Moor & H. Verschelde (2002): Four qubits can be entangled in nine different ways. Phys. Rev. A 65(5), pp. 052112, doi:10.1103/PhysRevA.65.052112.
  19. W. K. Wootters & W. H. Zurek (1982): A single quantum cannot be cloned. Nature 299(5886), pp. 802–803, doi:10.1038/299802a0.
  20. Xin-Gang Yang, Zhi-Xi Wang, Xiao-Hong Wang & Shao-Ming Fei (2008): Classification of Bipartite and Tripartite Qutrit Entanglement under SLOCC. Communications in Theoretical Physics 50(3), pp. 651–654, doi:10.1088/0253-6102/50/3/25.

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