dorsal/arxiv
View SchemaFaithful Teleportation with Partially Entangled States
| Authors | Gilad Gour |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0402133 |
| URL | https://arxiv.org/abs/quant-ph/0402133 |
| DOI | 10.1103/PhysRevA.70.042301 |
| Journal | Phys. Rev. A 70, 042301 (2004). |
Abstract
We write explicitly a general protocol for faithful teleportation of a d-state particle (qudit) via a partially entangled pair of (pure) $n$-state particles. The classical communication cost (CCC) of the protocol is $\log_{2}(nd)$ bits, and it is implemented by a {\em projective} measurement performed by Alice, and a unitary operator performed by Bob (after receiving from Alice the measurement result). We prove the optimality of our protocol by a comparison with the concentrate and teleport strategy. We also show that if $d>n/2$ or if there is no residual entanglement left after the faithful teleportation, the CCC of {\em any} protocol is at least $\log_{2}(nd)$ bits. Furthermore, we find a lower bound on the CCC in the process transforming one bipartite state to another by means of local operation and classical communication (LOCC).
{
"annotation_id": "f0d3e153-d636-464f-9985-e3c392840ebd",
"date_created": "2026-03-02T18:02:05.810000Z",
"date_modified": "2026-03-02T18:02:05.810000Z",
"file_hash": "b7034f444eb13b227e866d1d9bf911ecdb479160a48e4bc58a099c9d58f490f2",
"private": false,
"record": {
"abstract": "We write explicitly a general protocol for faithful teleportation of a\nd-state particle (qudit) via a partially entangled pair of (pure) $n$-state\nparticles. The classical communication cost (CCC) of the protocol is\n$\\log_{2}(nd)$ bits, and it is implemented by a {\\em projective} measurement\nperformed by Alice, and a unitary operator performed by Bob (after receiving\nfrom Alice the measurement result). We prove the optimality of our protocol by\na comparison with the concentrate and teleport strategy. We also show that if\n$d\u003en/2$ or if there is no residual entanglement left after the faithful\nteleportation, the CCC of {\\em any} protocol is at least $\\log_{2}(nd)$ bits.\nFurthermore, we find a lower bound on the CCC in the process transforming one\nbipartite state to another by means of local operation and classical\ncommunication (LOCC).",
"arxiv_id": "quant-ph/0402133",
"authors": [
"Gilad Gour"
],
"categories": [
"quant-ph"
],
"doi": "10.1103/PhysRevA.70.042301",
"journal_ref": "Phys. Rev. A 70, 042301 (2004).",
"title": "Faithful Teleportation with Partially Entangled States",
"url": "https://arxiv.org/abs/quant-ph/0402133"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "27efbb7c-01b8-4db5-91ed-668db9061de2",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}