Access the full text.
Sign up today, get DeepDyve free for 14 days.
M Pollet, M Kerber (2004)
MKM’04
P. Selinger (2007)
Dagger Compact Closed Categories and Completely Positive Maps: (Extended Abstract)
(2006)
Types for Quantum Computation
A Bundy, J Richardson (1999)
Proc. of the 6th LPAR
H. Ehrig, K. Ehrig, Ulrike Prange, G. Taentzer (1992)
Fundamentals of Algebraic Graph Transformation (Monographs in Theoretical Computer Science. An EATCS Series)
D Janssens, G Rozenberg (1983)
Proc. of the 2nd International Workshop on Graph-Grammars and Their Application to Computer Science
S. Abramsky, B. Coecke (2004)
A categorical semantics of quantum protocolsProceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004.
Joachim Kock (2004)
Frobenius Algebras and 2-D Topological Quantum Field Theories
G. Kelly, M. Laplaza (1980)
Coherence for compact closed categoriesJournal of Pure and Applied Algebra, 19
A Asperti, G Longo (1991)
Categories, Types and Structures
A. Schfürr (1997)
Programmed graph replacement systems
AP Sexton, V Sorge (2005)
ICDAR ’05: Proceedings of the Eighth International Conference on Document Analysis and Recognition
P. Shor (1995)
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum ComputerSIAM Rev., 41
PPP Velasco, J Lara (2006)
ICGT
A. Pati, S. Braunstein (1999)
Impossibility of deleting an unknown quantum stateNature, 404
A. Asperti, G. Longo (1991)
Categories, types and structures - an introduction to category theory for the working computer scientist
B Coecke, D Pavlovic (2007)
The Mathematics of Quantum Computation and Technology, CRC Applied Mathematics & Nonlinear Science
B. Coecke, Dusko Pavlovic (2006)
Quantum measurements without sumsarXiv: Quantum Physics
A. Kissinger (2008)
Graph Rewrite Systems for Classical Structures in Dagger−Symmetric Monoidal Categories
R. Prince, Neil Ghani, Conor McBride (2008)
Proving Properties about Lists Using Containers
H. Ehrig, R. Heckel, M. Korff, M. Löwe, L. Ribeiro, Annika Wagner, A. Corradini (1997)
Algebraic Approaches to Graph Transformation - Part II: Single Pushout Approach and Comparison with Double Pushout Approach
S. Abramsky, S. Gay, R. Nagarajan (1996)
Interaction categories and the foundations of typed concurrent programming
R Prince, N Ghani, C McBride (2008)
FLOPS
A. Bundy, J. Richardson (1999)
Proofs About Lists Using Ellipsis
B. Coecke, Ross Duncan (2008)
Interacting Quantum Observables
D. Janssens, G. Rozenberg (1982)
Graph grammars with node-label controlled rewriting and embedding
Lawrence Paulson, T. Nipkow (1994)
Isabelle: A Generic Theorem Prover
S Abramsky, B Coecke (2004)
LICS 2004
B. Coecke (2006)
Kindergarten Quantum Mechanics: Lecture Notes, 810
B. Coecke, É. Paquette (2006)
POVMs and Naimark's Theorem Without Sums
B. Coecke (2005)
Kindergarten Quantum MechanicsarXiv: Quantum Physics
Martin Pollet, V. Sorge, Manfred Kerber (2004)
Intuitive and Formal Representations: The Case of Matrices
W. Wootters, W. Wootters, W. Zurek (1982)
A single quantum cannot be clonedNature, 299
S Abramsky, S Gay, R Nagarajan (1996)
Proceedings of the 1994 Marktoberdorf Summer School on Deductive Program Design
J. Sanderson (1980)
Types and structures
P. Velasco, J. Lara (2006)
Matrix Approach to Graph Transformation: Matching and Sequences
PW Shor (1997)
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computerSIAM J. Sci. Statist. Comput., 26
R Raussendorf, HJ Briegel (2001)
A one-way quantum computerPhys. Rev. Lett., 86
A. Sexton, V. Sorge (2005)
Semantic analysis of matrix structuresEighth International Conference on Document Analysis and Recognition (ICDAR'05)
drop( K , ( G, B G )
Compact closed categories provide a foundational formalism for a variety of important domains, including quantum computation. These categories have a natural visualisation as a form of graphs. We present a formalism for equational reasoning about such graphs and develop this into a generic proof system with a fixed logical kernel for reasoning about compact closed categories. A salient feature of our 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.
Annals of Mathematics and Artificial Intelligence – Springer Journals
Published: Jul 2, 2009
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.