{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:RGXV3KVCJE7ZF6MBRDWNENQMMZ","short_pith_number":"pith:RGXV3KVC","schema_version":"1.0","canonical_sha256":"89af5daaa2493f92f98188ecd2360c665c438fdf7ea0cc28a6920d1023baba67","source":{"kind":"arxiv","id":"1407.5103","version":1},"attestation_state":"computed","paper":{"title":"Quantum computing by color-code lattice surgery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrew J. Landahl, Ciaran Ryan-Anderson","submitted_at":"2014-07-18T20:07:43Z","abstract_excerpt":"We demonstrate how to use lattice surgery to enact a universal set of fault-tolerant quantum operations with color codes. Along the way, we also improve existing surface-code lattice-surgery methods. Lattice-surgery methods use fewer qubits and the same time or less than associated defect-braiding methods. Furthermore, per code distance, color-code lattice surgery uses approximately half the qubits and the same time or less than surface-code lattice surgery. Color-code lattice surgery can also implement the Hadamard and phase gates in a single transversal step---much faster than surface-code l"},"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":"1407.5103","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-07-18T20:07:43Z","cross_cats_sorted":[],"title_canon_sha256":"9d1b0c447a8b7393a05c4d4f837fcaab7b0bb8a85990fb223f7d4b581723ac86","abstract_canon_sha256":"3705c1fac9f2c3334bc0ff3b28e465a3159bff539e78d54f195c4da547a7d858"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:14.947397Z","signature_b64":"TmTVWA+1lYQEBEm3FIU9dBUfghHTpvYFz5mH/o079nM01JVG9TOtXBhRgOVOF1T6U6YSFsj2bbwFMlbypa7KBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"89af5daaa2493f92f98188ecd2360c665c438fdf7ea0cc28a6920d1023baba67","last_reissued_at":"2026-05-18T02:47:14.946888Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:14.946888Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum computing by color-code lattice surgery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrew J. Landahl, Ciaran Ryan-Anderson","submitted_at":"2014-07-18T20:07:43Z","abstract_excerpt":"We demonstrate how to use lattice surgery to enact a universal set of fault-tolerant quantum operations with color codes. Along the way, we also improve existing surface-code lattice-surgery methods. Lattice-surgery methods use fewer qubits and the same time or less than associated defect-braiding methods. Furthermore, per code distance, color-code lattice surgery uses approximately half the qubits and the same time or less than surface-code lattice surgery. Color-code lattice surgery can also implement the Hadamard and phase gates in a single transversal step---much faster than surface-code l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.5103","kind":"arxiv","version":1},"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":"1407.5103","created_at":"2026-05-18T02:47:14.946953+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.5103v1","created_at":"2026-05-18T02:47:14.946953+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.5103","created_at":"2026-05-18T02:47:14.946953+00:00"},{"alias_kind":"pith_short_12","alias_value":"RGXV3KVCJE7Z","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"RGXV3KVCJE7ZF6MB","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"RGXV3KVC","created_at":"2026-05-18T12:28:46.137349+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.25524","citing_title":"Defect-Adaptive Lattice Surgery on Irregular Boundary Surface-Code Patches","ref_index":33,"is_internal_anchor":false},{"citing_arxiv_id":"2604.05874","citing_title":"Adaptive Deformation of Color Code in Square Lattices with Defects","ref_index":50,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RGXV3KVCJE7ZF6MBRDWNENQMMZ","json":"https://pith.science/pith/RGXV3KVCJE7ZF6MBRDWNENQMMZ.json","graph_json":"https://pith.science/api/pith-number/RGXV3KVCJE7ZF6MBRDWNENQMMZ/graph.json","events_json":"https://pith.science/api/pith-number/RGXV3KVCJE7ZF6MBRDWNENQMMZ/events.json","paper":"https://pith.science/paper/RGXV3KVC"},"agent_actions":{"view_html":"https://pith.science/pith/RGXV3KVCJE7ZF6MBRDWNENQMMZ","download_json":"https://pith.science/pith/RGXV3KVCJE7ZF6MBRDWNENQMMZ.json","view_paper":"https://pith.science/paper/RGXV3KVC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.5103&json=true","fetch_graph":"https://pith.science/api/pith-number/RGXV3KVCJE7ZF6MBRDWNENQMMZ/graph.json","fetch_events":"https://pith.science/api/pith-number/RGXV3KVCJE7ZF6MBRDWNENQMMZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RGXV3KVCJE7ZF6MBRDWNENQMMZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RGXV3KVCJE7ZF6MBRDWNENQMMZ/action/storage_attestation","attest_author":"https://pith.science/pith/RGXV3KVCJE7ZF6MBRDWNENQMMZ/action/author_attestation","sign_citation":"https://pith.science/pith/RGXV3KVCJE7ZF6MBRDWNENQMMZ/action/citation_signature","submit_replication":"https://pith.science/pith/RGXV3KVCJE7ZF6MBRDWNENQMMZ/action/replication_record"}},"created_at":"2026-05-18T02:47:14.946953+00:00","updated_at":"2026-05-18T02:47:14.946953+00:00"}