Fetching the paper…
Reading the bibliography…
A fundamental tool to prove inner bounds in classical network information theory is the so-called conditional joint typicality lemma.
A mathematical theory of communication
C. Shannon · 1948
Earlier work this paper cites.
Bounds for the quantity of information transmitted by a quantum communication channel
A. Holevo · 1973
Earlier work this paper cites.
Optimal multiple quantum statistical hypothesis testing
V. Belavkin · 1975
Earlier work this paper cites.
Quantum theory, the Church-Turing principle and the universal quantum computer
D. Deutsch · 1985
Earlier work this paper cites.
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
P Shor · 1997
Earlier work this paper cites.
Sending classical information via noisy quantum channels
B. Schumacher and M. Westmoreland · 1997
Earlier work this paper cites.
The capacity of the quantum channel with general signal states
A. Holevo · 1998
Earlier work this paper cites.
The capacity of the quantum multiple-access channel
A. Winter · 2001
Earlier work this paper cites.
General formulas for capacity of classical-quantum channels
M. Hayashi and H. Nagaoka · 2003
Earlier work this paper cites.
Entanglement-assisted capacity of quantum multiple-access channels
M-H. Hsieh, I. Devetak, and A. Winter · 2008
Earlier work this paper cites.
The quantum capacity of channels with arbitrarily correlated noise
F. Buscemi and N. Datta · 2010
Cited alongside, same era.
Multiparty quantum protocols for assisted entanglement distillation
N. Dutil · 2011
Cited alongside, same era.
One-shot rates for entanglement manipulation under non-entangling maps
F. Brandão and N. Datta · 2011
Cited alongside, same era.
Network Information Theory
A. El Gamal and Y-H. Kim · 2012
Cited alongside, same era.
One-shot classical-quantum capacity and hypothesis testing
L. Wang and R. Renner · 2012
Cited alongside, same era.
Achieving the Han-Kobayashi inner bound for the quantum interference channel
On composite quantum hypothesis testing
M. Berta, Brandão, F., and C. Hirche · 2017
Later among the works it cites.
Sequential measurements, disturbance and property testing
A. Harrow, C. Lin, and A. Montanaro · 2017
Later among the works it cites.
Inner bounds via simultaneous decoding in quantum network information theory
P. Sen · 2018
Closest in time.
Applications of position-based coding to classical communication over quantum channels
H. Qi, Q. Wang, and M. Wilde · 2018
Closest in time.
A generalized quantum Slepian–Wolf
A. Anshu, R. Jain, and N. Warsi · 2018
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
P. Sen · 2012
Cited alongside, same era.
Classical communication over a quantum interference channel
O. Fawzi, P. Hayden, I. Savov, P. Sen, and M. Wilde · 2012
Cited alongside, same era.
Sequential, successive, and simultaneous decoders for entanglement-assisted classical communication
S.C. Xu and M. Wilde · 2013
Cited alongside, same era.
On simultaneous min-entropy smoothing
L. Drescher and O. Fawzi · 2013
Cited alongside, same era.
Quantum union bounds for sequential projective measurements
J. Gao · 2015
Cited alongside, same era.
Union bound for quantum information processing
S. Oskouei, S. Mancini, and M. Wilde · 2019
Closest in time.
A hypothesis testing approach for communication over entanglement-assisted compound quantum channel
A. Anshu, R. Jain, and N. Warsi · 2019
Closest in time.
On the near-optimality of one-shot classical communication over quantum channels
A. Anshu, R. Jain, and N. Warsi · 2019
Closest in time.
Building blocks for communication over noisy quantum networks
A. Anshu, R. Jain, and N. Warsi · 2019
Closest in time.