A Classical Groupoid Model for Quantum Networks

David Reutter, Jamie Vicary

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.
Original languageEnglish
Title of host publicationProceedings of the 7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017)
EditorsFilippo Bonchi, Barbara König
PublisherSchloss Dagstuhl
Pages19:1-19:18
Number of pages18
ISBN (Electronic)9783959770330
DOIs
Publication statusPublished - 2 Nov 2017
Event7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017) - Ljubljana, Slovenia
Duration: 13 Jun 201716 Jun 2017

Publication series

NameLeibniz International Proceedings in Informatics (LIPIcs)
PublisherSchloss Dagstuhl--Leibniz-Zentrum fuer Informatik
Volume72
ISSN (Electronic)1868-8969

Conference

Conference7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017)
Country/TerritorySlovenia
CityLjubljana
Period13/06/1716/06/17

Keywords

  • groupoids
  • networks
  • quantum
  • semantics
  • key distribution

Fingerprint

Dive into the research topics of 'A Classical Groupoid Model for Quantum Networks'. Together they form a unique fingerprint.

Cite this