The paper asserts a converse upper bound on the bit transmission rate in terms of pruned alphabet sizes, but the proof is a chain of unjustified inequalities and the main theorem reverses the inequality of the result it relies on.
classical two way communication in xor games
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 1years
2025 1verdicts
REJECT 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Error correction, authentication, and false acceptance, probabilities for communication over noisy quantum channels: converse upper bounds on the bit transmission rate
The paper asserts a converse upper bound on the bit transmission rate in terms of pruned alphabet sizes, but the proof is a chain of unjustified inequalities and the main theorem reverses the inequality of the result it relies on.