A Categorical Quantum Logic
Quantum Physics
2013-06-20 v1 Logic in Computer Science
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.
Cite
@article{arxiv.quant-ph/0512114,
title = {A Categorical Quantum Logic},
author = {Samson Abramsky and Ross Duncan},
journal= {arXiv preprint arXiv:quant-ph/0512114},
year = {2013}
}
Comments
23 pages, 15 figures; presented at QPL 2004