{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:RNHOAJT7HU5SBB6TYSVQGZBFM3","short_pith_number":"pith:RNHOAJT7","schema_version":"1.0","canonical_sha256":"8b4ee0267f3d3b2087d3c4ab03642566ddcf4717d6748b6e899f79c5ea81d9a2","source":{"kind":"arxiv","id":"2106.13692","version":3},"attestation_state":"computed","paper":{"title":"Device-independent lower bounds on the conditional von Neumann entropy","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Hamza Fawzi, Omar Fawzi, Peter Brown","submitted_at":"2021-06-25T15:24:12Z","abstract_excerpt":"The rates of several device-independent (DI) protocols, including quantum key-distribution (QKD) and randomness expansion (RE), can be computed via an optimization of the conditional von Neumann entropy over a particular class of quantum states. In this work we introduce a numerical method to compute lower bounds on such rates. We derive a sequence of optimization problems that converge to the conditional von Neumann entropy of systems defined on general separable Hilbert spaces. Using the Navascu\\'es-Pironio-Ac\\'in hierarchy we can then relax these problems to semidefinite programs, giving a "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2106.13692","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-06-25T15:24:12Z","cross_cats_sorted":[],"title_canon_sha256":"e33b6af2187ca6af4ed32b1b310f2c11adc0591cc2ca7ea53652dca98b290720","abstract_canon_sha256":"4a3fffceae197eb261538f62a5911fafaa7f35801c30cc9cad9a9a4e3a8af3d4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:59:48.130139Z","signature_b64":"WaYExEaVDTiY/MEKqW+eq6hx7zl1FICrdS32jDLPxYNkXIe9mfyZ7KTt/NQu8St8dlgaTTxY12JuW6xuHbeWAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b4ee0267f3d3b2087d3c4ab03642566ddcf4717d6748b6e899f79c5ea81d9a2","last_reissued_at":"2026-07-05T08:59:48.129766Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:59:48.129766Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Device-independent lower bounds on the conditional von Neumann entropy","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Hamza Fawzi, Omar Fawzi, Peter Brown","submitted_at":"2021-06-25T15:24:12Z","abstract_excerpt":"The rates of several device-independent (DI) protocols, including quantum key-distribution (QKD) and randomness expansion (RE), can be computed via an optimization of the conditional von Neumann entropy over a particular class of quantum states. In this work we introduce a numerical method to compute lower bounds on such rates. We derive a sequence of optimization problems that converge to the conditional von Neumann entropy of systems defined on general separable Hilbert spaces. Using the Navascu\\'es-Pironio-Ac\\'in hierarchy we can then relax these problems to semidefinite programs, giving a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.13692","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2106.13692/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2106.13692","created_at":"2026-07-05T08:59:48.129830+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.13692v3","created_at":"2026-07-05T08:59:48.129830+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.13692","created_at":"2026-07-05T08:59:48.129830+00:00"},{"alias_kind":"pith_short_12","alias_value":"RNHOAJT7HU5S","created_at":"2026-07-05T08:59:48.129830+00:00"},{"alias_kind":"pith_short_16","alias_value":"RNHOAJT7HU5SBB6T","created_at":"2026-07-05T08:59:48.129830+00:00"},{"alias_kind":"pith_short_8","alias_value":"RNHOAJT7","created_at":"2026-07-05T08:59:48.129830+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2410.16362","citing_title":"Semidefinite optimization of the quantum relative entropy of channels","ref_index":42,"is_internal_anchor":false},{"citing_arxiv_id":"2604.06457","citing_title":"Higher rates for semi-device-independent randomness expansion by recycling input randomness","ref_index":51,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RNHOAJT7HU5SBB6TYSVQGZBFM3","json":"https://pith.science/pith/RNHOAJT7HU5SBB6TYSVQGZBFM3.json","graph_json":"https://pith.science/api/pith-number/RNHOAJT7HU5SBB6TYSVQGZBFM3/graph.json","events_json":"https://pith.science/api/pith-number/RNHOAJT7HU5SBB6TYSVQGZBFM3/events.json","paper":"https://pith.science/paper/RNHOAJT7"},"agent_actions":{"view_html":"https://pith.science/pith/RNHOAJT7HU5SBB6TYSVQGZBFM3","download_json":"https://pith.science/pith/RNHOAJT7HU5SBB6TYSVQGZBFM3.json","view_paper":"https://pith.science/paper/RNHOAJT7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.13692&json=true","fetch_graph":"https://pith.science/api/pith-number/RNHOAJT7HU5SBB6TYSVQGZBFM3/graph.json","fetch_events":"https://pith.science/api/pith-number/RNHOAJT7HU5SBB6TYSVQGZBFM3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RNHOAJT7HU5SBB6TYSVQGZBFM3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RNHOAJT7HU5SBB6TYSVQGZBFM3/action/storage_attestation","attest_author":"https://pith.science/pith/RNHOAJT7HU5SBB6TYSVQGZBFM3/action/author_attestation","sign_citation":"https://pith.science/pith/RNHOAJT7HU5SBB6TYSVQGZBFM3/action/citation_signature","submit_replication":"https://pith.science/pith/RNHOAJT7HU5SBB6TYSVQGZBFM3/action/replication_record"}},"created_at":"2026-07-05T08:59:48.129830+00:00","updated_at":"2026-07-05T08:59:48.129830+00:00"}