MathDB2 problems
- 0 votes0 replies0 views
Tightness of the achievability bound for entanglement-assisted source coding at high error
Consider the entanglement-assisted source-coding task and the achievability statement in Proposition. Tightness conjecture. The achievability statement in Proposition is also tight…
- 0 votes0 replies0 views
Ancilla-qubit encoding conjecture for classically-enhanced father codes
Consider the classically-enhanced father protocol for a quantum channel, in which classical information may be encoded using ancilla qubits and ebits, and let the trade-off rate tr…