A classical groupoid model for quantum networks

DOI10.23638/LMCS-15(1:32)2019MaRDI QIDQ5376647zbMATH OpenFDO

Authors David Reutter, Jamie Vicary

Publication date 17 May 2019

Full work available at URL https://arxiv.org/abs/1707.00966

zbMATH Keywords

groupoidskey distributionnetworksquantumsemantics

Mathematics Subject Classification ID

Sets with a single binary operation (groupoids) (20N02) Network design and communication in computer systems (68M10) Network protocols (68M12) Quantum computation (81P68)

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.

Recommendations

• A classical groupoid model for quantum networks
• Quantum linear network coding as one-way quantum computation
• Quantum computational networks
• Classical representations of qubit channels
• General Scheme for Perfect Quantum Network Coding with Free Classical Communication

Cited in

(2)

• A classical groupoid model for quantum networks
• scientific article; zbMATH DE number 7327933 (Why is no real title available?)

This page was built for publication: A classical groupoid model for quantum networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5376647)