The BSC-PSC bound for sandwiched Rényi conditional entropy
The BSC-PSC bound for sandwiched Rényi conditional entropy
Let be binary random variables with quantum side information , let denote their respective classical–quantum states, and let be their sum modulo two in the product state . Write
Here is the binary Rényi entropy and its inverse on the relevant interval, while denotes binary convolution. The BSC-PSC bound. For ,
For , the same statement holds with replaced by ; for , equality holds. If true, the bounds are tight, with equality achieved by binary symmetric and pure-state channels, but their validity for general remains unresolved.
Sources & referencesView supporting material
Primary source
Christoph Hirche, Xinyue Guan and Marco Tomamichel, “Chain Rules for Renyi Information Combining”, arXiv:2305.02589 (2023).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.