Quantum Capacity of Partially Corrupted Quantum Network
Abstract
We discuss a quantum network, in which the sender has m0 outgoing channels, the receiver has m0 incoming channels, each channel is of capacity d, each intermediate node applies invertible unitary, only m1 channels are corrupted, and other non-corrupted channels are noiseless. As our result, we show that the quantum capacity is not smaller than (m0-2m1+1) d under the following two settings. In the first case, the unitaries on intermediate nodes are arbitrary and the corruptions on the m1 channels are individual. In the second case, the unitaries on intermediate nodes are restricted to Clifford operations and the corruptions on the m1 channels are adaptive, i.e., the attacker is allowed to have a quantum memory. Further, our code in the second case realizes the noiseless communication even with the single-shot setting and is constructed dependently only on the network topology and the places of the m1 corrupted channels while this result holds regardless of the network topology and the places.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.