{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:BOSLEISRVFHASFEN4C64RNPB4C","short_pith_number":"pith:BOSLEISR","schema_version":"1.0","canonical_sha256":"0ba4b22251a94e09148de0bdc8b5e1e0a64a44690179538b767e1b35ea04f1c9","source":{"kind":"arxiv","id":"2109.00793","version":1},"attestation_state":"computed","paper":{"title":"Optimal entanglement swapping in quantum repeaters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Evgeny Shchukin, Peter van Loock","submitted_at":"2021-09-02T09:02:40Z","abstract_excerpt":"We formulate the problem of finding the optimal entanglement swapping scheme in a quantum repeater chain as a Markov decision process and present its solution for different repeater's sizes. Based on this, we are able to demonstrate that the commonly used \"doubling\" scheme for performing probabilistic entanglement swapping of probabilistically distributed entangled qubit pairs in quantum repeaters does not always produce the best possible raw rate. Focussing on this figure of merit, without considering additional probabilistic elements for error suppression such as entanglement distillation on"},"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":"2109.00793","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-09-02T09:02:40Z","cross_cats_sorted":[],"title_canon_sha256":"2ad1fb8f1c70411b357872ec7d6dc838edb91fffee53cc25e28c2ebe7bc2158b","abstract_canon_sha256":"08748ca13624405cd18682d4995c9f62381c6d1b29dc3bfd21adcea5c3ee0474"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:18:01.620759Z","signature_b64":"wWus4zlkyDRPA9JjJWTlfU6TTc416mrzky0qlfvxlOU+89D+pTsqj358pf+oU55NxGd8X8xhqdZybvVCTVemBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ba4b22251a94e09148de0bdc8b5e1e0a64a44690179538b767e1b35ea04f1c9","last_reissued_at":"2026-07-05T04:18:01.620272Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:18:01.620272Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal entanglement swapping in quantum repeaters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Evgeny Shchukin, Peter van Loock","submitted_at":"2021-09-02T09:02:40Z","abstract_excerpt":"We formulate the problem of finding the optimal entanglement swapping scheme in a quantum repeater chain as a Markov decision process and present its solution for different repeater's sizes. Based on this, we are able to demonstrate that the commonly used \"doubling\" scheme for performing probabilistic entanglement swapping of probabilistically distributed entangled qubit pairs in quantum repeaters does not always produce the best possible raw rate. Focussing on this figure of merit, without considering additional probabilistic elements for error suppression such as entanglement distillation on"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.00793","kind":"arxiv","version":1},"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/2109.00793/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":"2109.00793","created_at":"2026-07-05T04:18:01.620341+00:00"},{"alias_kind":"arxiv_version","alias_value":"2109.00793v1","created_at":"2026-07-05T04:18:01.620341+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.00793","created_at":"2026-07-05T04:18:01.620341+00:00"},{"alias_kind":"pith_short_12","alias_value":"BOSLEISRVFHA","created_at":"2026-07-05T04:18:01.620341+00:00"},{"alias_kind":"pith_short_16","alias_value":"BOSLEISRVFHASFEN","created_at":"2026-07-05T04:18:01.620341+00:00"},{"alias_kind":"pith_short_8","alias_value":"BOSLEISR","created_at":"2026-07-05T04:18:01.620341+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.04252","citing_title":"A resource- and computationally-efficient protocol for multipartite entanglement distribution in Bell-pair networks","ref_index":91,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BOSLEISRVFHASFEN4C64RNPB4C","json":"https://pith.science/pith/BOSLEISRVFHASFEN4C64RNPB4C.json","graph_json":"https://pith.science/api/pith-number/BOSLEISRVFHASFEN4C64RNPB4C/graph.json","events_json":"https://pith.science/api/pith-number/BOSLEISRVFHASFEN4C64RNPB4C/events.json","paper":"https://pith.science/paper/BOSLEISR"},"agent_actions":{"view_html":"https://pith.science/pith/BOSLEISRVFHASFEN4C64RNPB4C","download_json":"https://pith.science/pith/BOSLEISRVFHASFEN4C64RNPB4C.json","view_paper":"https://pith.science/paper/BOSLEISR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2109.00793&json=true","fetch_graph":"https://pith.science/api/pith-number/BOSLEISRVFHASFEN4C64RNPB4C/graph.json","fetch_events":"https://pith.science/api/pith-number/BOSLEISRVFHASFEN4C64RNPB4C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BOSLEISRVFHASFEN4C64RNPB4C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BOSLEISRVFHASFEN4C64RNPB4C/action/storage_attestation","attest_author":"https://pith.science/pith/BOSLEISRVFHASFEN4C64RNPB4C/action/author_attestation","sign_citation":"https://pith.science/pith/BOSLEISRVFHASFEN4C64RNPB4C/action/citation_signature","submit_replication":"https://pith.science/pith/BOSLEISRVFHASFEN4C64RNPB4C/action/replication_record"}},"created_at":"2026-07-05T04:18:01.620341+00:00","updated_at":"2026-07-05T04:18:01.620341+00:00"}