A random-coding based proof for the quantum coding theorem
classification
🪐 quant-ph
keywords
proofquantumchannelcodingtheoremchosenclassicalclose
read the original abstract
We present a proof for the quantum channel coding theorem which relies on the fact that a randomly chosen code space typically is highly suitable for quantum error correction. In this sense, the proof is close to Shannon's original treatment of information transmission via a noisy classical channel.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.