Error correction, authentication, and false acceptance, probabilities for communication over noisy quantum channels: converse upper bounds on the bit transmission rate

Abstract:We obtain strict upper bounds on the bit transmission rate for communication of Classical bit codewords over Quantum channels. Albeit previous arguments in arXiv: 1804.01797 which have demonstrated that lower bounds can be shown to hold for the bit transmission rate without the presence of significant noise over the channel shared by Alice and Bob for the purposes of encoding, decoding, transmission and authentication, the author suggests that upper bounding the bit transmission rate could be of use towards classifying paradoxical aspects of communication protocols, as well as constructing error correcting codes which are resilient to noise. The upper bound that is obtained in this work for the bit transmission rate, as a converse result, is dependent upon the natural logarithm of the size of each player's alphabet, as well as smaller alphabets, which can be leveraged for simultaneously realizing Quantum advantage for maximizing error correction and minimizing false acceptance. Crucially, the upper bound to the bit transmission rate is dependent upon a pruning procedure, which seeks to determine whether letters from player's alphabets can be removed so that prospective Quantum advantage, in order for Alice and Bob to implement error correction protocols with high probability, despite the fact that there is more noise over the channel between Alice and Bob in comparison to that between Bob and Eve.

Template (85 pages). A 4-series presentation is at: this https URL. Related topics of discussion are at: this https URL, this https URL, this https URL

Quantum Physics (quant-ph); Information Theory (cs.IT); Probability (math.PR)

arXiv:2507.03035 [quant-ph]

(or arXiv:2507.03035v2 [quant-ph] for this version)