Fetching the paper…
Reading the bibliography…
Achievability in information theory refers to demonstrating a coding strategy that accomplishes a prescribed performance benchmark for the underlying task.
1912
Earlier work this paper cites.
C. E. Shannon, “A mathematical theory of communication,”
1948
Earlier work this paper cites.
A. Feinstein, “A new basic theorem of information theory,”
1954
Earlier work this paper cites.
H. Umegaki, “Conditional expectation in an operator algebra, I,”
1954
Earlier work this paper cites.
A. Feinstein, “Error bounds in noisy channels without memory,”
1955
Earlier work this paper cites.
H. Chernoff, “Large-sample theory: Parametric case,”
1956
Earlier work this paper cites.
——, “Conditional expectation in an operator algebra, II,”
1956
Earlier work this paper cites.
——, “Conditional expectation in an operator algebra, III.”
1959
Earlier work this paper cites.
R. M. Fano,
1961
Earlier work this paper cites.
V. Strassen, “Asymptotische abschätzungen in Shannon’s informations theorie,”
1962
Earlier work this paper cites.
R. G. Gallager,
1963
Earlier work this paper cites.
C. W. Helstrom, “Detection theory and quantum mechanics,”
1967
Earlier work this paper cites.
I. Csiszár and G. Longo, “On the error exponent for source coding and for testing simple statistical hypotheses,”
1971
Earlier work this paper cites.
A. S. Holevo, “The analogue of statistical decision theory in the noncommutative probability theory,”
1972
Earlier work this paper cites.
A. S. Holevo, “Remarks on optimal quantum measurements,”
1974
Earlier work this paper cites.
H. P. Yuen, R. S. Kennedy, and M. Lax, “Optimum testing of multiple hypotheses in quantum detection theory,”
1975
Earlier work this paper cites.
V. P. Belavkin, “Optimal multiple quantum statistical hypothesis testing,”
1975
Earlier work this paper cites.
S. Arimoto, “Computation of random coding exponent functions,”
1976
Earlier work this paper cites.
——, “Investigations in the general theory of statistical decisions,” in
1978
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.
T. Ando, “Concavity of certain maps on positive definite matrices and applications to Hadamard products,”
1979
Earlier work this paper cites.
S. I. Gel’fand and M. S. Pinsker, “Coding for channel with random parameters,” pp. 19–31, 1980
1980
Earlier work this paper cites.
F. Kubo and T. Ando, “Means of positive linear operators,”
1980
Earlier work this paper cites.
D. Petz, “Quasi-entropies for finite quantum systems,”
1986
Earlier work this paper cites.
1991
Earlier work this paper cites.
C. H. Bennett and S. J. Wiesner, “Communication via one- and two-particle operators on Einstein–Podolsky–Rosen states,”
1992
Earlier work this paper cites.
C. H. Bennett, G. Brassard, C. Crépeau, R. Jozsa, A. Peres, and W. K. Wootters, “Teleporting an unknown quantum state via dual classical and Einstein–Podolsky–Rosen channels,”
1993
Earlier work this paper cites.
R. Jozsa and B. Schumacher, “A new proof of the quantum noiseless coding theorem,”
1994
Earlier work this paper cites.
S. Verdu and T. S. Han, “A general formula for channel capacity,”
1994
Earlier work this paper cites.
B. Schumacher and M. D. Westmoreland, “Sending classical information via noisy quantum channels,”
1997
Earlier work this paper cites.
A. Holevo, “The capacity of the quantum channel with general signal states,”
1998
Earlier work this paper cites.
M. V. Burnashev and A. S. Holevo, “On the reliability function for a quantum communication channel,”
1998
Earlier work this paper cites.
A. Winter, “Coding theorem and strong converse for quantum channels,”
1999
Earlier work this paper cites.
——, “Coding theorems of quantum information theory,”
1999
Earlier work this paper cites.
T. Ogawa and H. Nagaoka, “Strong converse to the quantum channel coding theorem,”
1999
Earlier work this paper cites.
C. H. Bennett, P. W. Shor, J. A. Smolin, and A. V. Thapliyal, “Entanglement-assisted classical capacity of noisy quantum channels,”
1999
Earlier work this paper cites.
T. Ogawa and H. Nagaoka, “Strong converse and Stein’s lemma in quantum hypothesis testing,”
2000
Earlier work this paper cites.
A. Winter, “The capacity of the quantum multiple-access channel,”
2001
Earlier work this paper cites.
R. Ahlswede and A. Winter, “Strong converse for identification via quantum channels,”
2002
Earlier work this paper cites.
A. S. Holevo, “On entanglement-assisted classical capacity,”
2002
Earlier work this paper cites.
H. Barnum and E. Knill, “Reversing quantum dynamics with near-optimal quantum and classical fidelity,”
2002
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.
T. S. Han,
2003
Earlier work this paper cites.
M. Hayashi and H. Nagaoka, “General formulas for capacity of classical-quantum channels,”
2003
Earlier work this paper cites.
I. Devetak and A. Winter, “Classical data compression with quantum side information,”
2003
Cited alongside, same era.
R. Renner, “Security of quantum key distribution,”
2005
Cited alongside, same era.
K. Yanagi, K. Kuriyama, and S. Furuichi, “Generalized Shannon inequalities based on Tsallis relative operator entropy,”
2005
Cited alongside, same era.
Z. Luo and I. Devetak, “Channel simulation with quantum side information,”
2006
Cited alongside, same era.
I. Sason and S. Shamai,
2006
Cited alongside, same era.
S. Aaronson, “QMA/qpoly Is Contained In PSPACE/poly: De-Merlinizing quantum protocols,” in
2006
Cited alongside, same era.
K. M. Audenaert, “Comparisons between quantum state distinguishability measures,”
2014
Later among the works it cites.
Y. Altuģ and A. B. Wagner, “The third-order term in the normal approximation for singular channels,” in
2014
Later among the works it cites.
W. Matthews and S. Wehner, “Finite blocklength converse bounds for quantum channels,”
2014
Later among the works it cites.
N. Datta and F. Leditzky, “Second-order asymptotics for source coding, dense coding, and pure-state entanglement conversions,”
2014
Later among the works it cites.
F. Hiai and D. Petz,
2014
Later among the works it cites.
——, “Quantum wiretap channel with non-uniform random number and its exponent and equivocation rate of leaked information,”
2015
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
H. Nagaoka and M. Hayashi, “An information-spectrum approach to classical and quantum hypothesis testing for simple hypotheses,”
2006
Cited alongside, same era.
K. M. R. Audenaert, J. Calsamiglia, R. Muñoz-Tapia, E. Bagan, L. Masanes, A. Acin, and F. Verstraete, “Discriminating states: The quantum Chernoff bound,”
2007
Cited alongside, same era.
M. Hayashi, “Error exponent in asymmetric quantum hypothesis testing and its application to classical-quantum channel coding,”
2007
Cited alongside, same era.
R. G. Gallager,
2008
Cited alongside, same era.
T. Richardson and R. Urbanke,
2008
Cited alongside, same era.
M.-H. Hsieh, I. Devetak, and A. Winter, “Entanglement-assisted capacity of quantum multiple-access channels,”
2008
Cited alongside, same era.
Later among the works it cites.
J. Gao, “Quantum union bounds for sequential projective measurements,”
2015
Later among the works it cites.
T. Ogawa, “An information-spectrum approach to hash properties for quantum states and relation to channel coding,” in
2015
Later among the works it cites.
I. Savov and M. M. Wilde, “Classical codes for quantum broadcast channels,”
2015
Later among the works it cites.
M. Tomamichel,
2016
Later among the works it cites.
K. Li, “Discriminating quantum states: The multiple Chernoff distance,”
2016
Later among the works it cites.
J. Radhakrishnan, P. Sen, and N. Warsi, “One-shot Marton inner bound for classical-quantum broadcast channel,”
2016
Later among the works it cites.
M. M. Wilde,
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.
A. Lapidoth,
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. Serafini,
2017
Later among the works it cites.
M. M. Wilde, “Position-based coding and convex splitting for private communication over quantum channels,”
2017
Later among the works it cites.
M. Dalai and A. Winter, “Constant conpositions in the sphere packing bound for classical-quantum channels,”
2017
Later among the works it cites.
2017
Later among the works it cites.
Q. Wang, S. Das, and M. M. Wilde, “Hadamard quantum broadcast channels,”
2017
Later among the works it cites.
J. M. Renes, “Better bounds on optimal measurement and entanglement recovery, with applications to uncertainty and monogamy relations,”
2017
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.
S. Khabbazi Oskouei, S. Mancini, and M. M. Wilde, “Union bound for quantum information processing,”
2018
Later among the works it cites.
J. Watrous,
2018
Later among the works it cites.
H.-C. Cheng, “Error exponent analysis in quantum information theory,”
2018
Later among the works it cites.
H.-C. Cheng, E. P. Hanson, N. Datta, and M.-H. Hsieh, “Duality between source coding with quantum side information and classical-quantum channel coding,”
2018
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.
H.-C. Cheng, L. Gao, and M.-H. Hsieh, “Properties of scaled noncommutative Rényi and augustin information,” in
2019
Later among the works it cites.
——, “Divergence radii and the strong converse exponent of classical-quantum channel coding with constant compositions,”
2020
Later among the works it cites.
H.-C. Cheng, E. P. Hanson, N. Datta, and M.-H. Hsieh, “Non-asymptotic classical data compression with quantum side informations,”
2020
Later among the works it cites.
F. Dupuis, “Privacy amplification and decoupling without smoothing,”
2021
Later among the works it cites.
K. Li and Y. Yao, “Reliability function of quantum information decoupling,”
2021
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.
H.-C. Cheng and L. Gao, “Error exponent and strong converse for quantum soft covering,”
2022
Closest in time.
——, “Optimal second-order rates for quantum soft covering and privacy amplification,”
2022
Closest in time.
K. Li, Y. Yao, and M. Hayashi, “Tight exponential analysis for smoothing the max-relative entropy and for quantum privacy amplification,”
2022
Closest in time.
2022
Closest in time.
A. Gilyén, S. Lloyd, I. Marvian, Y. Quek, and M. M. Wilde, “Quantum algorithm for Petz recovery channels and pretty good measurements,”
2022
Closest in time.
2022
Closest in time.
B. Huang, S. Jiang, Z. Song, R. Tao, and R. Zhang, “Solving SDP faster: A robust IPM framework and efficient implementation,”
2022
Closest in time.
2022
Closest in time.