{"id":"https://openalex.org/W7124432958","doi":"https://doi.org/10.48550/arxiv.2601.10558","title":"A Mirror-Descent Algorithm for Computing the Petz-R\u00e9nyi Capacity of Classical-Quantum Channels","display_name":"A Mirror-Descent Algorithm for Computing the Petz-R\u00e9nyi Capacity of Classical-Quantum Channels","publication_year":2026,"publication_date":"2026-01-15","ids":{"openalex":"https://openalex.org/W7124432958","doi":"https://doi.org/10.48550/arxiv.2601.10558"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2601.10558","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2601.10558","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2601.10558","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5090629044","display_name":"Yu\u2010Hong Lai","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Lai, Yu-Hong","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5123179333","display_name":"Hao-Chung Cheng","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Cheng, Hao-Chung","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5090629044"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10964","display_name":"Wireless Communication Security Techniques","score":0.3467999994754791,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10964","display_name":"Wireless Communication Security Techniques","score":0.3467999994754791,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.24060000479221344,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10020","display_name":"Quantum Information and Cryptography","score":0.1264999955892563,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/sublinear-function","display_name":"Sublinear function","score":0.5796999931335449},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5360000133514404},{"id":"https://openalex.org/keywords/smoothness","display_name":"Smoothness","score":0.5347999930381775},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.53329998254776},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5156000256538391},{"id":"https://openalex.org/keywords/entropy","display_name":"Entropy (arrow of time)","score":0.4862000048160553},{"id":"https://openalex.org/keywords/curvature","display_name":"Curvature","score":0.4616999924182892},{"id":"https://openalex.org/keywords/contraction","display_name":"Contraction (grammar)","score":0.45980000495910645}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.675599992275238},{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.5796999931335449},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5360000133514404},{"id":"https://openalex.org/C102634674","wikidata":"https://www.wikidata.org/wiki/Q868473","display_name":"Smoothness","level":2,"score":0.5347999930381775},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.53329998254776},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5156000256538391},{"id":"https://openalex.org/C106301342","wikidata":"https://www.wikidata.org/wiki/Q4117933","display_name":"Entropy (arrow of time)","level":2,"score":0.4862000048160553},{"id":"https://openalex.org/C195065555","wikidata":"https://www.wikidata.org/wiki/Q214881","display_name":"Curvature","level":2,"score":0.4616999924182892},{"id":"https://openalex.org/C163415756","wikidata":"https://www.wikidata.org/wiki/Q126473","display_name":"Contraction (grammar)","level":2,"score":0.45980000495910645},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45559999346733093},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.41130000352859497},{"id":"https://openalex.org/C171752962","wikidata":"https://www.wikidata.org/wiki/Q255166","display_name":"Kullback\u2013Leibler divergence","level":2,"score":0.35350000858306885},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.35179999470710754},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.34439998865127563},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.33469998836517334},{"id":"https://openalex.org/C207390915","wikidata":"https://www.wikidata.org/wiki/Q1230525","display_name":"Divergence (linguistics)","level":2,"score":0.2913999855518341},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.28850001096725464},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.2865999937057495},{"id":"https://openalex.org/C6802819","wikidata":"https://www.wikidata.org/wiki/Q1072174","display_name":"Linear system","level":2,"score":0.28060001134872437},{"id":"https://openalex.org/C97744766","wikidata":"https://www.wikidata.org/wiki/Q870845","display_name":"Channel capacity","level":3,"score":0.2745000123977661},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.2644999921321869},{"id":"https://openalex.org/C44415725","wikidata":"https://www.wikidata.org/wiki/Q4913893","display_name":"Binary entropy function","level":3,"score":0.26019999384880066},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2556000053882599}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2601.10558","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2601.10558","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2601.10558","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2601.10558","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,15],"study":[1],"the":[2,5,24,35,44,83],"computation":[3],"of":[4,8,43],"$\u03b1$-R\u00e9nyi":[6],"capacity":[7],"a":[9,39,49,55,73],"classical-quantum":[10],"(c-q)":[11],"channel":[12],"for":[13],"$\u03b1\\in(0,1)$.":[14],"propose":[16],"an":[17,78],"exponentiated-gradient":[18],"(mirror":[19],"descent)":[20],"iteration":[21],"that":[22],"generalizes":[23],"Blahut-Arimoto":[25],"algorithm.":[26],"Our":[27],"analysis":[28],"establishes":[29],"relative":[30],"smoothness":[31],"with":[32,77],"respect":[33],"to":[34],"entropy":[36],"geometry,":[37],"guaranteeing":[38],"global":[40],"sublinear":[41],"convergence":[42,68],"objective":[45],"values.":[46],"Furthermore,":[47],"under":[48],"natural":[50],"tangent-space":[51],"nondegeneracy":[52],"condition":[53],"(and":[54],"mild":[56],"spectral":[57],"lower":[58],"bound":[59],"in":[60,69],"one":[61],"regime),":[62],"we":[63],"prove":[64],"local":[65,84],"linear":[66],"(geometric)":[67],"Kullback-Leibler":[70],"divergence":[71],"on":[72],"truncated":[74],"probability":[75],"simplex,":[76],"explicit":[79],"contraction":[80],"factor":[81],"once":[82],"curvature":[85],"constants":[86],"are":[87],"bounded.":[88]},"counts_by_year":[],"updated_date":"2026-01-17T23:15:25.596738","created_date":"2026-01-17T00:00:00"}