{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:Z2ZGEVWSIIL3LB6HJYQLEKI6X5","short_pith_number":"pith:Z2ZGEVWS","schema_version":"1.0","canonical_sha256":"ceb26256d24217b587c74e20b2291ebf65a4ce82da6947b8e3f322bdd10991a4","source":{"kind":"arxiv","id":"1912.09549","version":1},"attestation_state":"computed","paper":{"title":"Flag fault-tolerant error correction for any stabilizer code","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ben W. Reichardt, Rui Chao","submitted_at":"2019-12-19T21:21:10Z","abstract_excerpt":"Conventional fault-tolerant quantum error-correction schemes require a number of extra qubits that grows linearly with the code's maximum stabilizer generator weight. For some common distance-three codes, the recent \"flag paradigm\" uses just two extra qubits. Chamberland and Beverland (2018) provide a framework for flag error correction of arbitrary-distance codes. However, their construction requires conditions that only some code families are known to satisfy. We give a flag error-correction scheme that works for any stabilizer code, unconditionally. With fast qubit measurement and reset, it"},"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":"1912.09549","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-12-19T21:21:10Z","cross_cats_sorted":[],"title_canon_sha256":"70ee01a6510731b0ef9fe129cbc3924c7a9b78ba759e8272db567f7b75af17b6","abstract_canon_sha256":"9a6e1efea1c45bb7ce12f3338596acfad9f1fbcba2eff41146ff67525740ce59"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:32:57.104406Z","signature_b64":"3MYvSK1GGZvNB6uG4fi/6ueGhB5b7lFtdXPPGkapEsSkj6Ez7uEo3YVi567MwMujWF3W0qf8fBf+da8r2drXAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ceb26256d24217b587c74e20b2291ebf65a4ce82da6947b8e3f322bdd10991a4","last_reissued_at":"2026-07-05T01:32:57.103971Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:32:57.103971Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Flag fault-tolerant error correction for any stabilizer code","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ben W. Reichardt, Rui Chao","submitted_at":"2019-12-19T21:21:10Z","abstract_excerpt":"Conventional fault-tolerant quantum error-correction schemes require a number of extra qubits that grows linearly with the code's maximum stabilizer generator weight. For some common distance-three codes, the recent \"flag paradigm\" uses just two extra qubits. Chamberland and Beverland (2018) provide a framework for flag error correction of arbitrary-distance codes. However, their construction requires conditions that only some code families are known to satisfy. We give a flag error-correction scheme that works for any stabilizer code, unconditionally. With fast qubit measurement and reset, it"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.09549","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1912.09549/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":"1912.09549","created_at":"2026-07-05T01:32:57.104038+00:00"},{"alias_kind":"arxiv_version","alias_value":"1912.09549v1","created_at":"2026-07-05T01:32:57.104038+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.09549","created_at":"2026-07-05T01:32:57.104038+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z2ZGEVWSIIL3","created_at":"2026-07-05T01:32:57.104038+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z2ZGEVWSIIL3LB6H","created_at":"2026-07-05T01:32:57.104038+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z2ZGEVWS","created_at":"2026-07-05T01:32:57.104038+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Z2ZGEVWSIIL3LB6HJYQLEKI6X5","json":"https://pith.science/pith/Z2ZGEVWSIIL3LB6HJYQLEKI6X5.json","graph_json":"https://pith.science/api/pith-number/Z2ZGEVWSIIL3LB6HJYQLEKI6X5/graph.json","events_json":"https://pith.science/api/pith-number/Z2ZGEVWSIIL3LB6HJYQLEKI6X5/events.json","paper":"https://pith.science/paper/Z2ZGEVWS"},"agent_actions":{"view_html":"https://pith.science/pith/Z2ZGEVWSIIL3LB6HJYQLEKI6X5","download_json":"https://pith.science/pith/Z2ZGEVWSIIL3LB6HJYQLEKI6X5.json","view_paper":"https://pith.science/paper/Z2ZGEVWS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1912.09549&json=true","fetch_graph":"https://pith.science/api/pith-number/Z2ZGEVWSIIL3LB6HJYQLEKI6X5/graph.json","fetch_events":"https://pith.science/api/pith-number/Z2ZGEVWSIIL3LB6HJYQLEKI6X5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z2ZGEVWSIIL3LB6HJYQLEKI6X5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z2ZGEVWSIIL3LB6HJYQLEKI6X5/action/storage_attestation","attest_author":"https://pith.science/pith/Z2ZGEVWSIIL3LB6HJYQLEKI6X5/action/author_attestation","sign_citation":"https://pith.science/pith/Z2ZGEVWSIIL3LB6HJYQLEKI6X5/action/citation_signature","submit_replication":"https://pith.science/pith/Z2ZGEVWSIIL3LB6HJYQLEKI6X5/action/replication_record"}},"created_at":"2026-07-05T01:32:57.104038+00:00","updated_at":"2026-07-05T01:32:57.104038+00:00"}