Relative Entropy Bounds on Quantum, Private and Repeater Capacities

Abstract

We find a strong-converse bound on the private capacity of a quantum channel assisted by unlimited two-way classical communication. The bound is based on the max-relative entropy of entanglement and its proof uses a new inequality for the sandwiched Rényi divergences based on complex interpolation techniques. We provide explicit examples of quantum channels where our bound improves both the transposition bound (on the quantum capacity assisted by classical communication) and the bound based on the squashed entanglement introduced by Takeoka et al.. As an application we study a repeater version of the private capacity assisted by classical communication and provide an example of a quantum channel with negligible private repeater capacity.

25 pages, 2 figures, added appendix

References in corpus (1)

• Unitary designs and codes

Cited by in corpus (53)

• Advances in Quantum Cryptography
• Quantum repeaters: From quantum networks to the quantum internet
• Quantifying the magic of quantum channels
• Amortized Channel Divergence for Asymptotic Quantum Channel Discrimination
• Tools for quantum network design
• Universal Limitations on Quantum Key Distribution over a Network
• Principles of Quantum Communication Theory: A Modern Approach
• Practical figures of merit and thresholds for entanglement distribution in quantum networks
• Semidefinite programming strong converse bounds for classical capacity
• Parameter regimes for a single sequential quantum repeater
• Narrow Bounds for the Quantum Capacity of Thermal Attenuators
• Aggregating quantum repeaters for the quantum internet
• Fundamental limitations on distillation of quantum channel resources
• Entanglement cost and quantum channel simulation
• Semidefinite programming converse bounds for quantum communication
• Fundamental limitation on quantum broadcast networks
• Fundamental limits on the capacities of bipartite quantum interactions
• Amortized entanglement of a quantum channel and approximately teleportation-simulable channels
• Entanglement and secret-key-agreement capacities of bipartite quantum interactions and read-only memory devices
• Upper bounds on secret key agreement over lossy thermal bosonic channels
• Versatile relative entropy bounds for quantum networks
• Amortization does not enhance the max-Rains information of a quantum channel
• Defining quantum divergences via convex optimization
• Fast and reliable entanglement distribution with quantum repeaters: principles for improving protocols using reinforcement learning
• Energy-constrained two-way assisted private and quantum capacities of quantum channels
• Upper bounds on device-independent quantum key distribution
• Pursuing the fundamental limits for quantum communication
• Resource theory of unextendibility and non-asymptotic quantum capacity
• Finite-resource teleportation stretching for continuous-variable systems
• Capacity Estimates via comparison with TRO channels
• Strong and uniform convergence in the teleportation simulation of bosonic Gaussian channels
• Private states, quantum data hiding and the swapping of perfect secrecy
• On the design and analysis of near-term quantum network protocols using Markov decision processes
• ReQuSim: Faithfully simulating near-term quantum repeaters
• Resonant Multilevel Amplitude Damping Channels
• Necessary criterion for approximate recoverability
• Absolutely covert quantum communication
• Exact entanglement cost of quantum states and channels under PPT-preserving operations
• Geometric Rényi Divergence and its Applications in Quantum Channel Capacities
• Divergence and Sufficiency for Convex Optimization
• Maximum Entropy and Sufficiency
• Parameter regimes for surpassing the PLOB bound with error-corrected qudit repeaters
• Upper bounds on the private capacity for bosonic Gaussian channels
• Computable lower bounds on the entanglement cost of quantum channels
• Limitations of variational quantum algorithms: a quantum optimal transport approach
• The squashed entanglement of the noiseless quantum Gaussian attenuator and amplifier
• Beating the repeaterless bound with adaptive measurement-device-independent quantum key distribution
• Entropy Bound for the Classical Capacity of a Quantum Channel Assisted by Classical Feedback
• Information-theoretic aspects of the generalized amplitude damping channel
• Chain rules for quantum channels
• Quantum Information on Spectral Sets
• Limitations for private randomness repeaters
• Information storage and transmission under Markovian noise