On Strong Converse Bounds for the Private and Quantum Capacities of Anti-degradable Channels

July 21, 2025 Β· Declared Dead Β· πŸ› arXiv.org

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Zahra Baghali Khanian, Christoph Hirche arXiv ID 2507.15661 Category quant-ph: Quantum Computing Cross-listed cs.IT Citations 1 Venue arXiv.org Last Checked 5 months ago
Abstract
We establish a strong converse bound for the private classical capacity of anti-degradable quantum channels. Specifically, we prove that this capacity is zero whenever the error $Ξ΅> 0$ and privacy parameter $Ξ΄> 0$ satisfy the inequality $Ξ΄(1-Ξ΅^2)^{\frac{1}{2}}+Ξ΅(1-Ξ΄^2)^{\frac{1}{2}}<1$. This result strengthens previous understandings by sharply defining the boundary beyond which reliable and private communication is impossible. Furthermore, we present a ``pretty simple'' proof of the ``pretty strong'' converse for the quantum capacity of anti-degradable channels, valid for any error $Ξ΅< \frac{1}{\sqrt{2}}$. Our approach offers clarity and technical simplicity, shedding new light on the fundamental limits of quantum communication.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Quantum Computing

Died the same way β€” πŸ‘» Ghosted