{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:40:03Z","timestamp":1753890003699,"version":"3.41.2"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2019,3,29]],"date-time":"2019-03-29T00:00:00Z","timestamp":1553817600000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2019,3,29]],"date-time":"2019-03-29T00:00:00Z","timestamp":1553817600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2019,3,29]],"date-time":"2019-03-29T00:00:00Z","timestamp":1553817600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"accepted":{"date-parts":[[2025,3,31]]},"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.23638\/lmcs-15(1:32)2019","type":"journal-article","created":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T17:34:29Z","timestamp":1743701669000},"source":"Crossref","is-referenced-by-count":0,"title":["A classical groupoid model for quantum networks"],"prefix":"10.23638","volume":"Volume 15, Issue 1","author":[{"given":"David J.","family":"Reutter","sequence":"first","affiliation":[]},{"given":"Jamie","family":"Vicary","sequence":"additional","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[2019,3,29]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/arxiv.org\/pdf\/1707.00966v4","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/arxiv.org\/pdf\/1707.00966v4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T17:34:30Z","timestamp":1743701670000},"score":1,"resource":{"primary":{"URL":"http:\/\/lmcs.episciences.org\/4029"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3,29]]},"references-count":0,"URL":"https:\/\/doi.org\/10.23638\/lmcs-15(1:32)2019","relation":{"has-preprint":[{"id-type":"arxiv","id":"1707.00966v3","asserted-by":"subject"},{"id-type":"arxiv","id":"1707.00966v2","asserted-by":"subject"},{"id-type":"arxiv","id":"1707.00966v1","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"1707.00966","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1707.00966","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2019,3,29]]},"article-number":"4029"}}