{"paper":{"title":"Bounds on localisable information via semidefinite programming","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Barbara Synak, Karol Horodecki, Michal Horodecki","submitted_at":"2004-05-25T13:15:46Z","abstract_excerpt":"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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0405149","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}