Fetching the paper…
Reading the bibliography…
We derive upper bounds on the rate of transmission of classical information over quantum channels by block codes with a given blocklength and error probability, for both entanglement-assisted and unassisted codes, in terms of a unifying framework of quantum hypothesis testing with restricted measurements.
Bounds for the quantity of information transmitted by a quantum communication channel
A.S. Holevo · 1973
Earlier work this paper cites.
Semidefinite programming
L. Vandenberghe and S. Boyd · 1996
Earlier work this paper cites.
Sending classical information via noisy quantum channels
B. Schumacher and M. D. Westmoreland · 1997
Earlier work this paper cites.
von neumann capacity of noisy quantum channels
C. Adami and N. J. Cerf · 1997
Earlier work this paper cites.
Unconditionally secure quantum bit commitment is impossible
D. Mayers · 1997
Earlier work this paper cites.
The capacity of the quantum channel with general signal states
A.S. Holevo · 1998
Earlier work this paper cites.
Why quantum bit commitment and ideal quantum coin tossing are impossible
H-K. Lo and H.F. Chau · 1998
Earlier work this paper cites.
Rigorous treatment of distillable entanglement
E. M. Rains · 1999
Earlier work this paper cites.
Capacity of quantum gaussian channels
A. S. Holevo, M. Sohma, and O. Hirota · 1999
Earlier work this paper cites.
A semidefinite program for distillable entanglement
E.M. Rains · 2001
Earlier work this paper cites.
Optimal signal ensembles
Benjamin Schumacher and Michael D. Westmoreland · 2001
Cited alongside, same era.
Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem
C. H. Bennett, P. W. Shor, J. A. Smolin, and A. V. Thapliyal · 2002
Cited alongside, same era.
Construction of extremal local positive-operator-valued measures under symmetry
S. Virmani and M. B. Plenio · 2003
Cited alongside, same era.
Quantum Information: An Information
Masahito Hayashi · 2006
Cited alongside, same era.
Generalized relative entropies and the capacity of classical-quantum channels
M. Milan and N. Datta · 2009
Cited alongside, same era.
A strong converse for classical channel coding using entangled inputs
R. König and S. Wehner · 2009
Cited alongside, same era.
Strong converse capacities of quantum channels for classical information
N. Datta, M. Mosonyi, M-H. Hsieh, and F. G. S. L. Brandao · 2011
Later among the works it cites.
One-shot classical-quantum capacity and hypothesis testing
L. Wang and R. Renner · 2012
Closest in time.
A linear program for the finite block length converse of Polyanskiy, Poor, Verdú via nonsignaling codes
W. Matthews · 2012
Closest in time.
Unconditional security from noisy quantum storage
R. König, S. Wehner, and J. Wullschleger · 2012
Closest in time.
Entanglement cost of quantum channels
M. Berta, M. Christandl, F.G.S.L. Brandao, and S. Wehner · 2012
Closest in time.
Quantum to classical randomness extractors
M. Berta, O. Fawzi, and S. Wehner · 2012
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Channel coding rate in the finite blocklength regime
Y. Polyanskiy, H. V. Poor, and S. Verdú · 2010
Cited alongside, same era.
Arimoto channel coding converse and Rényi divergence
Y. Polyanskiy and S. Verdú · 2010
Cited alongside, same era.
Noisy channel coding via privacy amplification and information reconciliation
J.M. Renes and R. Renner · 2011
Cited alongside, same era.
One-shot entanglement-assisted quantum and classical communication
N. Datta and M.-H. Hsieh · 2011
Cited alongside, same era.
Experimental implementation of bit commitment in the noisy-storage model
N. Ng, S. Joshi, C. Chia, C. Kurtsiefer, and S. Wehner · 2012
Closest in time.
Saddle point in the minimax converse for channel coding
Y. Polyanskiy · 2013
Closest in time.
Fundamental bound on the reliability of quantum information transmission
Naresh Sharma and Naqueeb Ahmad Warsi · 2013
Closest in time.
An experimental implementation of oblivious transfer in the noisy storage model
C. Erven, N. Ng, N. Gigov, R. Laflamme, S. Wehner, and G. Weihs · 2014
Closest in time.