{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:ORDDC6HWHXW2MSLAPWPCVXCCPY","short_pith_number":"pith:ORDDC6HW","schema_version":"1.0","canonical_sha256":"74463178f63deda649607d9e2adc427e32815aefb9b0e845f196b8e474200c3a","source":{"kind":"arxiv","id":"2201.09257","version":2},"attestation_state":"computed","paper":{"title":"Computable lower bounds on the entanglement cost of quantum channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP"],"primary_cat":"quant-ph","authors_text":"Bartosz Regula, Ludovico Lami","submitted_at":"2022-01-23T13:05:36Z","abstract_excerpt":"A class of lower bounds for the entanglement cost of any quantum state was recently introduced in [arXiv:2111.02438] in the form of entanglement monotones known as the tempered robustness and tempered negativity. Here we extend their definitions to point-to-point quantum channels, establishing a lower bound for the asymptotic entanglement cost of any channel, whether finite or infinite dimensional. This leads, in particular, to a bound that is computable as a semidefinite program and that can outperform previously known lower bounds, including ones based on quantum relative entropy. In the cou"},"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":"2201.09257","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-01-23T13:05:36Z","cross_cats_sorted":["math-ph","math.MP"],"title_canon_sha256":"da986612f33835eae124eae09a4c0041b104fe52224eff9d601fbc97e82e6061","abstract_canon_sha256":"4ff3106ee2a40faf9d6c14bd43432346ece64a7847cf7461e631d22e8bd96b9c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:42:00.480042Z","signature_b64":"IJJoBWPYHJ2A0fLeS+iO/xm3OUm/SFVtABN2yX3rtS+Snp9uOTu56MmH3V0Wx8Xw7C2B5MOoZZQPZRkNuIiUBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"74463178f63deda649607d9e2adc427e32815aefb9b0e845f196b8e474200c3a","last_reissued_at":"2026-07-05T05:42:00.479709Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:42:00.479709Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computable lower bounds on the entanglement cost of quantum channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP"],"primary_cat":"quant-ph","authors_text":"Bartosz Regula, Ludovico Lami","submitted_at":"2022-01-23T13:05:36Z","abstract_excerpt":"A class of lower bounds for the entanglement cost of any quantum state was recently introduced in [arXiv:2111.02438] in the form of entanglement monotones known as the tempered robustness and tempered negativity. Here we extend their definitions to point-to-point quantum channels, establishing a lower bound for the asymptotic entanglement cost of any channel, whether finite or infinite dimensional. This leads, in particular, to a bound that is computable as a semidefinite program and that can outperform previously known lower bounds, including ones based on quantum relative entropy. In the cou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.09257","kind":"arxiv","version":2},"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/2201.09257/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":"2201.09257","created_at":"2026-07-05T05:42:00.479764+00:00"},{"alias_kind":"arxiv_version","alias_value":"2201.09257v2","created_at":"2026-07-05T05:42:00.479764+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.09257","created_at":"2026-07-05T05:42:00.479764+00:00"},{"alias_kind":"pith_short_12","alias_value":"ORDDC6HWHXW2","created_at":"2026-07-05T05:42:00.479764+00:00"},{"alias_kind":"pith_short_16","alias_value":"ORDDC6HWHXW2MSLA","created_at":"2026-07-05T05:42:00.479764+00:00"},{"alias_kind":"pith_short_8","alias_value":"ORDDC6HW","created_at":"2026-07-05T05:42:00.479764+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/ORDDC6HWHXW2MSLAPWPCVXCCPY","json":"https://pith.science/pith/ORDDC6HWHXW2MSLAPWPCVXCCPY.json","graph_json":"https://pith.science/api/pith-number/ORDDC6HWHXW2MSLAPWPCVXCCPY/graph.json","events_json":"https://pith.science/api/pith-number/ORDDC6HWHXW2MSLAPWPCVXCCPY/events.json","paper":"https://pith.science/paper/ORDDC6HW"},"agent_actions":{"view_html":"https://pith.science/pith/ORDDC6HWHXW2MSLAPWPCVXCCPY","download_json":"https://pith.science/pith/ORDDC6HWHXW2MSLAPWPCVXCCPY.json","view_paper":"https://pith.science/paper/ORDDC6HW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2201.09257&json=true","fetch_graph":"https://pith.science/api/pith-number/ORDDC6HWHXW2MSLAPWPCVXCCPY/graph.json","fetch_events":"https://pith.science/api/pith-number/ORDDC6HWHXW2MSLAPWPCVXCCPY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ORDDC6HWHXW2MSLAPWPCVXCCPY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ORDDC6HWHXW2MSLAPWPCVXCCPY/action/storage_attestation","attest_author":"https://pith.science/pith/ORDDC6HWHXW2MSLAPWPCVXCCPY/action/author_attestation","sign_citation":"https://pith.science/pith/ORDDC6HWHXW2MSLAPWPCVXCCPY/action/citation_signature","submit_replication":"https://pith.science/pith/ORDDC6HWHXW2MSLAPWPCVXCCPY/action/replication_record"}},"created_at":"2026-07-05T05:42:00.479764+00:00","updated_at":"2026-07-05T05:42:00.479764+00:00"}