dorsal/arxiv
View SchemaCommunication Capacity of Quantum Computation
| Authors | S. Bose, L. Rallan, V. Vedral |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0003072 |
| URL | https://arxiv.org/abs/quant-ph/0003072 |
| DOI | 10.1103/PhysRevLett.85.5448 |
| Journal | Phys. Rev. Lett., 85, 5448 (2000) |
Abstract
By considering quantum computation as a communication process, we relate its efficiency to a communication capacity. This formalism allows us to rederive lower bounds on the complexity of search algorithms. It also enables us to link the mixedness of a quantum computer to its efficiency. We discuss the implications of our results for quantum measurement.
{
"annotation_id": "2f3bd3f2-be4e-4765-8185-6a0a4a8f80fe",
"date_created": "2026-03-02T18:01:39.216000Z",
"date_modified": "2026-03-02T18:01:39.216000Z",
"file_hash": "55d0c26ffa89f2748ebe0db014559d018af93419c1f7623741004f467d64bb1f",
"private": false,
"record": {
"abstract": "By considering quantum computation as a communication process, we relate its\nefficiency to a communication capacity. This formalism allows us to rederive\nlower bounds on the complexity of search algorithms. It also enables us to link\nthe mixedness of a quantum computer to its efficiency. We discuss the\nimplications of our results for quantum measurement.",
"arxiv_id": "quant-ph/0003072",
"authors": [
"S. Bose",
"L. Rallan",
"V. Vedral"
],
"categories": [
"quant-ph"
],
"doi": "10.1103/PhysRevLett.85.5448",
"journal_ref": "Phys. Rev. Lett., 85, 5448 (2000)",
"title": "Communication Capacity of Quantum Computation",
"url": "https://arxiv.org/abs/quant-ph/0003072"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "788f09eb-b826-4d1d-b5b8-aadf9f0c61d9",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}