Random coding exponents galore via decoupling

April 27, 2015 Β· Declared Dead Β· πŸ› arXiv.org

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Naresh Sharma arXiv ID 1504.07075 Category quant-ph: Quantum Computing Cross-listed cs.IT Citations 5 Venue arXiv.org Last Checked 5 months ago
Abstract
A missing piece in quantum information theory, with very few exceptions, has been to provide the random coding exponents for quantum information-processing protocols. We remedy the situation by providing these exponents for a variety of protocols including those at the top of the family tree of protocols. Our line of attack is to provide an exponential bound on the decoupling error for a restricted class of completely positive maps where a key term in the exponent is in terms of a RΓ©nyi Ξ±-information-theoretic quantity for any Ξ±$\in$ (1,2]. Among the protocols covered are fully quantum Slepian-Wolf, quantum state merging, quantum state redistribution, quantum/classical communication across channels with side information at the transmitter with or without entanglement assistance, and quantum communication across broadcast channels.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Quantum Computing

Died the same way β€” πŸ‘» Ghosted