Upper bounds on secret-key agreement over lossy thermal bosonic channels

2017/06/30 by Eneet Kaur, Mark M. Wilde · 34 citations
Computer Science · Mathematics · Physics and Astronomy · #Channel (broadcasting) #Classical capacity #Combinatorics #Computer science #Computer security #Key (lock) #Lossy compression #Mathematics #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum capacity #Quantum channel #Quantum entanglement #Quantum key distribution #Quantum mechanics #Quantum network #Telecommunications #Topology (electrical circuits) #Upper and lower bounds #quant-ph

paper · pdf · doi:10.1103/physreva.96.062318

published in Physical Review A 96(6) (American Physical Society) · 16 pages, 1 figure, minor changes

arxiv created 2017/09/28 · openalex publication_date 2017/12/19 · arxiv updated 2018/03/13 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05

Abstract

Upper bounds on the secret-key-agreement capacity of a quantum channel serve as a way to assess the performance of practical quantum-key-distribution protocols conducted over that channel. In particular, if a protocol employs a quantum repeater, achieving secret-key rates exceeding these upper bounds is evidence of having a working quantum repeater. In this paper, we extend a recent advance [Liuzzo-Scorpo et al., Phys. Rev. Lett. 119, 120503 (2017)] in the theory of the teleportation simulation of single-mode phase-insensitive Gaussian channels such that it now applies to the relative entropy of entanglement measure. As a consequence of this extension, we find tighter upper bounds on the nonasymptotic secret-key-agreement capacity of the lossy thermal bosonic channel than were previously known. The lossy thermal bosonic channel serves as a more realistic model of communication than the pure-loss bosonic channel, because it can model the effects of eavesdropper tampering and imperfect detectors. An implication of our result is that the previously known upper bounds on the secret-key-agreement capacity of the thermal channel are too pessimistic for the practical finite-size regime in which the channel is used a finite number of times, and so it should now be somewhat easier to witness a working quantum repeater when using secret-key-agreement capacity upper bounds as a benchmark.

Citations

• Optimal continuous variable quantum teleportation with limited resources
• On the absolute constants in the Berry-Esseen type inequalities for identically distributed summands
• Gaussian measures of entanglement versus negativities: Ordering of two-mode Gaussian states
• Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
• On the Upper Bound for the Absolute Constant in the Berry–Esseen Inequality
• Multiplicativity of Completely Bounded p-Norms Implies a New Additivity Result
• Quantum cryptography: Public key distribution and coin tossing
• Completely positive maps and entropy inequalities
• Quantum cryptography based on Bell’s theorem
• Quantum states with Einstein-Podolsky-Rosen correlations admitting a hidden-variable model
• Controlling excess noise in fiber-optics continuous-variable quantum key distribution
• Inseparability Criterion for Continuous Variable Systems
• Channel Coding Rate in the Finite Blocklength Regime
• All teleportation and dense coding schemes
• Teleportation of Continuous Quantum Variables
• Peres-Horodecki Separability Criterion for Continuous Variable Systems
• Tight finite-key analysis for quantum cryptography
• Unconstrained Capacities of Quantum Key Distribution and Entanglement Distillation for Pure-Loss Bosonic Broadcast Channels
• Quantum entanglement

Cited by

• Second Law of Entanglement Dynamics for the Non-Asymptotic Regime
• Simulation of Gaussian channels via teleportation and error correction of Gaussian states