dorsal/arxiv
View SchemaOn the minimum number of unitaries needed to describe a random-unitary channel
| Authors | Francesco Buscemi |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0607034 |
| URL | https://arxiv.org/abs/quant-ph/0607034 |
| DOI | 10.1016/j.physleta.2006.08.038 |
| Journal | Phys. Lett. A 360, 256-258 (2006) |
Abstract
We provide, in an extremely simple way, an upper bound to the minimum number of unitary operators describing a general random-unitary channel.
{
"annotation_id": "e4da6053-e837-42f4-9f40-3c360b2c54fe",
"date_created": "2026-03-02T18:02:26.746000Z",
"date_modified": "2026-03-02T18:02:26.746000Z",
"file_hash": "aef48baad6fbd39d4b5c50cd7ee526bac93639f12e11301136fce89077b8ae01",
"private": false,
"record": {
"abstract": "We provide, in an extremely simple way, an upper bound to the minimum number\nof unitary operators describing a general random-unitary channel.",
"arxiv_id": "quant-ph/0607034",
"authors": [
"Francesco Buscemi"
],
"categories": [
"quant-ph"
],
"doi": "10.1016/j.physleta.2006.08.038",
"journal_ref": "Phys. Lett. A 360, 256-258 (2006)",
"title": "On the minimum number of unitaries needed to describe a random-unitary channel",
"url": "https://arxiv.org/abs/quant-ph/0607034"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "c3d53a0f-91ca-450c-9f77-e9bed0905b1b",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}