A Categorical Quantum Logic
Abstract
We define a strongly normalising proof-net calculus corresponding to the logic of strongly compact closed categories with biproducts. The calculus is a full and faithful representation of the free strongly compact closed category with biproducts on a given category with an involution. This syntax can be used to represent and reason about quantum processes.
- Publication:
-
arXiv e-prints
- Pub Date:
- December 2005
- DOI:
- 10.48550/arXiv.quant-ph/0512114
- arXiv:
- arXiv:quant-ph/0512114
- Bibcode:
- 2005quant.ph.12114A
- Keywords:
-
- Quantum Physics;
- Computer Science - Logic in Computer Science
- E-Print:
- 23 pages, 15 figures