{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:GJXFEGNNJJVSZ7M4ADLQ22IODB","short_pith_number":"pith:GJXFEGNN","schema_version":"1.0","canonical_sha256":"326e5219ad4a6b2cfd9c00d70d690e184c7432c9cad81901d64ed85a7e0de4ae","source":{"kind":"arxiv","id":"2411.14638","version":2},"attestation_state":"computed","paper":{"title":"Achieving computational gains with quantum error-correction primitives: Generation of long-range entanglement enhanced by error detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Adrian Tan, Ashish Kakkar, Gavin S. Hartnett, Haoran Liao, Michael Hush, Michael J. Biercuk, Pranav S. Mundada, Yuval Baum","submitted_at":"2024-11-22T00:08:23Z","abstract_excerpt":"The resource overhead required to achieve net computational benefits from quantum error correction (QEC) limits its utility while current systems remain constrained in size, despite exceptional progress in experimental demonstrations. In this paper, we demonstrate that the strategic application of QEC primitives without logical encoding can yield significant advantages on superconducting processors--relative to any alternative error-reduction strategy--while only requiring a modest overhead. We first present a novel protocol for implementing long-range CNOT gates that relies on a unitarily pre"},"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":"2411.14638","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-11-22T00:08:23Z","cross_cats_sorted":[],"title_canon_sha256":"86f0db51bedb111c7505bda91fac369f62b5e4ae0b11333856bacf6b5941b11a","abstract_canon_sha256":"67910c24c814cc06fbe8cf0dbca207fc2b4f6fa4c4c4651e75970e66537a7d5e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:04:20.061412Z","signature_b64":"lOaF+fLSpv35QVBOSDCV1snQVoS3Z1cl3emqf4RezILBKu8JoHIyfOfxTLJiRIb2C+JxRd1B2KHrJYswRBY6AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"326e5219ad4a6b2cfd9c00d70d690e184c7432c9cad81901d64ed85a7e0de4ae","last_reissued_at":"2026-07-05T11:04:20.060862Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:04:20.060862Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Achieving computational gains with quantum error-correction primitives: Generation of long-range entanglement enhanced by error detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Adrian Tan, Ashish Kakkar, Gavin S. Hartnett, Haoran Liao, Michael Hush, Michael J. Biercuk, Pranav S. Mundada, Yuval Baum","submitted_at":"2024-11-22T00:08:23Z","abstract_excerpt":"The resource overhead required to achieve net computational benefits from quantum error correction (QEC) limits its utility while current systems remain constrained in size, despite exceptional progress in experimental demonstrations. In this paper, we demonstrate that the strategic application of QEC primitives without logical encoding can yield significant advantages on superconducting processors--relative to any alternative error-reduction strategy--while only requiring a modest overhead. We first present a novel protocol for implementing long-range CNOT gates that relies on a unitarily pre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.14638","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/2411.14638/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":"2411.14638","created_at":"2026-07-05T11:04:20.060923+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.14638v2","created_at":"2026-07-05T11:04:20.060923+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.14638","created_at":"2026-07-05T11:04:20.060923+00:00"},{"alias_kind":"pith_short_12","alias_value":"GJXFEGNNJJVS","created_at":"2026-07-05T11:04:20.060923+00:00"},{"alias_kind":"pith_short_16","alias_value":"GJXFEGNNJJVSZ7M4","created_at":"2026-07-05T11:04:20.060923+00:00"},{"alias_kind":"pith_short_8","alias_value":"GJXFEGNN","created_at":"2026-07-05T11:04:20.060923+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2504.18429","citing_title":"CHSH Violations using Dynamic Circuits","ref_index":14,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GJXFEGNNJJVSZ7M4ADLQ22IODB","json":"https://pith.science/pith/GJXFEGNNJJVSZ7M4ADLQ22IODB.json","graph_json":"https://pith.science/api/pith-number/GJXFEGNNJJVSZ7M4ADLQ22IODB/graph.json","events_json":"https://pith.science/api/pith-number/GJXFEGNNJJVSZ7M4ADLQ22IODB/events.json","paper":"https://pith.science/paper/GJXFEGNN"},"agent_actions":{"view_html":"https://pith.science/pith/GJXFEGNNJJVSZ7M4ADLQ22IODB","download_json":"https://pith.science/pith/GJXFEGNNJJVSZ7M4ADLQ22IODB.json","view_paper":"https://pith.science/paper/GJXFEGNN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.14638&json=true","fetch_graph":"https://pith.science/api/pith-number/GJXFEGNNJJVSZ7M4ADLQ22IODB/graph.json","fetch_events":"https://pith.science/api/pith-number/GJXFEGNNJJVSZ7M4ADLQ22IODB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GJXFEGNNJJVSZ7M4ADLQ22IODB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GJXFEGNNJJVSZ7M4ADLQ22IODB/action/storage_attestation","attest_author":"https://pith.science/pith/GJXFEGNNJJVSZ7M4ADLQ22IODB/action/author_attestation","sign_citation":"https://pith.science/pith/GJXFEGNNJJVSZ7M4ADLQ22IODB/action/citation_signature","submit_replication":"https://pith.science/pith/GJXFEGNNJJVSZ7M4ADLQ22IODB/action/replication_record"}},"created_at":"2026-07-05T11:04:20.060923+00:00","updated_at":"2026-07-05T11:04:20.060923+00:00"}