3 problems
- 0 votes0 replies0 views
Burnashev–Holevo random-coding error exponent conjecture for classical–quantum channels
Let be an input alphabet, let be an output quantum system, and let be a classical–quantum channel. For an input distribut…
- 0 votes0 replies0 views
Holevo's random-coding exponent conjecture for classical-quantum channels
Let a classical-quantum channel map each input symbol to an arbitrary, possibly mixed, quantum state, and consider random i.i.d. codes generated according to a fixed input distribu…
- 0 votes0 replies1 view
List-decoding interpretation of umlaut information for CQ channels
Let be a classical-quantum channel, and let denote its unassisted zero-rate list-decoding error exponent with list size . Let…