Fetching the paper…
Reading the bibliography…
The capacity of noisy quantum channels characterizes the highest rate at which information can be reliably transmitted and it is therefore of practical as well as fundamental importance.
“A mathematical theory of communication”
C. E. Shannon · 1948
Earlier work this paper cites.
“An algorithm for computing the capacity of arbitrary discrete memoryless channels”
S. Arimoto · 1972
Earlier work this paper cites.
“Computation of channel capacity and rate-distortion functions”
R. Blahut · 1972
Earlier work this paper cites.
“Capacity of the noisy quantum channel”
S. Lloyd · 1997
Earlier work this paper cites.
“Sending classical information via noisy quantum channels”
B. Schumacher and M. D. Westmoreland · 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.
“Algorithms of Arimoto-Blahut type for computing quantum channel capacity”
H. Nagaoka · 1998
Earlier work this paper cites.
“Monotone Riemannian metrics and relative entropy on noncommutative probability spaces”
A. Lesniewski and M. B. Ruskai · 1999
Earlier work this paper cites.
“The information bottleneck method”
N. Tishby, F. C. Pereira, and W. Bialek · 1999
Earlier work this paper cites.
“Numerical Experiments on The Capacity of Quantum Channel with Entangled Input States”
S. Osawa and H. Nagaoka · 2001
Earlier work this paper cites.
“The capacity of the quantum multiple-access channel”
A. Winter · 2001
Earlier work this paper cites.
“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
Earlier work this paper cites.
“The quantum channel capacity and coherent information”
P. W. Shor · 2002
Earlier work this paper cites.
“Capacities of quantum channels and how to find them”
P. W. Shor · 2003
Earlier work this paper cites.
“A generalized Blahut-Arimoto algorithm”
P. O. Vontobel · 2003
Earlier work this paper cites.
“Isotropic quantum spin channels and additivity questions”
R. Alicki · 2004
Earlier work this paper cites.
Convex optimization
S. Boyd and L. Vandenberghe · 2004
Earlier work this paper cites.
“YALMIP : A Toolbox for Modeling and Optimization in MATLAB”
J. Löfberg · 2004
Cited alongside, same era.
“Information geometric formulation and interpretation of accelerated Blahut-Arimoto-type algorithms”
G. Matz and P. Duhamel · 2004
Cited alongside, same era.
“The private classical capacity and quantum capacity of a quantum channel”
I. Devetak · 2005
Cited alongside, same era.
“Qubit Channels Which Require Four Inputs to Achieve Capacity: Implications for Additivity Conjectures”
M. Hayashi, H. Imai, K. Matsumoto, M. B. Ruskai, and T. Shimono · 2005
Cited alongside, same era.
“Multiplicativity of Completely Bounded p-Norms Implies a New Additivity Result”
I. Devetak, M. Junge, C. King, and M. B. Ruskai · 2006
Cited alongside, same era.
“On the complexity of computing zero-error and Holevo capacity of quantum channels”
“Nonthermal Quantum Channels as a Thermodynamical Resource”
M. Navascués and L. P. García-Pintos · 2015
Later among the works it cites.
“Deep Learning and the Information Bottleneck Principle”
N. Tishby and N. Zaslavsky · 2015
Later among the works it cites.
Quantum Information Processing with Finite Resources: Mathematical Foundations
M. Tomamichel · 2015
Later among the works it cites.
“Approximate reversibility in the context of entropy gain, information gain, and complete positivity”
F. Buscemi, S. Das, and M. M. Wilde · 2016
Later among the works it cites.
“Channel Simulation and Coded Source Compression”
M. Hsieh and S. Watanabe · 2016
Later among the works it cites.
“QETLAB: A MATLAB toolbox for quantum entanglement, Version 0.9”
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
S. Beigi and P. W. Shor · 2007
Cited alongside, same era.
K. Kato · 2008
Cited alongside, same era.
“Computational geometry analysis of quantum state space and its applications”
K. Kato, M. Oto, H. Imai, and K. Imai · 2009
Cited alongside, same era.
“Geometrical interpretation and improvements of the Blahut-Arimoto’s algorithm”
Z. Naja, F. Alberge, and P. Duhamel · 2009
Cited alongside, same era.
“Numerical estimation of the relative entropy of entanglement”
Y. Zinchenko, S. Friedland, and G. Gour · 2010
Cited alongside, same era.
“Entropy gain and the Choi-Jamiolkowski correspondence for infinite-dimensional quantum evolutions”
A. S. Holevo · 2011
Cited alongside, same era.
“The entropy gain of quantum channels”
A. S. Holevo · 2011
Cited alongside, same era.
N. Johnston · 2016
Later among the works it cites.
“Efficient Approximation of Quantum Channel Capacities”
D. Sutter, T. Sutter, P. Mohajerin Esfahani, and R. Renner · 2016
Later among the works it cites.
“Opening the Black Box of Deep Neural Networks via Information”
R. Shwartz-Ziv and N. Tishby · 2017
Later among the works it cites.
Quantum Information Theory
M. M. Wilde · 2017
Later among the works it cites.
“Efficient optimization of the quantum relative entropy”
H. Fawzi and O. Fawzi · 2018
Later among the works it cites.
The theory of quantum information
J. Watrous · 2018
Later among the works it cites.
“Convexity and operational interpretation of the quantum information bottleneck function”
N. Datta, C. Hirche, and A. Winter · 2019
Closest in time.
“Thermodynamic capacity of quantum processes”
P. Faist, M. Berta, and F. Brandão · 2019
Closest in time.
“Semidefinite Approximations of the Matrix Logarithm”
H. Fawzi, J. Saunderson, and P. A. Parrilo · 2019
Closest in time.
“A Blahut-Arimoto Type Algorithm for Computing Classical-Quantum Channel Capacity”
H. Li and N. Cai · 2019
Closest in time.
H. Li and N. Cai · 2019
Closest in time.
“Quantum Rate-Distortion Coding of Relevant Information”
S. Salek, D. Cadamuro, P. Kammerlander, and K. Wiesner · 2019
Closest in time.