{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:TY3TB2IGBNJHGTVYQLXHWJVWPJ","short_pith_number":"pith:TY3TB2IG","schema_version":"1.0","canonical_sha256":"9e3730e9060b52734eb882ee7b26b67a489195ce6f53ac965ddd1c3ac2bb9543","source":{"kind":"arxiv","id":"2110.10794","version":2},"attestation_state":"computed","paper":{"title":"Low-overhead fault-tolerant quantum computing using long-range connectivity","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Benjamin J. Brown, Isaac H. Kim, Lawrence Z. Cohen, Stephen D. Bartlett","submitted_at":"2021-10-20T21:49:48Z","abstract_excerpt":"Vast numbers of qubits will be needed for large-scale quantum computing due to the overheads associated with error correction. We present a scheme for low-overhead fault-tolerant quantum computation based on quantum low-density parity-check (LDPC) codes, where long-range interactions enable many logical qubits to be encoded with a modest number of physical qubits. In our approach, logic gates operate via logical Pauli measurements that preserve both the protection of the LDPC codes as well as the low overheads in terms of the required number of additional qubits. Compared with surface codes wi"},"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":"2110.10794","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"quant-ph","submitted_at":"2021-10-20T21:49:48Z","cross_cats_sorted":[],"title_canon_sha256":"cc5eafd9f9278bfc4ed29eebc1a03ab4848d5afa7d54c2c45abb5530ffe4979d","abstract_canon_sha256":"3c1560cc27befb4929e2664e092de0ad33205830e63ff65ac3864ac04f7e53a8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:25:13.022152Z","signature_b64":"u568B/jau8jE3xF4KBzZmu8x2+TnelQPrPnFu+dFDn/IO3pF2LHQFkBIStZSREklL8AMN9H2we7VrTc7K7xUAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e3730e9060b52734eb882ee7b26b67a489195ce6f53ac965ddd1c3ac2bb9543","last_reissued_at":"2026-07-05T04:25:13.021669Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:25:13.021669Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Low-overhead fault-tolerant quantum computing using long-range connectivity","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Benjamin J. Brown, Isaac H. Kim, Lawrence Z. Cohen, Stephen D. Bartlett","submitted_at":"2021-10-20T21:49:48Z","abstract_excerpt":"Vast numbers of qubits will be needed for large-scale quantum computing due to the overheads associated with error correction. We present a scheme for low-overhead fault-tolerant quantum computation based on quantum low-density parity-check (LDPC) codes, where long-range interactions enable many logical qubits to be encoded with a modest number of physical qubits. In our approach, logic gates operate via logical Pauli measurements that preserve both the protection of the LDPC codes as well as the low overheads in terms of the required number of additional qubits. Compared with surface codes wi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.10794","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/2110.10794/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":"2110.10794","created_at":"2026-07-05T04:25:13.021726+00:00"},{"alias_kind":"arxiv_version","alias_value":"2110.10794v2","created_at":"2026-07-05T04:25:13.021726+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.10794","created_at":"2026-07-05T04:25:13.021726+00:00"},{"alias_kind":"pith_short_12","alias_value":"TY3TB2IGBNJH","created_at":"2026-07-05T04:25:13.021726+00:00"},{"alias_kind":"pith_short_16","alias_value":"TY3TB2IGBNJHGTVY","created_at":"2026-07-05T04:25:13.021726+00:00"},{"alias_kind":"pith_short_8","alias_value":"TY3TB2IG","created_at":"2026-07-05T04:25:13.021726+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.25118","citing_title":"A framework for the benchmarking of transport-induced excitations in shuttling-based ion-trap quantum processors","ref_index":7,"is_internal_anchor":false},{"citing_arxiv_id":"2602.11457","citing_title":"The Pinnacle Architecture: Reducing the cost of breaking RSA-2048 to 100 000 physical qubits using quantum LDPC codes","ref_index":40,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TY3TB2IGBNJHGTVYQLXHWJVWPJ","json":"https://pith.science/pith/TY3TB2IGBNJHGTVYQLXHWJVWPJ.json","graph_json":"https://pith.science/api/pith-number/TY3TB2IGBNJHGTVYQLXHWJVWPJ/graph.json","events_json":"https://pith.science/api/pith-number/TY3TB2IGBNJHGTVYQLXHWJVWPJ/events.json","paper":"https://pith.science/paper/TY3TB2IG"},"agent_actions":{"view_html":"https://pith.science/pith/TY3TB2IGBNJHGTVYQLXHWJVWPJ","download_json":"https://pith.science/pith/TY3TB2IGBNJHGTVYQLXHWJVWPJ.json","view_paper":"https://pith.science/paper/TY3TB2IG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2110.10794&json=true","fetch_graph":"https://pith.science/api/pith-number/TY3TB2IGBNJHGTVYQLXHWJVWPJ/graph.json","fetch_events":"https://pith.science/api/pith-number/TY3TB2IGBNJHGTVYQLXHWJVWPJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TY3TB2IGBNJHGTVYQLXHWJVWPJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TY3TB2IGBNJHGTVYQLXHWJVWPJ/action/storage_attestation","attest_author":"https://pith.science/pith/TY3TB2IGBNJHGTVYQLXHWJVWPJ/action/author_attestation","sign_citation":"https://pith.science/pith/TY3TB2IGBNJHGTVYQLXHWJVWPJ/action/citation_signature","submit_replication":"https://pith.science/pith/TY3TB2IGBNJHGTVYQLXHWJVWPJ/action/replication_record"}},"created_at":"2026-07-05T04:25:13.021726+00:00","updated_at":"2026-07-05T04:25:13.021726+00:00"}