Quantum linear network coding as one-way quantum computation

Abstract

Network coding is a technique to maximize communication rates within a network, in communication protocols for simultaneous multi-party transmission of information. Linear network codes are examples of such protocols in which the local computations performed at the nodes in the network are limited to linear transformations of their input data (represented as elements of a ring, such as the integers modulo 2). The quantum linear network coding protocols of Kobayashi et al [arXiv:0908.1457 and arXiv:1012.4583] coherently simulate classical linear network codes, using supplemental classical communication. We demonstrate that these protocols correspond in a natural way to measurement-based quantum computations with graph states over over qudits [arXiv:quant-ph/0301052, arXiv:quant-ph/0603226, and arXiv:0704.1263] having a structure directly related to the network.

17 pages, 6 figures. Updated to correct an incorrect (albeit hilarious) reference in the arXiv version of the abstract

References in corpus (5)

• Computational power of correlations
• Prior entanglement between senders enables perfect quantum network coding with modification
• Generalized Flow and Determinism in Measurement-based Quantum Computation
• Information Flow in Secret Sharing Protocols
• Closed timelike curves in measurement-based quantum computation

Cited by in corpus (1)

• Increasing the classical data throughput in quantum networks by combining quantum linear network coding with superdense coding