A classical groupoid model for quantum networks
arXiv:1707.00966 · doi:10.23638/LMCS-15(1:32)2019
Abstract
We give a mathematical analysis of a new type of classical computer network architecture, intended as a model of a new technology that has recently been proposed in industry. Our approach is based on groubits, generalizations of classical bits based on groupoids. This network architecture allows the direct execution of a number of protocols that are usually associated with quantum networks, including teleportation, dense coding and secure key distribution.
References in corpus (14)
- In defense of the epistemic view of quantum states: a toy theory
- Planar algebras, I
- Phase groups and the origin of non-locality for qubits
- The classification of subfactors of index at most 5
- Categorical formulation of quantum algebras
- Modular categories as representations of the 3-dimensional bordism 2-category
- Biunitary constructions in quantum information
- A higher category approach to twisted actions on C*-algebras
- Mixed quantum states in higher categories
- Higher Quantum Theory
- Quantum Protocols within Spekkens' Toy Model
- Categorified Algebra and Quantum Mechanics
- Using quantum key distribution for cryptographic purposes: a survey
- Groupoid Semantics for Thermal Computing