Paper Info
Title
Graphical reasoning in compact closed categories for quantum computation
Abstract
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.
Year
DOI
Venue
2009
10.1007/s10472-009-9141-x
Annals of Mathematics and Artificial Intelligence
Keywords
DocType
Volume
Graph rewriting,Quantum computing,Categorical logic,Interactive theorem proving,Graphical calculi,Ellipses notation,03G30,18C10,03G12,05C20,81P68
Journal
56
Issue
ISSN
Citations 
1
1012-2443
15
PageRank 
References 
Authors
1.53
10
2
Name
Order
Citations
PageRank
Lucas Dixon1182390.35
Ross Duncan222619.91