dorsal/arxiv
View SchemaRemote preparation of quantum states
| Authors | Charles H. Bennett, Patrick Hayden, Debbie W. Leung, Peter W. Shor, Andreas Winter |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0307100 |
| URL | https://arxiv.org/abs/quant-ph/0307100 |
| DOI | 10.1109/TIT.2004.839476 |
| Journal | IEEE Trans. Inform. Theory, vol. 51, no. 1, pp 56-74, 2005. |
Abstract
Remote state preparation is the variant of quantum state teleportation in which the sender knows the quantum state to be communicated. The original paper introducing teleportation established minimal requirements for classical communication and entanglement but the corresponding limits for remote state preparation have remained unknown until now: previous work has shown, however, that it not only requires less classical communication but also gives rise to a trade-off between these two resources in the appropriate setting. We discuss this problem from first principles, including the various choices one may follow in the definitions of the actual resources. Our main result is a general method of remote state preparation for arbitrary states of many qubits, at a cost of 1 bit of classical communication and 1 bit of entanglement per qubit sent. In this "universal" formulation, these ebit and cbit requirements are shown to be simultaneously optimal by exhibiting a dichotomy. Our protocol then yields the exact trade-off curve for arbitrary ensembles of pure states and pure entangled states (including the case of incomplete knowledge of the ensemble probabilities), based on the recently established quantum-classical trade-off for quantum data compression. The paper includes an extensive discussion of our results, including the impact of the choice of model on the resources, the topic of obliviousness, and an application to private quantum channels and quantum data hiding.
{
"annotation_id": "1ee00619-683e-473f-bfbb-f584aa48cbcf",
"date_created": "2026-03-02T18:02:00.221000Z",
"date_modified": "2026-03-02T18:02:00.221000Z",
"file_hash": "d001e619fa46651c7a2295491087f0fc90703d8c66e82c7ae3abaa47ba4f01c7",
"private": false,
"record": {
"abstract": "Remote state preparation is the variant of quantum state teleportation in\nwhich the sender knows the quantum state to be communicated. The original paper\nintroducing teleportation established minimal requirements for classical\ncommunication and entanglement but the corresponding limits for remote state\npreparation have remained unknown until now: previous work has shown, however,\nthat it not only requires less classical communication but also gives rise to a\ntrade-off between these two resources in the appropriate setting. We discuss\nthis problem from first principles, including the various choices one may\nfollow in the definitions of the actual resources. Our main result is a general\nmethod of remote state preparation for arbitrary states of many qubits, at a\ncost of 1 bit of classical communication and 1 bit of entanglement per qubit\nsent. In this \"universal\" formulation, these ebit and cbit requirements are\nshown to be simultaneously optimal by exhibiting a dichotomy. Our protocol then\nyields the exact trade-off curve for arbitrary ensembles of pure states and\npure entangled states (including the case of incomplete knowledge of the\nensemble probabilities), based on the recently established quantum-classical\ntrade-off for quantum data compression. The paper includes an extensive\ndiscussion of our results, including the impact of the choice of model on the\nresources, the topic of obliviousness, and an application to private quantum\nchannels and quantum data hiding.",
"arxiv_id": "quant-ph/0307100",
"authors": [
"Charles H. Bennett",
"Patrick Hayden",
"Debbie W. Leung",
"Peter W. Shor",
"Andreas Winter"
],
"categories": [
"quant-ph"
],
"doi": "10.1109/TIT.2004.839476",
"journal_ref": "IEEE Trans. Inform. Theory, vol. 51, no. 1, pp 56-74, 2005.",
"title": "Remote preparation of quantum states",
"url": "https://arxiv.org/abs/quant-ph/0307100"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "422239ed-b025-42e6-ac5e-21800899d586",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}