2 citations · 2 across the 17 of their papers we have counts for
Showing 2026 · quant-phShow all
3 papers · 2 filters
quant-ph2026
Optimal Average Success Probabilities of Binary and Quantum Random Access Codes
Shuo Tan, Syed A. Jafar
A binary quantum random access code (QRAC) compresses an -bit classical string into an -qubit quantum state, from which a decoder attempts to recover a randomly selec…
quant-ph2026
Quantum Entanglement Assistance Improves the Capacity and Activates the Zero-Error Capacity of Classical Channels with Causal CSIT
Yuhang Yao, Syed A. Jafar
For classical point-to-point channels, it has been shown by Bennett et al. that quantum entanglement assistance cannot improve their capacity, and by Cubitt et al. that entanglemen…
quant-ph2026
Space-sharing and Singleton Bounds for Entanglement-assisted Classical Coding
Yuhang Yao, Tushita Prasad, Markus Grassl +2
Recent work has noted that a space-sharing argument proves the tightness of the entropic quantum Singleton bounds, which was left open in the literature for various settings involv…