Numerical Experiments on The Capacity of Quantum Channel with Entangled Input States

Simple item page
dc.creatorOsawa, Susumu
dc.creatorNagaoka, Hiroshi
dc.date2000-07-29
dc.date2001-10-26
dc.date.accessioned2026-07-07T06:00:31Z
dc.date.available2026-07-07T06:00:31Z
dc.descriptionThe capacity of quantum channel with product input states was formulated by the quantum coding theorem. However, whether entangled input states can enhance the quantum channel is still open. It turns out that this problem is reduced to aspecial case of the more general problem whether the capacity of product quantum channel exhibits additivity. In the present study, we apply one of the quantum Arimoto-Blahut type algorithms to the latter problem. The results suggest that the additivity of product quantum channel capacity always holds and that entangled input states cannot enhance the quantum channel capacity.
dc.descriptionLatex, 13 pages, partly presented at the second QIT and the 22nd SITA. Final version to appear in IEICE Trans. Fundamentals
dc.identifierhttps://arxiv.org/abs/quant-ph/0007115
dc.identifierhttp://arxiv.org/abs/quant-ph/0007115
dc.identifierIEICE Trans. Fundamentals, vol.E84-A, no.10, pp.2583-2590, Oct. 2001
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/88992
dc.subjectQuantum Physics
dc.titleNumerical Experiments on The Capacity of Quantum Channel with Entangled Input States
dc.typetext

Files

Collections

arXiv