{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:42:57Z","timestamp":1773376977480,"version":"3.50.1"},"reference-count":42,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,6,22]]},"DOI":"10.1109\/isit63088.2025.11195337","type":"proceedings-article","created":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T17:48:08Z","timestamp":1760982488000},"page":"1-6","source":"Crossref","is-referenced-by-count":0,"title":["Riemannian Optimization for Holevo Capacity"],"prefix":"10.1109","author":[{"given":"Chengkai","family":"Zhu","sequence":"first","affiliation":[{"name":"The Hong Kong University of Science and Technology (Guangzhou),Thrust of Artificial Intelligence, Information Hub,Guangzhou,China"}]},{"given":"Renfeng","family":"Peng","sequence":"additional","affiliation":[{"name":"Chinese Academy of Sciences,State Key Laboratory of Scientific and Engineering Computing, Academy of Mathematics and Systems Science,Beijing,China"}]},{"given":"Bin","family":"Gao","sequence":"additional","affiliation":[{"name":"Chinese Academy of Sciences,State Key Laboratory of Scientific and Engineering Computing, Academy of Mathematics and Systems Science,Beijing,China"}]},{"given":"Xin","family":"Wang","sequence":"additional","affiliation":[{"name":"The Hong Kong University of Science and Technology (Guangzhou),Thrust of Artificial Intelligence, Information Hub,Guangzhou,China"}]}],"member":"263","reference":[{"key":"ref1","volume-title":"Bounds for the quantity of information transmitted by a quantum communication channel","author":"Holevo","year":"1973"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1103\/physreva.56.131"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/18.651037"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1063\/1.1498000"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1063\/1.1500791"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.806153"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1103\/physrevlett.78.3217"},{"key":"ref8","volume-title":"An application of a matrix inequality in quantum information theory","author":"King","year":"2004"},{"key":"ref9","volume-title":"Properties of conjugate channels with applications to additivity and multiplicativity","author":"King","year":"2006"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1038\/nphys1224"},{"key":"ref11","volume-title":"On the complexity of computing zero-error and Holevo capacity of quantum channels","author":"Beigi","year":"2008"},{"issue":"1","key":"ref12","doi-asserted-by":"crossref","first-page":"640","DOI":"10.1109\/TIT.2017.2741101","article-title":"Semidefinite programming strong converse bounds for classical capacity","volume":"64","author":"Wang","year":"2018","journal-title":"IEEE Transactions on Information Theory"},{"issue":"7","key":"ref13","doi-asserted-by":"crossref","first-page":"4609","DOI":"10.1109\/TIT.2019.2898656","article-title":"On converse bounds for classical communication over quantum channels","volume":"65","author":"Wang","year":"2019","journal-title":"IEEE Transactions on Information Theory"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s00220-021-04064-4"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1103\/physreva.97.012332"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1972.1054855"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1972.1054753"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.1998.708959"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-003-0446-y"},{"issue":"10","key":"ref20","first-page":"2583","article-title":"Numerical experiments on the capacity of quantum channel with entangled input states","volume":"84","author":"Osawa","year":"2001","journal-title":"IEICE transactions on fundamentals of electronics, communications and computer sciences"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85126-4_4"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2015.2503755"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849608"},{"key":"ref24","volume-title":"Computing the classical-quantum channel capacity: experiments on a Blahut-Arimoto type algorithm and an approximate solution for the binary inputs, two-dimensional outputs channel","year":"2019"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2020.3034471"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-018-9385-0"},{"issue":"15","key":"ref27","doi-asserted-by":"crossref","first-page":"154003","DOI":"10.1088\/1751-8121\/aab285","article-title":"Efficient optimization of the quantum relative entropy","volume":"51","author":"Fawzi","year":"2018","journal-title":"Journal of Physics A: Mathematical and Theoretical"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1515\/9781400830244"},{"key":"ref29","doi-asserted-by":"crossref","DOI":"10.1017\/9781009166164","volume-title":"An introduction to optimization on smooth manifolds","author":"Boumal","year":"2023"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1137\/24m1643773"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2024.3412129"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1093\/imanum\/drx080"},{"issue":"1","key":"ref33","first-page":"1455","article-title":"Manopt, a Matlab toolbox for optimization on manifolds","volume":"15","author":"Boumal","year":"2014","journal-title":"The Journal of Machine Learning Research"},{"key":"ref34","volume-title":"The code used in this work is available"},{"issue":"4","key":"ref35","doi-asserted-by":"crossref","first-page":"046001","DOI":"10.1088\/0034-4885\/75\/4\/046001","article-title":"Quantum channels and their entropic characteristics","volume":"75","author":"Holevo","year":"2012","journal-title":"Reports on Progress in Physics"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1142\/s0129055x03001709"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2018.2794391"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3245985"},{"key":"ref39","volume-title":"Semidefinite optimization for quantum information","author":"Wang","year":"2018"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1103\/revmodphys.96.045006"},{"key":"ref41","volume-title":"Unified framework for calculating convex roof resource measures","author":"Zhu","year":"2024"},{"key":"ref42","volume-title":"Finding quantum codes via Riemannian optimization","author":"Casanova","year":"2024"}],"event":{"name":"2025 IEEE International Symposium on Information Theory (ISIT)","location":"Ann Arbor, MI, USA","start":{"date-parts":[[2025,6,22]]},"end":{"date-parts":[[2025,6,27]]}},"container-title":["2025 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11195206\/11195207\/11195337.pdf?arnumber=11195337","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:29:43Z","timestamp":1773347383000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11195337\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,22]]},"references-count":42,"URL":"https:\/\/doi.org\/10.1109\/isit63088.2025.11195337","relation":{},"subject":[],"published":{"date-parts":[[2025,6,22]]}}}