{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:3I3BZU6O2KTRQK4EAIMCGOOIFE","short_pith_number":"pith:3I3BZU6O","schema_version":"1.0","canonical_sha256":"da361cd3ced2a7182b8402182339c8292495065f5e7825521d6af8d1333bb9f0","source":{"kind":"arxiv","id":"2608.00165","version":1},"attestation_state":"computed","paper":{"title":"Arbitrary-Distance Quantum Error Correction with Gauss's Law for $\\mathbb Z_2$ Lattice Gauge Theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["hep-th","quant-ph"],"primary_cat":"hep-lat","authors_text":"Christian W. Bauer, Lento Nagano, Masazumi Honda, Neel S. Modi, Nobuyuki Yoshioka","submitted_at":"2026-07-31T18:00:01Z","abstract_excerpt":"It has previously been shown by Rajput, Roggero, and Wiebe that $\\mathbb Z_2$ Gauss's law constraints can be used to build efficient quantum error-correcting codes (QECCs) that are robust against arbitrary single-qubit errors. In this work, we generalize the construction to be robust against arbitrary $t$-qubit errors, where $t$ is any positive integer. This includes a derivation of the optimal Gauss's law code within the considered family by minimizing the number of physical qubits required for a given code distance. Finally, we compare our codes against other efficient QECCs on metrics such "},"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":"2608.00165","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"hep-lat","submitted_at":"2026-07-31T18:00:01Z","cross_cats_sorted":["hep-th","quant-ph"],"title_canon_sha256":"6602a4fbf361097284d94857fedb6bde164f8ace0e24746652e237d4c9fcb0d4","abstract_canon_sha256":"3cc3125a124c7dbe27c1e571b8564e7f8d02e5a1d1fe74236688c120741f086d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-04T00:33:06.410720Z","signature_b64":"WQLAB2R/Zi4tCHRjPpPkmfYcDX2fujijY+Cb67cM84XYYihrOL03kMpCoFeKME6R6ekPcNKgYkcCF207QyP4Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da361cd3ced2a7182b8402182339c8292495065f5e7825521d6af8d1333bb9f0","last_reissued_at":"2026-08-04T00:33:06.409334Z","signature_status":"signed_v1","first_computed_at":"2026-08-04T00:33:06.409334Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Arbitrary-Distance Quantum Error Correction with Gauss's Law for $\\mathbb Z_2$ Lattice Gauge Theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["hep-th","quant-ph"],"primary_cat":"hep-lat","authors_text":"Christian W. Bauer, Lento Nagano, Masazumi Honda, Neel S. Modi, Nobuyuki Yoshioka","submitted_at":"2026-07-31T18:00:01Z","abstract_excerpt":"It has previously been shown by Rajput, Roggero, and Wiebe that $\\mathbb Z_2$ Gauss's law constraints can be used to build efficient quantum error-correcting codes (QECCs) that are robust against arbitrary single-qubit errors. In this work, we generalize the construction to be robust against arbitrary $t$-qubit errors, where $t$ is any positive integer. This includes a derivation of the optimal Gauss's law code within the considered family by minimizing the number of physical qubits required for a given code distance. Finally, we compare our codes against other efficient QECCs on metrics such "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.00165","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/2608.00165/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":"2608.00165","created_at":"2026-08-04T00:33:06.410377+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.00165v1","created_at":"2026-08-04T00:33:06.410377+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.00165","created_at":"2026-08-04T00:33:06.410377+00:00"},{"alias_kind":"pith_short_12","alias_value":"3I3BZU6O2KTR","created_at":"2026-08-04T00:33:06.410377+00:00"},{"alias_kind":"pith_short_16","alias_value":"3I3BZU6O2KTRQK4E","created_at":"2026-08-04T00:33:06.410377+00:00"},{"alias_kind":"pith_short_8","alias_value":"3I3BZU6O","created_at":"2026-08-04T00:33:06.410377+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/3I3BZU6O2KTRQK4EAIMCGOOIFE","json":"https://pith.science/pith/3I3BZU6O2KTRQK4EAIMCGOOIFE.json","graph_json":"https://pith.science/api/pith-number/3I3BZU6O2KTRQK4EAIMCGOOIFE/graph.json","events_json":"https://pith.science/api/pith-number/3I3BZU6O2KTRQK4EAIMCGOOIFE/events.json","paper":"https://pith.science/paper/3I3BZU6O"},"agent_actions":{"view_html":"https://pith.science/pith/3I3BZU6O2KTRQK4EAIMCGOOIFE","download_json":"https://pith.science/pith/3I3BZU6O2KTRQK4EAIMCGOOIFE.json","view_paper":"https://pith.science/paper/3I3BZU6O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.00165&json=true","fetch_graph":"https://pith.science/api/pith-number/3I3BZU6O2KTRQK4EAIMCGOOIFE/graph.json","fetch_events":"https://pith.science/api/pith-number/3I3BZU6O2KTRQK4EAIMCGOOIFE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3I3BZU6O2KTRQK4EAIMCGOOIFE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3I3BZU6O2KTRQK4EAIMCGOOIFE/action/storage_attestation","attest_author":"https://pith.science/pith/3I3BZU6O2KTRQK4EAIMCGOOIFE/action/author_attestation","sign_citation":"https://pith.science/pith/3I3BZU6O2KTRQK4EAIMCGOOIFE/action/citation_signature","submit_replication":"https://pith.science/pith/3I3BZU6O2KTRQK4EAIMCGOOIFE/action/replication_record"}},"created_at":"2026-08-04T00:33:06.410377+00:00","updated_at":"2026-08-04T00:33:06.410377+00:00"}