Computer Science – Logic in Computer Science
Scientific paper
2008-11-13
LMCS 4 (4:9) 2008
Computer Science
Logic in Computer Science
26 pages
Scientific paper
10.2168/LMCS-4(4:9)2008
Compact categories have lately seen renewed interest via applications to quantum physics. Being essentially finite-dimensional, they cannot accomodate (co)limit-based constructions. For example, they cannot capture protocols such as quantum key distribution, that rely on the law of large numbers. To overcome this limitation, we introduce the notion of a compactly accessible category, relying on the extra structure of a factorisation system. This notion allows for infinite dimension while retaining key properties of compact categories: the main technical result is that the choice-of-duals functor on the compact part extends canonically to the whole compactly accessible category. As an example, we model a quantum key distribution protocol and prove its correctness categorically.
No associations
LandOfFree
Compactly accessible categories and quantum key distribution does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Compactly accessible categories and quantum key distribution, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Compactly accessible categories and quantum key distribution will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-435814