Qubit Channels Which Require Four Inputs to Achieve Capacity: Implications for Additivity Conjectures

dc.creatorHayashi, Masahito
dc.creatorImai, Hiroshi
dc.creatorMatsumoto, Keiji
dc.creatorRuskai, Mary Beth
dc.creatorShimono, Toshiyuki
dc.date2004-03-24
dc.date2004-08-26
dc.date.accessioned2026-07-07T06:09:23Z
dc.date.available2026-07-07T06:09:23Z
dc.descriptionAn example is given of a qubit quantum channel which requires four inputs to maximize the Holevo capacity. The example is one of a family of channels which are related to 3-state channels. The capacity of the product channel is studied and numerical evidence presented which strongly suggests additivity. The numerical evidence also supports a conjecture about the concavity of output entropy as a function of entanglement parameters. However, an example is presented which shows that for some channels this conjecture does not hold for all input states. A numerical algorithm for finding the capacity and optimal inputs is presented and its relation to a relative entropy optimization discussed.
dc.description19 pages, 15 figures. several typos corrected in v2
dc.identifierhttps://arxiv.org/abs/quant-ph/0403176
dc.identifierhttp://arxiv.org/abs/quant-ph/0403176
dc.identifierQuantum Inf. Comput. 5, 13--31 (2005)
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/91940
dc.subjectQuantum Physics
dc.titleQubit Channels Which Require Four Inputs to Achieve Capacity: Implications for Additivity Conjectures
dc.typetext

Files

Collections