Random Coding Bound for the Reliability Function in Quantum Channel: General Case
Vladimir Blinovsky
TL;DR
This paper completes the proof of a conjecture, enabling the derivation of the random coding bound for the reliability function in quantum channels with arbitrary signal states.
Contribution
It provides a complete proof of a conjecture crucial for deriving the random coding bound in quantum information theory.
Findings
Proof of the conjecture completed
Derivation of the random coding bound finalized
Applicable to quantum channels with arbitrary signal states
Abstract
We complete the proof of conjecture, which allows to complete the derivation of the random coding bound for the reliability function in quantum channel in the case of arbitrary signal states
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsWireless Communication Security Techniques · Quantum Computing Algorithms and Architecture · advanced mathematical theories