Fetching the paper…
Reading the bibliography…
We show that the communication cost of quantum broadcast channel simulation under free entanglement assistance between the sender and the receivers is asymptotically characterized by an efficiently computable single-letter formula in terms of the channel's multipartite mutual information.
C. E. Shannon, “A mathematical theory of communication,”
1948
Earlier work this paper cites.
J. Von Neumann, “Various techniques used in connection with random digits,” in
1951
Earlier work this paper cites.
W. McGill, “Multivariate information transmission,”
1954
Earlier work this paper cites.
S. Watanabe, “Information theoretical analysis of multivariate correlation,”
1960
Earlier work this paper cites.
R. T. Rockafellar,
1970
Earlier work this paper cites.
T. Cover, “Broadcast channels,”
1972
Earlier work this paper cites.
P. Gács and J. Körner, “Common information is far less than mutual information,”
1973
Earlier work this paper cites.
N. Dutil and P. Hayden, “One-shot multiparty state merging,” 2010. [Online]. Available:
1974
Earlier work this paper cites.
A. D. Wyner, “On source coding with side information at the decoder,”
1975
Earlier work this paper cites.
A. Wyner, “The common information of two dependent random variables,”
1975
Earlier work this paper cites.
J. Bergh and J. Löfström,
1976
Earlier work this paper cites.
A. E. Gamal and E. van der Meulen, “A proof of Marton’s coding theorem for the discrete memoryless broadcast channel (corresp.),”
1979
Earlier work this paper cites.
M. S. P. S. I. Gel’fand, “Capacity of a broadcast channel with one deterministic component,”
1980
Earlier work this paper cites.
D. Petz, “Quasi-entropies for finite quantum systems,”
1986
Earlier work this paper cites.
J. Körner, “The concept of single-letterization in information theory,” in
1987
Earlier work this paper cites.
R. Ahlswede and G. Dueck, “Identification via channels,”
1989
Earlier work this paper cites.
T. Han and S. Verdu, “Approximation theory of output statistics,”
1993
Earlier work this paper cites.
T. S. Han and S. Verdú, “Spectrum invariancy under output approximation full-rank discrete memoryless channels,”
1993
Earlier work this paper cites.
P. M. Gruber and J. M. Wills,
1993
Earlier work this paper cites.
Y. Steinberg and S. Verdú, “Channel simulation and coding with side information,”
1994
Earlier work this paper cites.
Y. Steinberg and S. Verdú, “Simulation of random processes and rate-distortion theory,”
1996
Earlier work this paper cites.
T. Cover, “Comments on broadcast channels,”
1998
Earlier work this paper cites.
C. P. Robert, G. Casella, and G. Casella,
1999
Earlier work this paper cites.
A. Winter, “Coding theorems of quantum information theory,”
1999
Earlier work this paper cites.
C. Bennett, P. Shor, J. Smolin, and A. Thapliyal, “Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem,”
2002
Earlier work this paper cites.
A. S. Holevo, “On entanglement-assisted classical capacity,”
2002
Earlier work this paper cites.
A. Winter, “Compression of sources of probability distributions and density operators,” 2002. [Online]. Available:
2002
Earlier work this paper cites.
R. Ahlswede and A. Winter, “Strong converse for identification via quantum channels,”
2002
Earlier work this paper cites.
M. Horodecki, K. Horodecki, P. Horodecki, R. Horodecki, J. Oppenheim, A. Sen(De), and U. Sen, “Local information as a resource in distributed quantum systems,”
2003
Earlier work this paper cites.
R. Jain, J. Radhakrishnan, and P. Sen, “A direct sum theorem in communication complexity via message compression,” in
2003
Earlier work this paper cites.
V. Paulsen,
2003
Earlier work this paper cites.
M. Junge and Q. Xu, “Noncommutative Burkholder/Rosenthal inequalities,”
2003
Earlier work this paper cites.
M. Horodecki, P. Horodecki, R. Horodecki, J. Oppenheim, A. Sen(De), U. Sen, and B. Synak-Radtke, “Local versus nonlocal information in quantum-information theory: Formalism and phenomena,”
2005
Earlier work this paper cites.
I. Devetak, “Distillation of local purity from quantum states,”
2005
Earlier work this paper cites.
M. Horodecki, J. Oppenheim, and A. Winter, “Partial quantum information,”
2005
Earlier work this paper cites.
A. Winter, “Identification via quantum channels in the presence of prior correlation and feedback,” in
2006
Cited alongside, same era.
H. Krovi and I. Devetak, “Local purity distillation with bounded classical communication,”
2007
Cited alongside, same era.
Y. Liang and G. Kramer, “Rate regions for relay broadcast channels,”
2007
Cited alongside, same era.
P. Hayden and F. Dupuis. (2007) A reverse Shannon theorem for quantum broadcast channels. [Online]. Available:
2007
Cited alongside, same era.
——, “Quantum state merging and negative information,”
2007
Cited alongside, same era.
P. Cuff, “Communication requirements for generating correlated random variables,” in
2008
Cited alongside, same era.
F. Haddadpour, M. H. Yassaee, S. Beigi, A. Gohari, and M. R. Aref, “Simulation of a channel with another channel,”
2016
Later among the works it cites.
M. B. Parizi, E. Telatar, and N. Merhav, “Exact random coding secrecy exponents for the wiretap channel,”
2016
Later among the works it cites.
M. Hayashi and R. Matsumoto, “Secure multiplex coding with dependent and non-uniform multiple messages,”
2016
Later among the works it cites.
M. Tomamichel,
2016
Later among the works it cites.
M. Hayashi and S. Watanabe, “Uniform random number generation from Markov chains: Non-asymptotic and asymptotic analyses,”
2016
Later among the works it cites.
A. Anshu, R. Jain, and N. A. Warsi, “A unified approach to source and message compression,”
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
I. Devetak, A. W. Harrow, and A. J. Winter, “A resource framework for quantum Shannon theory,”
2008
Cited alongside, same era.
Y. Liang, G. Kramer, and H. V. Poor, “Equivalence of two inner bounds on the capacity region of the broadcast channel,” in
2008
Cited alongside, same era.
Z. Luo and I. Devetak, “Channel simulation with quantum side information,”
2009
Cited alongside, same era.
M. Christandl, R. König, and R. Renner, “Postselection technique for quantum channels with applications to quantum cryptography,”
2009
Cited alongside, same era.
A. Abeyesinghe, I. Devetak, P. Hayden, and A. Winter, “The mother of all protocols: restructuring quantum informations family tree,”
2009
Cited alongside, same era.
M. A. Nielsen and I. L. Chuang,
2009
Cited alongside, same era.
2017
Later among the works it cites.
H.-C. Cheng and M.-H. Hsieh, “Moderate deviation analysis for classical-quantum channels and quantum hypothesis testing,”
2017
Later among the works it cites.
A. Anshu, V. K. Devabathini, and R. Jain, “Quantum communication using coherent rejection sampling,”
2017
Later among the works it cites.
S. Watanabe and M. Hayashi, “Finite-length analysis on tail probability for markov chain and application to simple hypothesis testing,”
2017
Later among the works it cites.
2017
Later among the works it cites.
L. Yu and V. Y. F. Tan, “Rényi resolvability and its applications to the wiretap channel,”
2018
Later among the works it cites.
A. Anshu, R. Jain, and N. A. Warsi, “Building blocks for communication over noisy quantum networks,”
2018
Later among the works it cites.
H.-C. Cheng, “Error exponent analysis in quantum information theory,”
2018
Later among the works it cites.
2018
Later among the works it cites.
M. Sudan, H. Tyagi, and S. Watanabe, “Communication for generating correlation: A unifying survey,”
2019
Later among the works it cites.
S. Yagli and P. Cuff, “Exact exponent for soft covering,”
2019
Later among the works it cites.
K. Fang, X. Wang, M. Tomamichel, and M. Berta, “Quantum channel simulation and the channel’s smooth max-information,”
2019
Later among the works it cites.
A. Anshu, M. Berta, R. Jain, and M. Tomamichel, “A minimax approach to one-shot entropy inequalities,”
2019
Later among the works it cites.
D. Ding, H. Gharibyan, P. Hayden, and M. Walter, “A quantum multiparty packing lemma and the relay channel,”
2019
Later among the works it cites.
H.-C. Cheng, M.-H. Hsieh, and M. Tomamichel, “Quantum sphere-packing bounds with polynomial prefactors,”
2019
Later among the works it cites.
S. Khatri and M. M. Wilde, “Principles of quantum communication theory: A modern approach,”
2020
Later among the works it cites.
K. Li and Y. Yao, “Reliable simulation of quantum channels,”
2021
Later among the works it cites.
H.-C. Cheng, N. Dattaand, and C. Rouźe, “Strong converse bounds in quantum network information theory,”
2021
Later among the works it cites.
F. Dupuis, “Privacy amplification and decoupling without smoothing,” 2021. [Online]. Available:
2021
Later among the works it cites.
P. Sen, “Unions, intersections and a one-shot quantum joint typicality lemma,”
2021
Later among the works it cites.
2021
Later among the works it cites.
H.-C. Cheng and L. Gao, “Error exponent and strong converse for quantum soft covering,”
2022
Later among the works it cites.
2022
Later among the works it cites.
C. T. Li, “First-order theory of probabilistic independence and single-letter characterizations of capacity regions,” in
2022
Later among the works it cites.
2022
Later among the works it cites.
H.-C. Cheng, L. Gao, and M.-H. Hsieh, “Properties of noncommutative rényi and Augustin information,”
2022
Later among the works it cites.
N. Ramakrishnan, M. Tomamichel, and M. Berta, “Moderate deviation expansion for fully quantum tasks,”
2023
Closest in time.
N. Ramakrishnan, “Communication tasks in quantum information,” 2023, Ph.D. Thesis, Department of Computing, Imperial College London
2023
Closest in time.
2023
Closest in time.