dorsal/arxiv
View SchemaLow-Entanglement Remote State Preparation
| Authors | Igor Devetak, Toby Berger |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0102123 |
| URL | https://arxiv.org/abs/quant-ph/0102123 |
| DOI | 10.1103/PhysRevLett.87.197901 |
Abstract
An upper bound on the low-entanglement remote state preparation (RSP) ebits vs. bits tradeoff curve (Bennett et al.,quant-ph/0006044) is found using techniques of classical information theory. We prove our coding scheme to be optimal amongst an important class of protocols, and conjecture the bound to be tight.
{
"annotation_id": "195d68b4-e6c6-4768-bd83-9556a324a097",
"date_created": "2026-03-02T18:01:42.078000Z",
"date_modified": "2026-03-02T18:01:42.078000Z",
"file_hash": "38720271743eb9552f03f80f27042549620f70234bdc70d037b8b8b6d62346e4",
"private": false,
"record": {
"abstract": "An upper bound on the low-entanglement remote state preparation (RSP) ebits\nvs. bits tradeoff curve (Bennett et al.,quant-ph/0006044) is found using\ntechniques of classical information theory. We prove our coding scheme to be\noptimal amongst an important class of protocols, and conjecture the bound to be\ntight.",
"arxiv_id": "quant-ph/0102123",
"authors": [
"Igor Devetak",
"Toby Berger"
],
"categories": [
"quant-ph"
],
"doi": "10.1103/PhysRevLett.87.197901",
"title": "Low-Entanglement Remote State Preparation",
"url": "https://arxiv.org/abs/quant-ph/0102123"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "0e6a7ba0-16e7-4b08-9207-304ee8350a89",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}