dorsal/arxiv
View SchemaResource requirements of private quantum channels and consequence for oblivious remote state preparation
| Authors | Rahul Jain |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0507075 |
| URL | https://arxiv.org/abs/quant-ph/0507075 |
Abstract
Shannon in celebrated works had shown that n bits of shared key is necessary and sufficient to transmit n-bit classical information in an information-theoretically secure way. Ambainis, Mosca, Tapp and de Wolf in quant-ph/0003101 considered a more general setting, referred to as Private quantum channels, in which instead of classical information, quantum states are required to be transmitted and only one-way communication is allowed. They show that in this case 2n bits of shared key is necessary and sufficient to transmit an n-qubit state. We consider the most general setting in which we allow for all possible combinations i.e. we let the input to be transmitted, the message sent and the shared resources to be classical/quantum. We develop a general framework by which we are able to show tight bounds on communication/shared resources in all of these cases and this includes the results of Shannon and Ambainis et al. As a consequence of our arguments we also show that in a one-way oblivious Remote state preparation protocol for transferring an n-qubit pure state, the entropy of the communication must be 2n and the entanglement measure of the shared resource must be n. This generalizes on the result of Leung and Shor which shows same bound on the length of communication in the special case when the shared resource is maximally entangled e.g. EPR pairs and hence settles an open question asked in their paper regarding protocols without maximally entangled shared resource.
{
"annotation_id": "a8aff0c5-d6a6-4d6c-a87e-9fb1b3bc98ad",
"date_created": "2026-03-02T18:02:17.050000Z",
"date_modified": "2026-03-02T18:02:17.050000Z",
"file_hash": "59a35f89363a81c980ed3d293f6b7f1e7df685c545cad26af5180791850c6153",
"private": false,
"record": {
"abstract": "Shannon in celebrated works had shown that n bits of shared key is necessary\nand sufficient to transmit n-bit classical information in an\ninformation-theoretically secure way. Ambainis, Mosca, Tapp and de Wolf in\nquant-ph/0003101 considered a more general setting, referred to as Private\nquantum channels, in which instead of classical information, quantum states are\nrequired to be transmitted and only one-way communication is allowed. They show\nthat in this case 2n bits of shared key is necessary and sufficient to transmit\nan n-qubit state. We consider the most general setting in which we allow for\nall possible combinations i.e. we let the input to be transmitted, the message\nsent and the shared resources to be classical/quantum. We develop a general\nframework by which we are able to show tight bounds on communication/shared\nresources in all of these cases and this includes the results of Shannon and\nAmbainis et al.\n As a consequence of our arguments we also show that in a one-way oblivious\nRemote state preparation protocol for transferring an n-qubit pure state, the\nentropy of the communication must be 2n and the entanglement measure of the\nshared resource must be n. This generalizes on the result of Leung and Shor\nwhich shows same bound on the length of communication in the special case when\nthe shared resource is maximally entangled e.g. EPR pairs and hence settles an\nopen question asked in their paper regarding protocols without maximally\nentangled shared resource.",
"arxiv_id": "quant-ph/0507075",
"authors": [
"Rahul Jain"
],
"categories": [
"quant-ph"
],
"title": "Resource requirements of private quantum channels and consequence for oblivious remote state preparation",
"url": "https://arxiv.org/abs/quant-ph/0507075"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "4c76bc4a-80c2-412f-9bb2-7ddd7330a8dc",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}