A Classical Groupoid Model for Quantum Networks

David Reutter; Jamie Vicary

doi:10.4230/LIPIcs.CALCO.2017.19

A Classical Groupoid Model for Quantum Networks

David Reutter
, Jamie Vicary

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 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
Publisher	Schloss Dagstuhl
Pages	19:1-19:18
Number of pages	18
ISBN (Electronic)	9783959770330
DOIs	https://doi.org/10.4230/LIPIcs.CALCO.2017.19
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/Territory	Slovenia
City	Ljubljana
Period	13/06/17 → 16/06/17

Keywords

groupoids
networks
quantum
semantics
key distribution

Access to Document

10.4230/LIPIcs.CALCO.2017.19Licence: Creative Commons: Attribution (CC BY)

Cite this

@inproceedings{0ee24c8283294e99b16f7745c82e95e2,

title = "A Classical Groupoid Model for Quantum Networks",

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.",

keywords = "groupoids, networks, quantum, semantics, key distribution ",

author = "David Reutter and Jamie Vicary",

year = "2017",

month = nov,

day = "2",

doi = "10.4230/LIPIcs.CALCO.2017.19",

language = "English",

series = "Leibniz International Proceedings in Informatics (LIPIcs)",

publisher = "Schloss Dagstuhl",

pages = "19:1--19:18",

editor = "Filippo Bonchi and Barbara K{\"o}nig",

booktitle = "Proceedings of the 7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017)",

address = "Germany",

note = "7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017) ; Conference date: 13-06-2017 Through 16-06-2017",

}

Reutter, D & Vicary, J 2017, A Classical Groupoid Model for Quantum Networks. in F Bonchi & B König (eds), Proceedings of the 7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017). Leibniz International Proceedings in Informatics (LIPIcs), vol. 72, Schloss Dagstuhl, pp. 19:1-19:18, 7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017), Ljubljana, Slovenia, 13/06/17. https://doi.org/10.4230/LIPIcs.CALCO.2017.19

A Classical Groupoid Model for Quantum Networks. / Reutter, David; Vicary, Jamie.
Proceedings of the 7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017). ed. / Filippo Bonchi; Barbara König. Schloss Dagstuhl, 2017. p. 19:1-19:18 (Leibniz International Proceedings in Informatics (LIPIcs); Vol. 72).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - A Classical Groupoid Model for Quantum Networks

AU - Reutter, David

AU - Vicary, Jamie

PY - 2017/11/2

Y1 - 2017/11/2

N2 - 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.

AB - 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.

KW - groupoids

KW - networks

KW - quantum

KW - semantics

KW - key distribution

UR - https://www.scopus.com/pages/publications/85037069637

U2 - 10.4230/LIPIcs.CALCO.2017.19

DO - 10.4230/LIPIcs.CALCO.2017.19

M3 - Conference contribution

T3 - Leibniz International Proceedings in Informatics (LIPIcs)

SP - 19:1-19:18

BT - Proceedings of the 7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017)

A2 - Bonchi, Filippo

A2 - König, Barbara

PB - Schloss Dagstuhl

T2 - 7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017)

Y2 - 13 June 2017 through 16 June 2017

ER -

A Classical Groupoid Model for Quantum Networks

Abstract

Publication series

Conference

Keywords

Access to Document

Fingerprint

Cite this