{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:RLR777AQJDRJC7RDP6FNI7RF46","short_pith_number":"pith:RLR777AQ","schema_version":"1.0","canonical_sha256":"8ae3fffc1048e2917e237f8ad47e25e79aa45d6a49126378a340add532438ef5","source":{"kind":"arxiv","id":"1108.5738","version":1},"attestation_state":"computed","paper":{"title":"Fault-tolerant quantum computing with color codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrew J. Landahl, Jonas T. Anderson, Patrick R. Rice","submitted_at":"2011-08-29T20:00:37Z","abstract_excerpt":"We present and analyze protocols for fault-tolerant quantum computing using color codes. We present circuit-level schemes for extracting the error syndrome of these codes fault-tolerantly. We further present an integer-program-based decoding algorithm for identifying the most likely error given the syndrome. We simulated our syndrome extraction and decoding algorithms against three physically-motivated noise models using Monte Carlo methods, and used the simulations to estimate the corresponding accuracy thresholds for fault-tolerant quantum error correction. We also used a self-avoiding walk "},"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":"1108.5738","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-08-29T20:00:37Z","cross_cats_sorted":[],"title_canon_sha256":"cdf9a44b154ec13b7820d8c0721bd53389afed2aa185369d3d7dd47364d75477","abstract_canon_sha256":"b1f3ec2ddb8d9042fd9bd3174f9c01a8d2518fbaa7e22891c8ba51cfe5d78d61"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:14:36.788256Z","signature_b64":"Wdy8ucb/uPZTj45Qwm6mLAYgQNNkAvqwsTChtxeaY4g6Z3qrKidpRBBSzv7Fksn+kjlBJj227CKGW440sf2uAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ae3fffc1048e2917e237f8ad47e25e79aa45d6a49126378a340add532438ef5","last_reissued_at":"2026-05-18T04:14:36.787776Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:14:36.787776Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fault-tolerant quantum computing with color codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrew J. Landahl, Jonas T. Anderson, Patrick R. Rice","submitted_at":"2011-08-29T20:00:37Z","abstract_excerpt":"We present and analyze protocols for fault-tolerant quantum computing using color codes. We present circuit-level schemes for extracting the error syndrome of these codes fault-tolerantly. We further present an integer-program-based decoding algorithm for identifying the most likely error given the syndrome. We simulated our syndrome extraction and decoding algorithms against three physically-motivated noise models using Monte Carlo methods, and used the simulations to estimate the corresponding accuracy thresholds for fault-tolerant quantum error correction. We also used a self-avoiding walk "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.5738","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":"1108.5738","created_at":"2026-05-18T04:14:36.787850+00:00"},{"alias_kind":"arxiv_version","alias_value":"1108.5738v1","created_at":"2026-05-18T04:14:36.787850+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.5738","created_at":"2026-05-18T04:14:36.787850+00:00"},{"alias_kind":"pith_short_12","alias_value":"RLR777AQJDRJ","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_16","alias_value":"RLR777AQJDRJC7RD","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_8","alias_value":"RLR777AQ","created_at":"2026-05-18T12:26:41.206345+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":19,"internal_anchor_count":7,"sample":[{"citing_arxiv_id":"2405.00416","citing_title":"Entanglement and fidelity across quantum phase transitions in locally perturbed topological codes with open boundaries","ref_index":60,"is_internal_anchor":true},{"citing_arxiv_id":"2505.10693","citing_title":"Distributed Realization of Color Codes for Quantum Error Correction","ref_index":14,"is_internal_anchor":true},{"citing_arxiv_id":"2605.21746","citing_title":"GeneCS: Synthesizing Resource-Efficient Code Surgery for Arbitrary Quantum Stabilizer Codes","ref_index":27,"is_internal_anchor":true},{"citing_arxiv_id":"2605.17230","citing_title":"Maximum Likelihood Decoding of Quantum Error Correction Codes","ref_index":40,"is_internal_anchor":true},{"citing_arxiv_id":"2508.10714","citing_title":"Magic tricycles: Efficient magic state generation with finite block-length quantum LDPC codes","ref_index":51,"is_internal_anchor":true},{"citing_arxiv_id":"2510.10835","citing_title":"Rigorous estimation of error thresholds of transversal Clifford logical circuits","ref_index":54,"is_internal_anchor":true},{"citing_arxiv_id":"2601.10964","citing_title":"Stabilizer Code-Generic Universal Fault-Tolerant Quantum Computation","ref_index":18,"is_internal_anchor":true},{"citing_arxiv_id":"2605.12385","citing_title":"Lower overhead fault-tolerant building blocks for noisy quantum computers","ref_index":23,"is_internal_anchor":false},{"citing_arxiv_id":"2604.26376","citing_title":"Quantum Complexity and New Directions in Nuclear Physics and High-Energy Physics Phenomenology","ref_index":121,"is_internal_anchor":false},{"citing_arxiv_id":"2604.25424","citing_title":"A graph-aware bounded distance decoder for all stabilizer codes","ref_index":27,"is_internal_anchor":false},{"citing_arxiv_id":"2604.22471","citing_title":"Boundary-Aware Stabilizer Scheduling for Distributed Quantum Error Correction","ref_index":11,"is_internal_anchor":false},{"citing_arxiv_id":"2605.00038","citing_title":"Lottery BP: Unlocking Quantum Error Decoding at Scale","ref_index":49,"is_internal_anchor":false},{"citing_arxiv_id":"2604.05874","citing_title":"Adaptive Deformation of Color Code in Square Lattices with Defects","ref_index":52,"is_internal_anchor":false},{"citing_arxiv_id":"2604.12560","citing_title":"Design automation and space-time reduction for surface-code logical operations using a SAT-based EDA kernel compatible with general encodings","ref_index":21,"is_internal_anchor":false},{"citing_arxiv_id":"2604.16209","citing_title":"Towards Ultra-High-Rate Quantum Error Correction with Reconfigurable Atom Arrays","ref_index":52,"is_internal_anchor":false},{"citing_arxiv_id":"2604.21287","citing_title":"StabilizerBench: A Benchmark for AI-Assisted Quantum Error Correction Circuit Synthesis","ref_index":35,"is_internal_anchor":false},{"citing_arxiv_id":"2605.04459","citing_title":"Triage: An Adaptive Parallel Window Decoding Scheduler for Real-time Fault-Tolerant Quantum Computation","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2605.04151","citing_title":"Topological subsystem bivariate bicycle codes with four-qubit check operators","ref_index":59,"is_internal_anchor":false},{"citing_arxiv_id":"2605.04049","citing_title":"FTPrimitiveBench: A Benchmark Suite For Logical Computation Under Hardware-Motivated and Biased Noise Models","ref_index":57,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RLR777AQJDRJC7RDP6FNI7RF46","json":"https://pith.science/pith/RLR777AQJDRJC7RDP6FNI7RF46.json","graph_json":"https://pith.science/api/pith-number/RLR777AQJDRJC7RDP6FNI7RF46/graph.json","events_json":"https://pith.science/api/pith-number/RLR777AQJDRJC7RDP6FNI7RF46/events.json","paper":"https://pith.science/paper/RLR777AQ"},"agent_actions":{"view_html":"https://pith.science/pith/RLR777AQJDRJC7RDP6FNI7RF46","download_json":"https://pith.science/pith/RLR777AQJDRJC7RDP6FNI7RF46.json","view_paper":"https://pith.science/paper/RLR777AQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1108.5738&json=true","fetch_graph":"https://pith.science/api/pith-number/RLR777AQJDRJC7RDP6FNI7RF46/graph.json","fetch_events":"https://pith.science/api/pith-number/RLR777AQJDRJC7RDP6FNI7RF46/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RLR777AQJDRJC7RDP6FNI7RF46/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RLR777AQJDRJC7RDP6FNI7RF46/action/storage_attestation","attest_author":"https://pith.science/pith/RLR777AQJDRJC7RDP6FNI7RF46/action/author_attestation","sign_citation":"https://pith.science/pith/RLR777AQJDRJC7RDP6FNI7RF46/action/citation_signature","submit_replication":"https://pith.science/pith/RLR777AQJDRJC7RDP6FNI7RF46/action/replication_record"}},"created_at":"2026-05-18T04:14:36.787850+00:00","updated_at":"2026-05-18T04:14:36.787850+00:00"}