Expected Communication Cost of Distributed Quantum Tasks
A central question in the classical information theory is that of source compression, which is the task where Alice receives a sample from a known probability distribution and needs to transmit it to the receiver Bob with small error. This problem has a one-shot solution due to Huffman, in which the...
Main Authors: | Anshu, Anurag, Garg, Ankit, Harrow, Aram W., Yao, Penghui |
---|---|
Other Authors: | Massachusetts Institute of Technology. Center for Theoretical Physics |
Format: | Article |
Published: |
Institute of Electrical and Electronics Engineers (IEEE)
2020
|
Online Access: | https://hdl.handle.net/1721.1/124013 |
Similar Items
-
Lower Bound on Expected Communication Cost of Quantum Huffman Coding
by: Anshu, Anurag, et al.
Published: (2017) -
Separating quantum communication and approximate rank
by: Anshu, Anurag, et al.
Published: (2018) -
Universality of EPR pairs in entanglement-assisted communication complexity, and the communication cost of state conversion
by: Harrow, Aram W.
Published: (2020) -
Applications of coherent classical communication and the Schur transform to quantum information theory
by: Harrow, Aram (Aram Wettroth), 1980-
Published: (2006) -
Quantum blackjack: Advantages offered by quantum strategies in communication-limited games
by: Lin, Joseph X, et al.
Published: (2022)