Converse coding theorems for quantums source and noisy channel
| dc.creator | Allahverdyan, A. E. | |
| dc.creator | Saakian, D. B. | |
| dc.date | 1997-02-18 | |
| dc.date | 1997-05-21 | |
| dc.date.accessioned | 2026-07-07T09:08:58Z | |
| dc.date.available | 2026-07-07T09:08:58Z | |
| dc.description | The weak converse coding theorems have been proved for the quantum source and channel. The results give the lower bound for capacity of source and the upper bound for capacity of channel. The monotonicity of mutual quantum information have also been proved. PACS numbers: 03.65.Bz | |
| dc.description | 11 pages, LaTex, no figures | |
| dc.identifier | https://arxiv.org/abs/quant-ph/9702034 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/9702034 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/150915 | |
| dc.subject | Quantum Physics | |
| dc.title | Converse coding theorems for quantums source and noisy channel | |
| dc.type | text |