2020/01/31 by Kabgyun Jeong
Computer Science · Engineering · Mathematics · Physics and Astronomy · #Amplitude damping channel #Channel (broadcasting) #Channel capacity #Classical capacity #Computer science #Conditional quantum entropy #Entropy (arrow of time) #Gaussian #Mathematical analysis #Mathematics #Physics #Quantum #Quantum Information and Cryptography #Quantum capacity #Quantum channel #Quantum discord #Quantum entanglement #Quantum information #Quantum mechanics #Quantum network #Quantum relative entropy #Statistical physics #Telecommunications #Upper and lower bounds #Wireless Communication Security Techniques #quant-ph
paper · pdf · doi:10.1016/j.physleta.2020.126730
published as Phys. Lett. A 384, 126730 (2020) · 7 pages, 2 figures
openalex publication_date 2020/07/13 · arxiv created 2020/07/16 · arxiv updated 2020/07/17 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
Recently, there have been considerable progresses on the bounds of various quantum channel capacities for bosonic Gaussian channels. Especially, several upper bounds for the classical capacity and the quantum capacity on the bosonic Gaussian channels, via a technique known as quantum entropy power inequality, have been shed light on understanding the mysterious quantum-channel-capacity problems. However, upper bounds for the private capacity on quantum channels are still missing for the study on certain universal upper bounds. Here, we derive upper bounds on the private capacity for bosonic Gaussian channels involving a general Gaussian-noise case through the conditional quantum entropy power inequality.