Extending Graphical Representations for Compact Closed Categories with Applications to Symbolic Quantum Computation

Graph-based formalisms of quantum computation provide an abstract and symbolic way to represent and simulate computations. However, manual manipulation of such graphs is slow and error prone. We present a formalism, based on compact closed categories, that supports mechanised reasoning about such graphs. This gives a compositional account of graph rewriting that preserves the underlying categorical semantics. Using this representation, we describe a generic system with a fixed logical kernel that supports reasoning about models of compact closed category. A salient feature of the system is that it provides a formal and declarative account of derived results that can include `ellipses'-style notation. We illustrate the framework by instantiating it for a graphical language of quantum computation and show how this can be used to perform symbolic computation.

[1]  Samson Abramsky,et al.  A categorical semantics of quantum protocols , 2004, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004..

[2]  Ross Duncan,et al.  Types for quantum computing , 2006 .

[3]  Giuseppe Longo,et al.  Categories, types and structures - an introduction to category theory for the working computer scientist , 1991, Foundations of computing.

[4]  G. M. Kelly,et al.  Coherence for compact closed categories , 1980 .

[5]  Bob Coecke,et al.  POVMs and Naimark's Theorem Without Sums , 2006, QPL.

[6]  Andy Schürr,et al.  Programmed Graph Replacement Systems , 1997, Handbook of Graph Grammars.

[7]  W. Wootters,et al.  A single quantum cannot be cloned , 1982, Nature.

[8]  John G. Sanderson.  Types and structures , 1980 .

[9]  Peter Selinger,et al.  Dagger Compact Closed Categories and Completely Positive Maps: (Extended Abstract) , 2007, QPL.

[10]  Hartmut Ehrig,et al.  Handbook of graph grammars and computing by graph transformation: vol. 3: concurrency, parallelism, and distribution , 1999 .

[11]  B. Coecke.  Kindergarten Quantum Mechanics , 2005, quant-ph/0510032.

[12]  Reiko Heckel,et al.  Algebraic Approaches to Graph Transformation - Part II: Single Pushout Approach and Comparison with Double Pushout Approach , 1997, Handbook of Graph Grammars.

[13]  Dusko Pavlovic,et al.  Quantum measurements without sums , 2007 .

[14]  Bob Coecke,et al.  Interacting Quantum Observables , 2008, ICALP.

[15]  S. Braunstein,et al.  Impossibility of deleting an unknown quantum state. , 1999, Nature.

[16]  Grzegorz Rozenberg,et al.  Graph grammars with node-label controlled rewriting and embedding , 1982, Graph-Grammars and Their Application to Computer Science.

[17]  R Raussendorf,et al.  A one-way quantum computer. , 2001, Physical review letters.

[18]  B. Coecke.  Kindergarten Quantum Mechanics: Lecture Notes , 2006 .

[19]  Lawrence Charles Paulson,et al.  Isabelle: A Generic Theorem Prover , 1994 .

[20]  Juan de Lara,et al.  Matrix Approach to Graph Transformation: Matching and Sequences , 2006, ICGT.

[21]  A. Schfürr,et al.  Programmed graph replacement systems , 1997 .

[22]  Peter W. Shor,et al.  Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..