{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:UTO5A4WSOXS2WQCSTEPGR46BAY","short_pith_number":"pith:UTO5A4WS","schema_version":"1.0","canonical_sha256":"a4ddd072d275e5ab4052991e68f3c10635684cadfbe01408234acf5a1ddc3a73","source":{"kind":"arxiv","id":"2108.11395","version":3},"attestation_state":"computed","paper":{"title":"A decoder for the triangular color code by matching on a M\\\"obius strip","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Benjamin J. Brown, Kaavya Sahay","submitted_at":"2021-08-25T18:00:03Z","abstract_excerpt":"The color code is remarkable for its ability to perform fault-tolerant logic gates. This motivates the design of practical decoders that minimise the resource cost of color-code quantum computation. Here we propose a decoder for the planar color code with a triangular boundary where we match syndrome defects on a nontrivial manifold that has the topology of a M\\\"{o}bius strip. A basic implementation of our decoder used on the color code with hexagonal lattice geometry demonstrates a logical failure rate that is competitive with the optimal performance of the surface code, $\\sim p^{\\alpha \\sqrt"},"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":"2108.11395","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-08-25T18:00:03Z","cross_cats_sorted":[],"title_canon_sha256":"856f5899875feaadf1a265ddb93f1a5dcbdf46a18777a9b92135ff56a61de7d7","abstract_canon_sha256":"02b9ceefee2fc93a71fdcc55ab2cf8e870990cdbfaf394b30908187b1ac2e424"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:49:41.771313Z","signature_b64":"nhQah4wu59qEZYGWh444XI16SQwywuB+weBEwOtcTTSqe37wzjOFjmpW8ly01qXQ/eCbD2onjIIAj7Wuesg6Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a4ddd072d275e5ab4052991e68f3c10635684cadfbe01408234acf5a1ddc3a73","last_reissued_at":"2026-07-05T03:49:41.770762Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:49:41.770762Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A decoder for the triangular color code by matching on a M\\\"obius strip","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Benjamin J. Brown, Kaavya Sahay","submitted_at":"2021-08-25T18:00:03Z","abstract_excerpt":"The color code is remarkable for its ability to perform fault-tolerant logic gates. This motivates the design of practical decoders that minimise the resource cost of color-code quantum computation. Here we propose a decoder for the planar color code with a triangular boundary where we match syndrome defects on a nontrivial manifold that has the topology of a M\\\"{o}bius strip. A basic implementation of our decoder used on the color code with hexagonal lattice geometry demonstrates a logical failure rate that is competitive with the optimal performance of the surface code, $\\sim p^{\\alpha \\sqrt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2108.11395","kind":"arxiv","version":3},"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/2108.11395/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":"2108.11395","created_at":"2026-07-05T03:49:41.770823+00:00"},{"alias_kind":"arxiv_version","alias_value":"2108.11395v3","created_at":"2026-07-05T03:49:41.770823+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2108.11395","created_at":"2026-07-05T03:49:41.770823+00:00"},{"alias_kind":"pith_short_12","alias_value":"UTO5A4WSOXS2","created_at":"2026-07-05T03:49:41.770823+00:00"},{"alias_kind":"pith_short_16","alias_value":"UTO5A4WSOXS2WQCS","created_at":"2026-07-05T03:49:41.770823+00:00"},{"alias_kind":"pith_short_8","alias_value":"UTO5A4WS","created_at":"2026-07-05T03:49:41.770823+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.05175","citing_title":"Planar fault-tolerant circuits for non-Clifford gates on the 2D color code","ref_index":68,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UTO5A4WSOXS2WQCSTEPGR46BAY","json":"https://pith.science/pith/UTO5A4WSOXS2WQCSTEPGR46BAY.json","graph_json":"https://pith.science/api/pith-number/UTO5A4WSOXS2WQCSTEPGR46BAY/graph.json","events_json":"https://pith.science/api/pith-number/UTO5A4WSOXS2WQCSTEPGR46BAY/events.json","paper":"https://pith.science/paper/UTO5A4WS"},"agent_actions":{"view_html":"https://pith.science/pith/UTO5A4WSOXS2WQCSTEPGR46BAY","download_json":"https://pith.science/pith/UTO5A4WSOXS2WQCSTEPGR46BAY.json","view_paper":"https://pith.science/paper/UTO5A4WS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2108.11395&json=true","fetch_graph":"https://pith.science/api/pith-number/UTO5A4WSOXS2WQCSTEPGR46BAY/graph.json","fetch_events":"https://pith.science/api/pith-number/UTO5A4WSOXS2WQCSTEPGR46BAY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UTO5A4WSOXS2WQCSTEPGR46BAY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UTO5A4WSOXS2WQCSTEPGR46BAY/action/storage_attestation","attest_author":"https://pith.science/pith/UTO5A4WSOXS2WQCSTEPGR46BAY/action/author_attestation","sign_citation":"https://pith.science/pith/UTO5A4WSOXS2WQCSTEPGR46BAY/action/citation_signature","submit_replication":"https://pith.science/pith/UTO5A4WSOXS2WQCSTEPGR46BAY/action/replication_record"}},"created_at":"2026-07-05T03:49:41.770823+00:00","updated_at":"2026-07-05T03:49:41.770823+00:00"}