A categorical quantum logic
ABRAMSKY, SAMSON; DUNCAN, ROSS; ABRAMSKY SAMSON; Oxford University Computing Laboratory; DUNCAN ROSS; Oxford University Computing Laboratory
Журнал:
Mathematical Structures in Computer Science
Дата:
2006
Аннотация:
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.
198.1Кб