License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CALCO.2017.19
URN: urn:nbn:de:0030-drops-80391
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2017/8039/
Go to the corresponding LIPIcs Volume Portal

Reutter, David ; Vicary, Jamie

A Classical Groupoid Model for Quantum Networks

pdf-format:
LIPIcs-CALCO-2017-19.pdf (0.5 MB)

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.

BibTeX - Entry

@InProceedings{reutter_et_al:LIPIcs:2017:8039,
  author =	{David Reutter and Jamie Vicary},
  title =	{{A Classical Groupoid Model for Quantum Networks}},
  booktitle =	{7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017)},
  pages =	{19:1--19:18},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-033-0},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{72},
  editor =	{Filippo Bonchi and Barbara K{\"o}nig},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2017/8039},
  URN =		{urn:nbn:de:0030-drops-80391},
  doi =		{10.4230/LIPIcs.CALCO.2017.19},
  annote =	{Keywords: groupoids, networks, quantum, semantics, key distribution}
}

Keywords: groupoids, networks, quantum, semantics, key distribution
Collection: 7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017)
Issue Date: 2017
Date of publication: 17.11.2017

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI