{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:V2BIUOZV3BEWVNCMYEZBKFXW24","short_pith_number":"pith:V2BIUOZV","schema_version":"1.0","canonical_sha256":"ae828a3b35d8496ab44cc1321516f6d70e8955f0734ad9762f7a240ee8b00f95","source":{"kind":"arxiv","id":"2201.07806","version":2},"attestation_state":"computed","paper":{"title":"Low-overhead quantum computing with the color code","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.str-el"],"primary_cat":"quant-ph","authors_text":"Benjamin J. Brown, Felix Thomsen, Markus S. Kesselring, Stephen D. Bartlett","submitted_at":"2022-01-19T19:00:02Z","abstract_excerpt":"Fault-tolerant quantum computation demands significant resources: large numbers of physical qubits must be checked for errors repeatedly to protect quantum data as logic gates are implemented in the presence of noise. We demonstrate that an approach based on the color code can lead to considerable reductions in the resource overheads compared with conventional methods, while remaining compatible with a two-dimensional layout. We propose a lattice surgery scheme that exploits the rich structure of the color-code phase to perform arbitrary pairs of commuting logical Pauli measurements in paralle"},"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":"2201.07806","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-01-19T19:00:02Z","cross_cats_sorted":["cond-mat.str-el"],"title_canon_sha256":"f93aea36ee1df5563c4a6c3f9dc6787feeaec220ccf5e1624b8814373e956648","abstract_canon_sha256":"b23a581c19d892edde2f0d1189eeab99686e43aab33100e9d9df063db5c020ad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:52:06.368158Z","signature_b64":"c+Yqfc45CvyDaM5LP8fxgtnY5hmc0DgJh4jNVuPmrjTLDfqxmv0yOztuIEC7OS9Fs4tjJRotTrlW/PQzgJQTDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae828a3b35d8496ab44cc1321516f6d70e8955f0734ad9762f7a240ee8b00f95","last_reissued_at":"2026-07-05T09:52:06.367747Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:52:06.367747Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Low-overhead quantum computing with the color code","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.str-el"],"primary_cat":"quant-ph","authors_text":"Benjamin J. Brown, Felix Thomsen, Markus S. Kesselring, Stephen D. Bartlett","submitted_at":"2022-01-19T19:00:02Z","abstract_excerpt":"Fault-tolerant quantum computation demands significant resources: large numbers of physical qubits must be checked for errors repeatedly to protect quantum data as logic gates are implemented in the presence of noise. We demonstrate that an approach based on the color code can lead to considerable reductions in the resource overheads compared with conventional methods, while remaining compatible with a two-dimensional layout. We propose a lattice surgery scheme that exploits the rich structure of the color-code phase to perform arbitrary pairs of commuting logical Pauli measurements in paralle"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.07806","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/2201.07806/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":"2201.07806","created_at":"2026-07-05T09:52:06.367805+00:00"},{"alias_kind":"arxiv_version","alias_value":"2201.07806v2","created_at":"2026-07-05T09:52:06.367805+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.07806","created_at":"2026-07-05T09:52:06.367805+00:00"},{"alias_kind":"pith_short_12","alias_value":"V2BIUOZV3BEW","created_at":"2026-07-05T09:52:06.367805+00:00"},{"alias_kind":"pith_short_16","alias_value":"V2BIUOZV3BEWVNCM","created_at":"2026-07-05T09:52:06.367805+00:00"},{"alias_kind":"pith_short_8","alias_value":"V2BIUOZV","created_at":"2026-07-05T09:52:06.367805+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.01887","citing_title":"The Pangaea Architecture: Fault-Tolerant Heterogeneous Topological Codes via a Quantum Bus","ref_index":6,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/V2BIUOZV3BEWVNCMYEZBKFXW24","json":"https://pith.science/pith/V2BIUOZV3BEWVNCMYEZBKFXW24.json","graph_json":"https://pith.science/api/pith-number/V2BIUOZV3BEWVNCMYEZBKFXW24/graph.json","events_json":"https://pith.science/api/pith-number/V2BIUOZV3BEWVNCMYEZBKFXW24/events.json","paper":"https://pith.science/paper/V2BIUOZV"},"agent_actions":{"view_html":"https://pith.science/pith/V2BIUOZV3BEWVNCMYEZBKFXW24","download_json":"https://pith.science/pith/V2BIUOZV3BEWVNCMYEZBKFXW24.json","view_paper":"https://pith.science/paper/V2BIUOZV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2201.07806&json=true","fetch_graph":"https://pith.science/api/pith-number/V2BIUOZV3BEWVNCMYEZBKFXW24/graph.json","fetch_events":"https://pith.science/api/pith-number/V2BIUOZV3BEWVNCMYEZBKFXW24/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V2BIUOZV3BEWVNCMYEZBKFXW24/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V2BIUOZV3BEWVNCMYEZBKFXW24/action/storage_attestation","attest_author":"https://pith.science/pith/V2BIUOZV3BEWVNCMYEZBKFXW24/action/author_attestation","sign_citation":"https://pith.science/pith/V2BIUOZV3BEWVNCMYEZBKFXW24/action/citation_signature","submit_replication":"https://pith.science/pith/V2BIUOZV3BEWVNCMYEZBKFXW24/action/replication_record"}},"created_at":"2026-07-05T09:52:06.367805+00:00","updated_at":"2026-07-05T09:52:06.367805+00:00"}