Fetching the paper…
Reading the bibliography…
We propose an iterative method for approximating the capacity of classical-quantum channels with a discrete input alphabet and a finite dimensional output, possibly under additional constraints on the input distribution.
Claude E. Shannon, “A mathematical theory of communication,” Bell System Technical Journal 27
1948
Earlier work this paper cites.
Edwin T. Jaynes, “Information theory and statistical mechanics. ii,” Physical Review 108
1957
Earlier work this paper cites.
Richard E. Blahut, “Computation of channel capacity and rate-distortion functions,” IEEE Transactions on Information Theory 18
1972
Earlier work this paper cites.
Suguru Arimoto, “An algorithm for computing the capacity of arbitrary discrete memoryless channels,” IEEE Transactions on Information Theory 18
1972
Earlier work this paper cites.
Mark Fannes, “A continuity property of the entropy density for spin lattice systems,” Communications in Mathematical Physics 31
1973
Earlier work this paper cites.
Edward J. Anderson and Peter Nash, Linear programming in infinite-dimensional spaces: theory and applications , Wiley-Interscience Series in Discrete Mathematics and Optimization (Wiley, 1987)
1987
Earlier work this paper cites.
Benjamin Schumacher and Michael D. Westmoreland, “Sending classical information via noisy quantum channels,” Physical Review A 56
1997
Earlier work this paper cites.
Lloyd N. Trefethen and David Bau, Numerical Linear Algebra (Siam, 1997)
1997
Earlier work this paper cites.
Alexander S. Holevo, “The capacity of the quantum channel with general signal states,” IEEE Transactions on Information Theory 44
1998
Earlier work this paper cites.
Hiroshi Nagaoka, “Algorithms of arimoto-blahut type for computing quantum channel capacity,” Proceedings IEEE International Symposium on Information Theory (ISIT) , 354– (1998)
1998
Earlier work this paper cites.
Hiroshi Nagaoka and Susumu Osawa, “Algorithms of arimoto-blahut type for computing quantum channel capacity,” Proceedings of the second QIT , 107Ð112 (1999)
1999
Earlier work this paper cites.
Susumu Osawa and Hiroshi Nagaoka, “Numerical experiments on the capacity of quantum channel with entangled input states,” IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E84
2001
Earlier work this paper cites.
Christopher King, “Additivity for unital qubit channels,” Journal of Mathematical Physics 43
2002
Earlier work this paper cites.
Peter W. Shor, “Capacities of quantum channels and how to find them,” Mathematical Programming 97
2003
Earlier work this paper cites.
Yurii Nesterov, Introductory Lectures on Convex Optimization: A Basic Course , Applied Optimization (Springer, 2004)
2004
Earlier work this paper cites.
C. Robert and G. Casella, Monte Carlo Statistical Methods , Springer Texts in Statistics (Springer, 2004)
2004
Cited alongside, same era.
Yurii Nesterov, “Smooth minimization of non-smooth functions,” Mathematical Programming 103
2005
Cited alongside, same era.
Masahito Hayashi, Hiroshi Imai, Keiji Matsumoto, Mary Beth Ruskai, and Toshiyuki Shimono, “Qubit channels which require four inputs to achieve capacity: Implications for additivity conjectures,” Quantum Information and Computation 5
2005
Cited alongside, same era.
Thomas M. Cover and Joy A. Thomas, Elements of Information Theory (Wiley Interscience, 2006)
2006
Cited alongside, same era.
Koenraad M. R. Audenaert, “A sharp continuity estimate for the von neumann entropy,” Journal of Physics A: Mathematical and Theoretical 40
2007
Cited alongside, same era.
Karol Zyczkowski, Karol A. Penson, Ion Nechita, and Benoit Collins, “Generating random density matrices,” Journal of Mathematical Physics 52
2011
Later among the works it cites.
Alexander S. Holevo, Quantum Systems, Channels, Information (De Gruyter Studies in Mathematical Physics 16, 2012)
2012
Later among the works it cites.
Stefan Richter, “Computational complexity certification of gradient methods for real-time model predictive control,” PhD thesis, ETH Zurich (2012), available at http://dx.doi.org/10.3929/ethz-a-007587480
2012
Later among the works it cites.
Olivier Devolder, François Glineur, and Yurii Nesterov, “Double smoothing technique for large-scale linearly constrained convex optimization,” SIAM Journal on Optimization 22
2012
Later among the works it cites.
Joel A. Tropp, “User-friendly tail bounds for sums of random matrices,” Foundations of Computational Mathematics 12
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
László Lovász and Santosh Vempala, “The geometry of logconcave functions and sampling algorithms,” Random Struct. Algorithms 30
2007
Cited alongside, same era.
Sanjoy K. Mitter, “Convex optimization in infinite dimensional spaces,” in Recent advances in learning and control , Lecture Notes in Control and Inform. Sci., Vol. 371 (Springer, London, 2008) pp. 161–179
2008
Cited alongside, same era.
Stephen Boyd and Lieven Vandenberghe, Convex Optimization (Cambridge University Press, Cambridge, 2004) pp. xiv+716, sixth printing with corrections, 2008
2008
Cited alongside, same era.
Matthew B Hastings, “Superadditivity of communication capacity using entangled inputs,” Nature Physics 5
2009
Cited alongside, same era.
Dimitri P. Bertsekas, Convex Optimization Theory , Athena Scientific optimization and computation series (Athena Scientific, 2009)
2009
Cited alongside, same era.
Dennis S. Bernstein, Matrix Mathematics , 2nd ed. (Princeton University Press, 2009)
2009
Cited alongside, same era.
Sham Kakade, Shai Shalev-Shwartz, and Ambuj Tewari, On the duality of strong convexity and strong smoothness: Learning applications and matrix regularization , Tech. Rep. (2009)
2009
Cited alongside, same era.
2012
Later among the works it cites.
Terence Tao, Topics in Random Matrix Theory , Vol. 132 (Graduate Studies in Mathematics, 2012)
2012
Later among the works it cites.
2012
Later among the works it cites.
Mark Wilde, Quantum Information Theory (Cambridge University Press, 2013)
2013
Later among the works it cites.
Olivier Devolder, Franois Glineur, and Yurii Nesterov, “First-order methods of smooth convex optimization with inexact oracle,” Mathematical Programming , 1–39 (2013)
2013
Later among the works it cites.
Aram W. Harrow and Ashley Montanaro, “Testing product states, quantum merlin-arthur games and tensor optimization,” J. ACM 60
2013
Later among the works it cites.
Maxim Raginsky and Igal Sason, “Concentration of measure inequalities in information theory, communications, and coding,” Foundations and Trends in Communications and Information Theory 10
2013
Later among the works it cites.
2014
Closest in time.
Michel Baes and Michael Bürgisser, “An acceleration procedure for optimal first-order methods,” Optimization Methods and Software 29
2014
Closest in time.