{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:3CBEXSKLIDAHV4VVT4SD4EYKSC","short_pith_number":"pith:3CBEXSKL","schema_version":"1.0","canonical_sha256":"d8824bc94b40c07af2b59f243e130a90bebfa07584c0c53b86e141b0b613499c","source":{"kind":"arxiv","id":"1209.0510","version":4},"attestation_state":"computed","paper":{"title":"A bridge to lower overhead quantum computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Austin G. Fowler, Simon J. Devitt","submitted_at":"2012-09-04T01:52:56Z","abstract_excerpt":"Two primary challenges stand in the way of practical large-scale quantum computation, namely achieving sufficiently low error rate quantum gates and implementing interesting quantum algorithms with a physically reasonable number of qubits. In this work we address the second challenge, presenting a new technique, bridge compression, which enables remarkably low volume structures to be found that implement complex computations in the surface code. The surface code has a number of highly desirable properties, including the ability to achieve arbitrarily reliable computation given sufficient qubit"},"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":"1209.0510","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-09-04T01:52:56Z","cross_cats_sorted":[],"title_canon_sha256":"32e11fd044f989feac01d5262baad0dcc9210280f91818d542f0b2948d5e3543","abstract_canon_sha256":"7ec8557c8219eef8d0faf43e921f8b641fc99eae3bdb8dac4beded9e2b9ae83c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:28:42.599362Z","signature_b64":"Ze+RaDrWAYXXu4+GmeUoVHaB2jqd8exRb2PRVrfC7+QF2Ine/JQ3EDS/1GRBxbTcDXh70lBsdkmKd+i/aMUnBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d8824bc94b40c07af2b59f243e130a90bebfa07584c0c53b86e141b0b613499c","last_reissued_at":"2026-05-18T03:28:42.598668Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:28:42.598668Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A bridge to lower overhead quantum computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Austin G. Fowler, Simon J. Devitt","submitted_at":"2012-09-04T01:52:56Z","abstract_excerpt":"Two primary challenges stand in the way of practical large-scale quantum computation, namely achieving sufficiently low error rate quantum gates and implementing interesting quantum algorithms with a physically reasonable number of qubits. In this work we address the second challenge, presenting a new technique, bridge compression, which enables remarkably low volume structures to be found that implement complex computations in the surface code. The surface code has a number of highly desirable properties, including the ability to achieve arbitrarily reliable computation given sufficient qubit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.0510","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1209.0510","created_at":"2026-05-18T03:28:42.598782+00:00"},{"alias_kind":"arxiv_version","alias_value":"1209.0510v4","created_at":"2026-05-18T03:28:42.598782+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.0510","created_at":"2026-05-18T03:28:42.598782+00:00"},{"alias_kind":"pith_short_12","alias_value":"3CBEXSKLIDAH","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_16","alias_value":"3CBEXSKLIDAHV4VV","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_8","alias_value":"3CBEXSKL","created_at":"2026-05-18T12:26:50.516681+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2603.28627","citing_title":"Shor's algorithm is possible with as few as 10,000 reconfigurable atomic qubits","ref_index":40,"is_internal_anchor":true},{"citing_arxiv_id":"2409.17595","citing_title":"Magic state cultivation: growing T states as cheap as CNOT gates","ref_index":17,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3CBEXSKLIDAHV4VVT4SD4EYKSC","json":"https://pith.science/pith/3CBEXSKLIDAHV4VVT4SD4EYKSC.json","graph_json":"https://pith.science/api/pith-number/3CBEXSKLIDAHV4VVT4SD4EYKSC/graph.json","events_json":"https://pith.science/api/pith-number/3CBEXSKLIDAHV4VVT4SD4EYKSC/events.json","paper":"https://pith.science/paper/3CBEXSKL"},"agent_actions":{"view_html":"https://pith.science/pith/3CBEXSKLIDAHV4VVT4SD4EYKSC","download_json":"https://pith.science/pith/3CBEXSKLIDAHV4VVT4SD4EYKSC.json","view_paper":"https://pith.science/paper/3CBEXSKL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1209.0510&json=true","fetch_graph":"https://pith.science/api/pith-number/3CBEXSKLIDAHV4VVT4SD4EYKSC/graph.json","fetch_events":"https://pith.science/api/pith-number/3CBEXSKLIDAHV4VVT4SD4EYKSC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3CBEXSKLIDAHV4VVT4SD4EYKSC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3CBEXSKLIDAHV4VVT4SD4EYKSC/action/storage_attestation","attest_author":"https://pith.science/pith/3CBEXSKLIDAHV4VVT4SD4EYKSC/action/author_attestation","sign_citation":"https://pith.science/pith/3CBEXSKLIDAHV4VVT4SD4EYKSC/action/citation_signature","submit_replication":"https://pith.science/pith/3CBEXSKLIDAHV4VVT4SD4EYKSC/action/replication_record"}},"created_at":"2026-05-18T03:28:42.598782+00:00","updated_at":"2026-05-18T03:28:42.598782+00:00"}