Exploring the limitations of quantum networking through butterfly-based networks

Kieran N. Wilkinson, Thomas Cope, Stefano Pirandola

Published Mar 6, 2020• 2 citations

Abstract

We investigate the classical and quantum networking regimes of the butterfly network and a group of larger networks constructed with butterfly network blocks. By considering simultaneous multicasts from a set of senders to a set of receivers, we analyze the corresponding rates for transmitting classical and quantum information through the networks. More precisely, we compare achievable rates (i.e., lower bounds) for classical communication with upper bounds for quantum communication, quantifying the performance gap between the rates for networks connected by identity, depolarizing and erasure channels. For each network considered, we observe a range over which the classical rate non-trivially exceeds the quantum capacity. We find that, by adding butterfly blocks in parallel, the difference between transmitted bits and qubits can be increased up to one extra bit per receiver in the case of perfect transmission (identity channels). Our aim is to provide a quantitative analysis of those network configurations which are particularly disadvantageous for quantum networking, when compared to classical communication. By clarifying the performance of these 'negative cases', we also provide some guidance on how quantum networks should be built.

Related papers

Exploring the Limitations of Quantum Networking through Butterfly‐Based Networks

Kieran N. Wilkinson, Thomas P. W. Cope, Stefano Pirandola

Abstract The classical and quantum networking regimes of the butterfly network and a group of larger networks constructed with butterfly network blocks are investigated. By considering simultaneous multicasts from a set of senders to a set of receivers, the corresponding rates for transmitting classical and quantum information through the networks are analyzed. More precisely, achievable rates (i.e., lower bounds) for classical communication are compared with upper bounds for quantum communication, quantifying the performance gap between the rates for networks connected by identity, depolarizing, and erasure channels. For each network considered, a range is observed over which the classical rate non‐trivially exceeds the quantum capacity. It is found that, by adding butterfly blocks in parallel, the difference between transmitted bits and qubits can be increased up to one extra bit per receiver in the case of perfect transmission (identity channels). The aim is to provide a quantitative analysis of those network configurations which are particularly disadvantageous for quantum networking, when compared to classical communication. By clarifying the performance of these “negative cases,” some guidance on how quantum networks should be built is also provided.

arXiv:1909.02342Advanced Quantum TechnologiesDec 9, 20192 citations

Quantum Network Communication—The Butterfly and Beyond

Debbie Leung, Jonathan Oppenheim, Andreas Winter

We study the problem ofk-pair communication (or multiple unicast problem) of quantum information in networks of quantum channels. We consider the asymptotic rates of high fidelity quantum communication between specific sender-receiver pairs. Four scenarios of classical communication assistance (none, forward, backward, and two-way) are considered. (I) We obtain outer and inner bounds of the achievable rate regions in the most general directed networks. (II) For two particular networks (including the butterfly network), routing is proved optimal, and the free assisting classical communication can at best be used to modify the directions of quantum channels in the network. Consequently, the achievable rate regions are given by counting edge avoiding paths, and precise achievable rate regions in all four assisting scenarios can be obtained. (III) Optimality of routing can also be proved in classes of networks. The first class consists of directed unassisted networks in which (1) the receivers are information sinks, (2) the maximum distance from senders to receivers is small, and (3) a certain type of 4-cycles are absent, but without further constraints (such as on the number of communicating and intermediate parties). The second class consists of arbitrary backward-assisted networks with two sender-receiver pairs. (IV) Beyond thek-pair communication problem, observations are made on quantum multicasting and a static version of network communication related to the entanglement of assistance.

arXiv:quant-ph/0608223IEEE Transactions on Information TheoryJun 23, 2010141 citations

Bounds for multi-end communication over quantum networks

Stefano Pirandola

Abstract Quantum and private communications are affected by a fundamental limitation which severely restricts the optimal rates that are achievable by two distant parties. To overcome this problem, one needs to introduce quantum repeaters and, more generally, quantum communication networks. Within a quantum network, other problems and features may appear when we move from the basic unicast setting of single-sender/single-receiver to more complex multiend scenarios, where multiple senders and multiple receivers simultaneously use the network to communicate. Assuming various configurations, including multiple-unicast, multicast, and multiple-multicast communication, we bound the optimal rates for transmitting quantum information, distributing entanglement, or generating secret keys in quantum networks connected by arbitrary quantum channels. These bounds cannot be surpassed by the most general adaptive protocols of quantum network communication.

arXiv:1905.12677Quantum Science and TechnologySep 24, 201955 citations

Prior entanglement between senders enables perfect quantum network coding with modification

Masahito Hayashi

We find a protocol transmitting two quantum states crossly in the butterfly network only with prior entanglement between two senders. This protocol requires only one qubit transmission or two classical bits (cbits) transmission in each channel in the butterfly network. It is also proved that it is impossible without prior entanglement. More precisely, an upper bound of average fidelity is given in the butterfly network when prior entanglement is not allowed. The presented result concerns only the butterfly network, but our techniques can be applied to a more general graph.

arXiv:0706.0197Physical Review AOct 10, 2007138 citations

Analysing and reducing the limitations of continuous-variable quantum cryptography and quantum networks

Kieran N. Wilkinson

Due to a recent influx of attention, the field of quantum information is rapidly progressing towards the point at which quantum technologies move from the laboratory to widespread community use. However, several difficulties must be overcome before this milestone can be achieved. Two such difficulties are addressed in this thesis. The first is the ever-growing security threat posed by quantum computers to existing cryptographic protocols and the second is the missing knowledge regarding the performance differences between quantum and classical communications over various existing network topologies. Continuous-variable (CV) quantum key distribution (QKD) poses a practical solution to the security risks implied by the advancement of quantum information theory, with the promise of provably secure communications. Unfortunately, the maximum range of many CV-QKD protocols is limited. Here, this limitation is addressed by the application of post-selection, firstly, to a scenario in which two parties communicate using terahertz frequency radiation in the atmosphere, and secondly, to measurement-device-independent QKD, in which two parties communicate through the medium of an untrusted relay. In both cases, the introduction of post-selection enables security over distances substantially exceeding those of equivalent existing protocols. The second difficulty is addressed by a comparison of the quantum and classical networking regimes of the butterfly network and a group of networks constructed with butterfly blocks. By computing the achievable classical rates and upper bounds for quantum communication, the performance difference between the two regimes is quantified, and a range of conditions is established under which classical networking outperforms its quantum counterpart. This allows for guidance to be provided on which network structures should be avoided when constructing a quantum internet.

Jan 1, 20200 citations

General Scheme for Perfect Quantum Network Coding with Free Classical Communication

Hirotada Kobayashi, François Le, Gall Harumichi +1 more

This paper considers the problem of efficiently transmitting quantum states through a network. It has been known for some time that without additional assumptions it is impossible to achieve this task perfectly in general — indeed, it is impossible even for the simple butterfly network. As additional resource we allow free classical communication between any pair of network nodes. It is shown that perfect quantum network coding is achievable in this model whenever classical network coding is possible over the same network when replacing all quantum capacities by classical capacities. More precisely, it is proved that perfect quantum network coding using free classical communication is possible over a network with k source-target pairs if there exists a classical linear (or even vector-linear) coding scheme over a finite ring. Our proof is constructive in that we give explicit quantum coding operations for each network node. This paper also gives an upper bound on the number of classical communication required in terms of k, the maximal fan-in of any network node, and the size of the network. x1 x2 s1 ♠ s2 ♠ ❍❍❍❍ ❥ x1 x2 ✟ n1 x1 x1 ⊕ x2 x2 n2 ♠ x1 ⊕ x2✟ ❍❍❍❍ ❥ x1 ⊕ x2

Jan 1, 200957 citations