{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:S3YSBHBA7XXFL5KHSNSDZANFK3","short_pith_number":"pith:S3YSBHBA","schema_version":"1.0","canonical_sha256":"96f1209c20fdee55f54793643c81a556faad1523f29d8a0e9b6e672e952b3e6f","source":{"kind":"arxiv","id":"2303.11465","version":2},"attestation_state":"computed","paper":{"title":"Near-term $n$ to $k$ distillation protocols using graph codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"David Elkouss, Dion Gijswijt, Kenneth Goodenough, Sarah Jansen, S\\'ebastian de Bone, Stefan Krastanov, Vaishnavi L. Addala","submitted_at":"2023-03-20T21:46:17Z","abstract_excerpt":"Noisy hardware forms one of the main hurdles to the realization of a near-term quantum internet. Distillation protocols allows one to overcome this noise at the cost of an increased overhead. We consider here an experimentally relevant class of distillation protocols, which distill $n$ to $k$ end-to-end entangled pairs using bilocal Clifford operations, a single round of communication and a possible final local operation depending on the observed measurement outcomes. In the case of permutationally invariant depolarizing noise on the input states, we find a correspondence between these distill"},"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":"2303.11465","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-03-20T21:46:17Z","cross_cats_sorted":[],"title_canon_sha256":"811e7a103721a051ef9304edd4e16f766e248fbdb35ac4568bf0a8adc3360d8a","abstract_canon_sha256":"56c094ea7b7bfc358f8a6d65d4a4ee0883922142a111080c3b7a0144fd801ea1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:41:58.609683Z","signature_b64":"xZvs0Ip0xNxlZ+tLxxtV8mQZDRTDf8mWwJLVowb8B3oF4xsKxp57wQRcyVWNwO15mGLR+kbDVc+ysko00J+lAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"96f1209c20fdee55f54793643c81a556faad1523f29d8a0e9b6e672e952b3e6f","last_reissued_at":"2026-07-05T08:41:58.609254Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:41:58.609254Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near-term $n$ to $k$ distillation protocols using graph codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"David Elkouss, Dion Gijswijt, Kenneth Goodenough, Sarah Jansen, S\\'ebastian de Bone, Stefan Krastanov, Vaishnavi L. Addala","submitted_at":"2023-03-20T21:46:17Z","abstract_excerpt":"Noisy hardware forms one of the main hurdles to the realization of a near-term quantum internet. Distillation protocols allows one to overcome this noise at the cost of an increased overhead. We consider here an experimentally relevant class of distillation protocols, which distill $n$ to $k$ end-to-end entangled pairs using bilocal Clifford operations, a single round of communication and a possible final local operation depending on the observed measurement outcomes. In the case of permutationally invariant depolarizing noise on the input states, we find a correspondence between these distill"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.11465","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/2303.11465/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":"2303.11465","created_at":"2026-07-05T08:41:58.609309+00:00"},{"alias_kind":"arxiv_version","alias_value":"2303.11465v2","created_at":"2026-07-05T08:41:58.609309+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.11465","created_at":"2026-07-05T08:41:58.609309+00:00"},{"alias_kind":"pith_short_12","alias_value":"S3YSBHBA7XXF","created_at":"2026-07-05T08:41:58.609309+00:00"},{"alias_kind":"pith_short_16","alias_value":"S3YSBHBA7XXFL5KH","created_at":"2026-07-05T08:41:58.609309+00:00"},{"alias_kind":"pith_short_8","alias_value":"S3YSBHBA","created_at":"2026-07-05T08:41:58.609309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.14739","citing_title":"Failure Tolerant Phase-Only Indoor Positioning via Deep Learning","ref_index":42,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/S3YSBHBA7XXFL5KHSNSDZANFK3","json":"https://pith.science/pith/S3YSBHBA7XXFL5KHSNSDZANFK3.json","graph_json":"https://pith.science/api/pith-number/S3YSBHBA7XXFL5KHSNSDZANFK3/graph.json","events_json":"https://pith.science/api/pith-number/S3YSBHBA7XXFL5KHSNSDZANFK3/events.json","paper":"https://pith.science/paper/S3YSBHBA"},"agent_actions":{"view_html":"https://pith.science/pith/S3YSBHBA7XXFL5KHSNSDZANFK3","download_json":"https://pith.science/pith/S3YSBHBA7XXFL5KHSNSDZANFK3.json","view_paper":"https://pith.science/paper/S3YSBHBA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2303.11465&json=true","fetch_graph":"https://pith.science/api/pith-number/S3YSBHBA7XXFL5KHSNSDZANFK3/graph.json","fetch_events":"https://pith.science/api/pith-number/S3YSBHBA7XXFL5KHSNSDZANFK3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S3YSBHBA7XXFL5KHSNSDZANFK3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S3YSBHBA7XXFL5KHSNSDZANFK3/action/storage_attestation","attest_author":"https://pith.science/pith/S3YSBHBA7XXFL5KHSNSDZANFK3/action/author_attestation","sign_citation":"https://pith.science/pith/S3YSBHBA7XXFL5KHSNSDZANFK3/action/citation_signature","submit_replication":"https://pith.science/pith/S3YSBHBA7XXFL5KHSNSDZANFK3/action/replication_record"}},"created_at":"2026-07-05T08:41:58.609309+00:00","updated_at":"2026-07-05T08:41:58.609309+00:00"}