dorsal/arxiv
View SchemaAnalysis of the Entanglement Cost and Calculation of the Holevo Capacity
| Authors | Toshiyuki Shimono |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0610178 |
| URL | https://arxiv.org/abs/quant-ph/0610178 |
Abstract
``Beam me over,'' Alice: A cricket's quantum journey This thesis addresses two known quantities in quantum information science: (1) entanglement cost, and (2) Holevo capacity. These quantities will be crucial values when teleportation becomes common in daily life, perhaps centuries from now. Assume that Alice desires to send a singing Japanese cricket to her friend Bob in America, and that Alice and Bob already share a quantum entanglement. First, Alice sends Bob a mass of information bits resulting from the interaction between the cricket she holds in her hand and half of the entanglement. Subsequently, Bob receives the information bits and manipulates the other half of the entanglement, transforming them back into the original cricket. Examining this situation from an instrumental engineering viewpoint, quantifying the amount of the quantum entanglement and the number of information bits is crucial for this transmission. If both values are enough, Alice could even send herself to Bob's place instead of the tiny cricket. The topics of this thesis therefore are: (1) the mathematical properties of the entanglement cost, such as whether it is an additive measure similar to normal length or weight; and (2) how to calculate the Holevo capacity, an ultimately achievable limit of the information conveyance capacity of an information channel, such as of a single photon passing through an optical fiber or space. These two distinct quantities are magically tied together by several ``additive or not'' hypotheses, which await mathematical proof.
{
"annotation_id": "253fd95e-9365-48ee-9b79-3d154440f125",
"date_created": "2026-03-02T18:02:31.138000Z",
"date_modified": "2026-03-02T18:02:31.138000Z",
"file_hash": "c6f7c6f08f47275011c7ab5f68b47c27bc6f7235eb556eee01258bbf2f8908c0",
"private": false,
"record": {
"abstract": "``Beam me over,\u0027\u0027 Alice: A cricket\u0027s quantum journey\n This thesis addresses two known quantities in quantum information science:\n(1) entanglement cost, and (2) Holevo capacity. These quantities will be\ncrucial values when teleportation becomes common in daily life, perhaps\ncenturies from now.\n Assume that Alice desires to send a singing Japanese cricket to her friend\nBob in America, and that Alice and Bob already share a quantum entanglement.\nFirst, Alice sends Bob a mass of information bits resulting from the\ninteraction between the cricket she holds in her hand and half of the\nentanglement. Subsequently, Bob receives the information bits and manipulates\nthe other half of the entanglement, transforming them back into the original\ncricket. Examining this situation from an instrumental engineering viewpoint,\nquantifying the amount of the quantum entanglement and the number of\ninformation bits is crucial for this transmission. If both values are enough,\nAlice could even send herself to Bob\u0027s place instead of the tiny cricket.\n The topics of this thesis therefore are: (1) the mathematical properties of\nthe entanglement cost, such as whether it is an additive measure similar to\nnormal length or weight; and (2) how to calculate the Holevo capacity, an\nultimately achievable limit of the information conveyance capacity of an\ninformation channel, such as of a single photon passing through an optical\nfiber or space. These two distinct quantities are magically tied together by\nseveral ``additive or not\u0027\u0027 hypotheses, which await mathematical proof.",
"arxiv_id": "quant-ph/0610178",
"authors": [
"Toshiyuki Shimono"
],
"categories": [
"quant-ph"
],
"title": "Analysis of the Entanglement Cost and Calculation of the Holevo Capacity",
"url": "https://arxiv.org/abs/quant-ph/0610178"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "85906489-83d8-4516-b464-1060a4af04e3",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}