dorsal/arxiv
View SchemaBounds on localisable information via semidefinite programming
| Authors | Barbara Synak, Karol Horodecki, Michal Horodecki |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0405149 |
| URL | https://arxiv.org/abs/quant-ph/0405149 |
| DOI | 10.1063/1.2000707 |
| Journal | J. Math. Phys. 46, 082107 (2005) |
Abstract
We investigate so-called localisable information of bipartite states and a parallel notion of information deficit. Localisable information is defined as the amount of information that can be concentrated by means of classical communication and local operations where only maximally mixed states can be added for free. The information deficit is defined as difference between total information contents of the state and localisable information. We consider a larger class of operations: the so called PPT operations, which in addition preserve maximally mixed state (PPT-PMM operations). We formulate the related optimization problem as sedmidefnite program with suitable constraints. We then provide bound for fidelity of transition of a given state into product pure state on Hilbert space of dimension d. This allows to obtain general upper bound for localisable information (and also for information deficit). We calculated the bounds exactly for Werner states and isotropic states in any dimension. Surprisingly it turns out that related bounds for information deficit are equal to relative entropy of entanglement (in the case of Werner states - regularized one). We compare the upper bounds with lower bounds based on simple protocol of localisation of information.
{
"annotation_id": "ce395657-f449-4ffd-ac8b-a805f5e357c2",
"date_created": "2026-03-02T18:02:06.872000Z",
"date_modified": "2026-03-02T18:02:06.872000Z",
"file_hash": "4e3342ac7a241c6297dbef6eecefb83373b78099559260fddfada8c6b9b1b288",
"private": false,
"record": {
"abstract": "We investigate so-called localisable information of bipartite states and a\nparallel notion of information deficit. Localisable information is defined as\nthe amount of information that can be concentrated by means of classical\ncommunication and local operations where only maximally mixed states can be\nadded for free. The information deficit is defined as difference between total\ninformation contents of the state and localisable information. We consider a\nlarger class of operations: the so called PPT operations, which in addition\npreserve maximally mixed state (PPT-PMM operations). We formulate the related\noptimization problem as sedmidefnite program with suitable constraints. We then\nprovide bound for fidelity of transition of a given state into product pure\nstate on Hilbert space of dimension d. This allows to obtain general upper\nbound for localisable information (and also for information deficit). We\ncalculated the bounds exactly for Werner states and isotropic states in any\ndimension. Surprisingly it turns out that related bounds for information\ndeficit are equal to relative entropy of entanglement (in the case of Werner\nstates - regularized one). We compare the upper bounds with lower bounds based\non simple protocol of localisation of information.",
"arxiv_id": "quant-ph/0405149",
"authors": [
"Barbara Synak",
"Karol Horodecki",
"Michal Horodecki"
],
"categories": [
"quant-ph"
],
"doi": "10.1063/1.2000707",
"journal_ref": "J. Math. Phys. 46, 082107 (2005)",
"title": "Bounds on localisable information via semidefinite programming",
"url": "https://arxiv.org/abs/quant-ph/0405149"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "8c64634c-47ae-4c10-9ae3-e4c18761aa06",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}