dorsal/arxiv
View SchemaThe Data Compression Theorem for Ergodic Quantum Information Sources
| Authors | Igor Bjelakovic, Arleta Szkola |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0301043 |
| URL | https://arxiv.org/abs/quant-ph/0301043 |
Abstract
We extend the data compression theorem to the case of ergodic quantum information sources. Moreover, we provide an asymptotically optimal compression scheme which is based on the concept of high probability subspaces. The rate of this compression scheme is equal to the von Neumann entropy rate.
{
"annotation_id": "8f51072d-d319-4a1c-9d37-0e163dbdf452",
"date_created": "2026-03-02T18:01:56.206000Z",
"date_modified": "2026-03-02T18:01:56.206000Z",
"file_hash": "06e7910bc4030d1f3314d1bae910268d41ddaad98b8f0891b30dcdcacb785295",
"private": false,
"record": {
"abstract": "We extend the data compression theorem to the case of ergodic quantum\ninformation sources. Moreover, we provide an asymptotically optimal compression\nscheme which is based on the concept of high probability subspaces. The rate of\nthis compression scheme is equal to the von Neumann entropy rate.",
"arxiv_id": "quant-ph/0301043",
"authors": [
"Igor Bjelakovic",
"Arleta Szkola"
],
"categories": [
"quant-ph"
],
"title": "The Data Compression Theorem for Ergodic Quantum Information Sources",
"url": "https://arxiv.org/abs/quant-ph/0301043"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "e71df9fc-d392-4505-9389-337e08e8358c",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}