dorsal/arxiv
View SchemaConverse coding theorems for quantums source and noisy channel
| Authors | A. E. Allahverdyan, D. B. Saakian |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/9702034 |
| URL | https://arxiv.org/abs/quant-ph/9702034 |
Abstract
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
{
"annotation_id": "12dcf960-1d2a-4fb8-bdc6-042814bc1299",
"date_created": "2026-03-02T18:02:41.544000Z",
"date_modified": "2026-03-02T18:02:41.544000Z",
"file_hash": "bf642c7bc5cd90aa95edf839af772194993ccd2e73cba61479e4a075e69d35cd",
"private": false,
"record": {
"abstract": "The weak converse coding theorems have been proved for the quantum source and\nchannel. The results give the lower bound for capacity of source and the upper\nbound for capacity of channel. The monotonicity of mutual quantum information\nhave also been proved. PACS numbers: 03.65.Bz",
"arxiv_id": "quant-ph/9702034",
"authors": [
"A. E. Allahverdyan",
"D. B. Saakian"
],
"categories": [
"quant-ph"
],
"title": "Converse coding theorems for quantums source and noisy channel",
"url": "https://arxiv.org/abs/quant-ph/9702034"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "eb3dadd0-bc38-4940-ab84-86f72054606f",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}