A Classical Groupoid Model for Quantum Networks
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
Authors
Colleges, School and Institutes
External organisations
- University of Oxford
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.
networks, including teleportation, dense coding and secure key distribution.
Details
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the 7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017) |
| Editors | Filippo Bonchi, Barbara König |
| Publication status | Published - 2 Nov 2017 |
| Event | 7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017) - Ljubljana, Slovenia Duration: 13 Jun 2017 → 16 Jun 2017 |
Publication series
| Name | Leibniz International Proceedings in Informatics (LIPIcs) |
|---|---|
| Publisher | Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik |
| Volume | 72 |
| ISSN (Electronic) | 1868-8969 |
Conference
| Conference | 7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017) |
|---|---|
| Country | Slovenia |
| City | Ljubljana |
| Period | 13/06/17 → 16/06/17 |
Keywords
- groupoids, networks, quantum, semantics, key distribution