{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:4XBWV3ZCP6SCZYE4AXPHTBUNH2","short_pith_number":"pith:4XBWV3ZC","schema_version":"1.0","canonical_sha256":"e5c36aef227fa42ce09c05de79868d3e821be0516b430b4aa649a339e0dd9062","source":{"kind":"arxiv","id":"2401.10770","version":2},"attestation_state":"computed","paper":{"title":"Thresholds for the distributed surface code in the presence of memory decoherence","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Conor E. Bradley, David Elkouss, Paul M\\\"oller, S\\'ebastian de Bone, Tim H. Taminiau","submitted_at":"2024-01-19T15:41:00Z","abstract_excerpt":"In the search for scalable, fault-tolerant quantum computing, distributed quantum computers are promising candidates. These systems can be realized in large-scale quantum networks or condensed onto a single chip with closely situated nodes. We present a framework for numerical simulations of a memory channel using the distributed toric surface code, where each data qubit of the code is part of a separate node, and the error-detection performance depends on the quality of four-qubit Greenberger-Horne-Zeilinger (GHZ) states generated between the nodes. We quantitatively investigate the effect of"},"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":"2401.10770","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-01-19T15:41:00Z","cross_cats_sorted":[],"title_canon_sha256":"b3092e1d9f61fe5e520dceb684db2217875771447b363e617c59b5d08437f6dd","abstract_canon_sha256":"b163802be80ff39e10aa9c674725edd4dc4213e7874e2c7d8f907d1993091d79"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:42:01.429616Z","signature_b64":"5PusyFSLxJCs0RkR7pnakqV2TGs4Chj6Dck7D/4AXqQX5f+j/9N9yuuNe0byjcVTWj8uF6GKVUEe8TlxY4yCAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e5c36aef227fa42ce09c05de79868d3e821be0516b430b4aa649a339e0dd9062","last_reissued_at":"2026-07-05T08:42:01.429152Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:42:01.429152Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Thresholds for the distributed surface code in the presence of memory decoherence","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Conor E. Bradley, David Elkouss, Paul M\\\"oller, S\\'ebastian de Bone, Tim H. Taminiau","submitted_at":"2024-01-19T15:41:00Z","abstract_excerpt":"In the search for scalable, fault-tolerant quantum computing, distributed quantum computers are promising candidates. These systems can be realized in large-scale quantum networks or condensed onto a single chip with closely situated nodes. We present a framework for numerical simulations of a memory channel using the distributed toric surface code, where each data qubit of the code is part of a separate node, and the error-detection performance depends on the quality of four-qubit Greenberger-Horne-Zeilinger (GHZ) states generated between the nodes. We quantitatively investigate the effect of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.10770","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/2401.10770/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":"2401.10770","created_at":"2026-07-05T08:42:01.429211+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.10770v2","created_at":"2026-07-05T08:42:01.429211+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.10770","created_at":"2026-07-05T08:42:01.429211+00:00"},{"alias_kind":"pith_short_12","alias_value":"4XBWV3ZCP6SC","created_at":"2026-07-05T08:42:01.429211+00:00"},{"alias_kind":"pith_short_16","alias_value":"4XBWV3ZCP6SCZYE4","created_at":"2026-07-05T08:42:01.429211+00:00"},{"alias_kind":"pith_short_8","alias_value":"4XBWV3ZC","created_at":"2026-07-05T08:42:01.429211+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.25026","citing_title":"Networked Realization of Quantum LDPC Codes","ref_index":2,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4XBWV3ZCP6SCZYE4AXPHTBUNH2","json":"https://pith.science/pith/4XBWV3ZCP6SCZYE4AXPHTBUNH2.json","graph_json":"https://pith.science/api/pith-number/4XBWV3ZCP6SCZYE4AXPHTBUNH2/graph.json","events_json":"https://pith.science/api/pith-number/4XBWV3ZCP6SCZYE4AXPHTBUNH2/events.json","paper":"https://pith.science/paper/4XBWV3ZC"},"agent_actions":{"view_html":"https://pith.science/pith/4XBWV3ZCP6SCZYE4AXPHTBUNH2","download_json":"https://pith.science/pith/4XBWV3ZCP6SCZYE4AXPHTBUNH2.json","view_paper":"https://pith.science/paper/4XBWV3ZC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.10770&json=true","fetch_graph":"https://pith.science/api/pith-number/4XBWV3ZCP6SCZYE4AXPHTBUNH2/graph.json","fetch_events":"https://pith.science/api/pith-number/4XBWV3ZCP6SCZYE4AXPHTBUNH2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4XBWV3ZCP6SCZYE4AXPHTBUNH2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4XBWV3ZCP6SCZYE4AXPHTBUNH2/action/storage_attestation","attest_author":"https://pith.science/pith/4XBWV3ZCP6SCZYE4AXPHTBUNH2/action/author_attestation","sign_citation":"https://pith.science/pith/4XBWV3ZCP6SCZYE4AXPHTBUNH2/action/citation_signature","submit_replication":"https://pith.science/pith/4XBWV3ZCP6SCZYE4AXPHTBUNH2/action/replication_record"}},"created_at":"2026-07-05T08:42:01.429211+00:00","updated_at":"2026-07-05T08:42:01.429211+00:00"}