{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:UNDV2XE7SFX6X4IQ425V3STC74","short_pith_number":"pith:UNDV2XE7","schema_version":"1.0","canonical_sha256":"a3475d5c9f916febf110e6bb5dca62ff3b4b8b04fd2a81406a64c20f429fcc79","source":{"kind":"arxiv","id":"2311.10649","version":4},"attestation_state":"computed","paper":{"title":"Computable and Faithful Lower Bound on Entanglement Cost","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cond-mat.str-el","cs.IT","hep-th","math-ph","math.IT","math.MP"],"primary_cat":"quant-ph","authors_text":"Chengkai Zhu, Mingrui Jing, Xin Wang","submitted_at":"2023-11-17T17:07:26Z","abstract_excerpt":"Quantifying the minimum entanglement needed to prepare quantum states and implement quantum processes is a key challenge in quantum information theory. In this work, we develop computable and faithful lower bounds on the entanglement cost under quantum operations that completely preserve the positivity of partial transpose (PPT operations), by introducing the generalized divergence of $k$-negativity, a generalization of logarithmic negativity. Our bounds are efficiently computable via semidefinite programming and provide non-trivial values for all states that are non-PPT (NPT), establishing th"},"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":"2311.10649","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-11-17T17:07:26Z","cross_cats_sorted":["cond-mat.str-el","cs.IT","hep-th","math-ph","math.IT","math.MP"],"title_canon_sha256":"37b76bf2025b35326101c66264c13e8b990f155ccd1fe8c69a62ce6067a000e5","abstract_canon_sha256":"31d77801b102e7eb36bffef2eb98a0d3416679f64ea53ea82bda02d69014037b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:59:46.128525Z","signature_b64":"8jOjdJFLKdDqvRMMMdDhpj1hZyjrUfCe/cs0+isIsOUjW98ysUcsxZ6Kfu5ylLaqbA/Txfrr7GyjYpn2EKT4Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3475d5c9f916febf110e6bb5dca62ff3b4b8b04fd2a81406a64c20f429fcc79","last_reissued_at":"2026-07-05T10:59:46.128038Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:59:46.128038Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computable and Faithful Lower Bound on Entanglement Cost","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cond-mat.str-el","cs.IT","hep-th","math-ph","math.IT","math.MP"],"primary_cat":"quant-ph","authors_text":"Chengkai Zhu, Mingrui Jing, Xin Wang","submitted_at":"2023-11-17T17:07:26Z","abstract_excerpt":"Quantifying the minimum entanglement needed to prepare quantum states and implement quantum processes is a key challenge in quantum information theory. In this work, we develop computable and faithful lower bounds on the entanglement cost under quantum operations that completely preserve the positivity of partial transpose (PPT operations), by introducing the generalized divergence of $k$-negativity, a generalization of logarithmic negativity. Our bounds are efficiently computable via semidefinite programming and provide non-trivial values for all states that are non-PPT (NPT), establishing th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.10649","kind":"arxiv","version":4},"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/2311.10649/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":"2311.10649","created_at":"2026-07-05T10:59:46.128099+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.10649v4","created_at":"2026-07-05T10:59:46.128099+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.10649","created_at":"2026-07-05T10:59:46.128099+00:00"},{"alias_kind":"pith_short_12","alias_value":"UNDV2XE7SFX6","created_at":"2026-07-05T10:59:46.128099+00:00"},{"alias_kind":"pith_short_16","alias_value":"UNDV2XE7SFX6X4IQ","created_at":"2026-07-05T10:59:46.128099+00:00"},{"alias_kind":"pith_short_8","alias_value":"UNDV2XE7","created_at":"2026-07-05T10:59:46.128099+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UNDV2XE7SFX6X4IQ425V3STC74","json":"https://pith.science/pith/UNDV2XE7SFX6X4IQ425V3STC74.json","graph_json":"https://pith.science/api/pith-number/UNDV2XE7SFX6X4IQ425V3STC74/graph.json","events_json":"https://pith.science/api/pith-number/UNDV2XE7SFX6X4IQ425V3STC74/events.json","paper":"https://pith.science/paper/UNDV2XE7"},"agent_actions":{"view_html":"https://pith.science/pith/UNDV2XE7SFX6X4IQ425V3STC74","download_json":"https://pith.science/pith/UNDV2XE7SFX6X4IQ425V3STC74.json","view_paper":"https://pith.science/paper/UNDV2XE7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.10649&json=true","fetch_graph":"https://pith.science/api/pith-number/UNDV2XE7SFX6X4IQ425V3STC74/graph.json","fetch_events":"https://pith.science/api/pith-number/UNDV2XE7SFX6X4IQ425V3STC74/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UNDV2XE7SFX6X4IQ425V3STC74/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UNDV2XE7SFX6X4IQ425V3STC74/action/storage_attestation","attest_author":"https://pith.science/pith/UNDV2XE7SFX6X4IQ425V3STC74/action/author_attestation","sign_citation":"https://pith.science/pith/UNDV2XE7SFX6X4IQ425V3STC74/action/citation_signature","submit_replication":"https://pith.science/pith/UNDV2XE7SFX6X4IQ425V3STC74/action/replication_record"}},"created_at":"2026-07-05T10:59:46.128099+00:00","updated_at":"2026-07-05T10:59:46.128099+00:00"}