{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2003:TMGLJA4SNV7GWFNRE2WC3PFXLK","short_pith_number":"pith:TMGLJA4S","schema_version":"1.0","canonical_sha256":"9b0cb483926d7e6b15b126ac2dbcb75ab7682eb25ebe51e023349ad4db02a019","source":{"kind":"arxiv","id":"quant-ph/0310097","version":4},"attestation_state":"computed","paper":{"title":"The Minimum Distance Problem for Two-Way Entanglement Purification","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andris Ambainis, Daniel Gottesman","submitted_at":"2003-10-14T21:30:38Z","abstract_excerpt":"Entanglement purification takes a number of noisy EPR pairs and processes them to produce a smaller number of more reliable pairs. If this is done with only a forward classical side channel, the procedure is equivalent to using a quantum error-correcting code (QECC). We instead investigate entanglement purification protocols with two-way classical side channels (2-EPPs) for finite block sizes. In particular, we consider the analog of the minimum distance problem for QECCs, and show that 2-EPPs can exceed the quantum Hamming bound and the quantum Singleton bound. We also show that 2-EPPs can ac"},"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":"quant-ph/0310097","kind":"arxiv","version":4},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2003-10-14T21:30:38Z","cross_cats_sorted":[],"title_canon_sha256":"60e4d97a9b68641f6319ec8a86521589ea8642fbb309add957ec883dd3ab02a4","abstract_canon_sha256":"c95c3fe7d6cd851dae2a24ea54f92ac050392165f542c3a5394cc06c6155d524"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:05:25.559496Z","signature_b64":"2x/DHrrr6aAeqpsFH7Y+X2hLTGKMhgjynRUhXAZ3NpBLBAc7Q/JZ8pOl92O7fxYhdqO1CgekRjrEYL/mbfAxAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b0cb483926d7e6b15b126ac2dbcb75ab7682eb25ebe51e023349ad4db02a019","last_reissued_at":"2026-07-04T15:05:25.559101Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:05:25.559101Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Minimum Distance Problem for Two-Way Entanglement Purification","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andris Ambainis, Daniel Gottesman","submitted_at":"2003-10-14T21:30:38Z","abstract_excerpt":"Entanglement purification takes a number of noisy EPR pairs and processes them to produce a smaller number of more reliable pairs. If this is done with only a forward classical side channel, the procedure is equivalent to using a quantum error-correcting code (QECC). We instead investigate entanglement purification protocols with two-way classical side channels (2-EPPs) for finite block sizes. In particular, we consider the analog of the minimum distance problem for QECCs, and show that 2-EPPs can exceed the quantum Hamming bound and the quantum Singleton bound. We also show that 2-EPPs can ac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0310097","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/quant-ph/0310097/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":"quant-ph/0310097","created_at":"2026-07-04T15:05:25.559161+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0310097v4","created_at":"2026-07-04T15:05:25.559161+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0310097","created_at":"2026-07-04T15:05:25.559161+00:00"},{"alias_kind":"pith_short_12","alias_value":"TMGLJA4SNV7G","created_at":"2026-07-04T15:05:25.559161+00:00"},{"alias_kind":"pith_short_16","alias_value":"TMGLJA4SNV7GWFNR","created_at":"2026-07-04T15:05:25.559161+00:00"},{"alias_kind":"pith_short_8","alias_value":"TMGLJA4S","created_at":"2026-07-04T15:05:25.559161+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/TMGLJA4SNV7GWFNRE2WC3PFXLK","json":"https://pith.science/pith/TMGLJA4SNV7GWFNRE2WC3PFXLK.json","graph_json":"https://pith.science/api/pith-number/TMGLJA4SNV7GWFNRE2WC3PFXLK/graph.json","events_json":"https://pith.science/api/pith-number/TMGLJA4SNV7GWFNRE2WC3PFXLK/events.json","paper":"https://pith.science/paper/TMGLJA4S"},"agent_actions":{"view_html":"https://pith.science/pith/TMGLJA4SNV7GWFNRE2WC3PFXLK","download_json":"https://pith.science/pith/TMGLJA4SNV7GWFNRE2WC3PFXLK.json","view_paper":"https://pith.science/paper/TMGLJA4S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0310097&json=true","fetch_graph":"https://pith.science/api/pith-number/TMGLJA4SNV7GWFNRE2WC3PFXLK/graph.json","fetch_events":"https://pith.science/api/pith-number/TMGLJA4SNV7GWFNRE2WC3PFXLK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TMGLJA4SNV7GWFNRE2WC3PFXLK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TMGLJA4SNV7GWFNRE2WC3PFXLK/action/storage_attestation","attest_author":"https://pith.science/pith/TMGLJA4SNV7GWFNRE2WC3PFXLK/action/author_attestation","sign_citation":"https://pith.science/pith/TMGLJA4SNV7GWFNRE2WC3PFXLK/action/citation_signature","submit_replication":"https://pith.science/pith/TMGLJA4SNV7GWFNRE2WC3PFXLK/action/replication_record"}},"created_at":"2026-07-04T15:05:25.559161+00:00","updated_at":"2026-07-04T15:05:25.559161+00:00"}