104 citations to https://www.mathnet.ru/rus/ppi491
-
Eltschka Ch., Huber F., Guehne O., Siewert J., “Exponentially Many Entanglement and Correlation Constraints For Multipartite Quantum States”, Phys. Rev. A, 98:5 (2018), 052317
-
Reuvers R., “An Algorithm to Explore Entanglement in Small Systems”, Proc. R. Soc. A-Math. Phys. Eng. Sci., 474:2214 (2018), 20180023
-
Gessner M., Smerzi A., “Statistical Speed of Quantum States: Generalized Quantum Fisher Information and Schatten Speed”, Phys. Rev. A, 97:2 (2018), 022109
-
Wang X., Fang K., Tomamichel M., “On Finite Blocklength Converse Bounds For Classical Communication Over Quantum Channels”, 2018 IEEE International Symposium on Information Theory (Isit), IEEE International Symposium on Information Theory, IEEE, 2018, 2157–2161
-
Gyongyosi L., Imre S., Hung Viet Nguyen, “A Survey on Quantum Channel Capacities”, IEEE Commun. Surv. Tutor., 20:2 (2018), 1149–1205
-
Wang X., Xie W., Duan R., “Semidefinite Programming Strong Converse Bounds For Classical Capacity”, IEEE Trans. Inf. Theory, 64:1 (2018), 640–653
-
Gour G., Kemp T., “The Minimum Renyi Entropy Output of a Quantum Channel Is Locally Additive”, Lett. Math. Phys., 107:6 (2017), 1131–1155
-
Fukuda M., Gour G., “Additive Bounds of Minimum Output Entropies For Unital Channels and An Exact Qubit Formula”, IEEE Trans. Inf. Theory, 63:3 (2017), 1818–1828
-
А. С. Холево, “Гауссовские оптимизаторы и проблема аддитивности в квантовой теории информации”, УМН, 70:2(422) (2015), 141–180 ; A. S. Holevo, “Gaussian optimizers and the additivity problem in quantum information theory”, Russian Math. Surveys, 70:2 (2015), 331–367
-
Junge M., Palazuelos C., “Channel Capacities Via P-Summing Norms”, Adv. Math., 272 (2015), 350–398