dorsal/arxiv
View SchemaClassical Communication Cost in Distributed Quantum Information Processing - A generalization of Quantum Communication Complexity
| Authors | Hoi-Kwong Lo |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/9912009 |
| URL | https://arxiv.org/abs/quant-ph/9912009 |
| DOI | 10.1103/PhysRevA.62.012313 |
Abstract
We study the amount of classical communication needed for distributed quantum information processing. In particular, we introduce the concept of "remote preparation" of a quantum state. Given an ensemble of states, Alice's task is to help Bob in a distant laboratory to prepare a state of her choice. We find several examples of an ensemble with an entropy S where the remote preparation can be done with a communication cost lower than the amount (2S) required by standard teleportation. We conjecture that, for an arbitrary N-dimensional pure state, its remote preparation requires 2log_2 N bits of classical communication, as in standard teleportation.
{
"annotation_id": "b0488f0c-4bde-44f8-a58f-38061e80acdd",
"date_created": "2026-03-02T18:02:48.184000Z",
"date_modified": "2026-03-02T18:02:48.184000Z",
"file_hash": "3b4919cf9ac8714cad33a81f8fc509d8c962b8513ad44674c52ed4e5cf6cd1e7",
"private": false,
"record": {
"abstract": "We study the amount of classical communication needed for distributed quantum\ninformation processing. In particular, we introduce the concept of \"remote\npreparation\" of a quantum state. Given an ensemble of states, Alice\u0027s task is\nto help Bob in a distant laboratory to prepare a state of her choice. We find\nseveral examples of an ensemble with an entropy S where the remote preparation\ncan be done with a communication cost lower than the amount (2S) required by\nstandard teleportation. We conjecture that, for an arbitrary N-dimensional pure\nstate, its remote preparation requires 2log_2 N bits of classical\ncommunication, as in standard teleportation.",
"arxiv_id": "quant-ph/9912009",
"authors": [
"Hoi-Kwong Lo"
],
"categories": [
"quant-ph"
],
"doi": "10.1103/PhysRevA.62.012313",
"title": "Classical Communication Cost in Distributed Quantum Information Processing - A generalization of Quantum Communication Complexity",
"url": "https://arxiv.org/abs/quant-ph/9912009"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "2861488a-b711-4bb9-b402-e936bfd47d71",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}