{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:SXYN4WN74YIZRVGKXGR7QTDWNH","short_pith_number":"pith:SXYN4WN7","schema_version":"1.0","canonical_sha256":"95f0de59bfe61198d4cab9a3f84c7669fd3d91a43f4d9f16a080450f031b0cea","source":{"kind":"arxiv","id":"2406.12083","version":1},"attestation_state":"computed","paper":{"title":"Equivalence Classes of Quantum Error-Correcting Codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alexander Li, Andrey Boris Khesin","submitted_at":"2024-06-17T20:48:43Z","abstract_excerpt":"Quantum error-correcting codes (QECC's) are needed to combat the inherent noise affecting quantum processes. Using ZX calculus, we represent QECC's in a form called a ZX diagram, consisting of a tensor network. In this paper, we present canonical forms for CSS codes and CSS states (which are CSS codes with 0 inputs), and we show the resulting canonical forms for the toric code and certain surface codes. Next, we introduce the notion of prime code diagrams, ZX diagrams of codes that have a single connected component with the property that no sequence of rewrite rules can split such a diagram in"},"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":"2406.12083","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-06-17T20:48:43Z","cross_cats_sorted":[],"title_canon_sha256":"860471515167412361ad709a63115e1ca7fb00ccf059b6fb8f741965f34dc15f","abstract_canon_sha256":"a0abf604b5cde759ee76fb0db14b1223258bc603c45959a8f237407391248c8b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:33:06.248204Z","signature_b64":"9fHS9nJRYSKYgUqd4vFpL3JNm8ahWxarWKIVOhElNVrUiNNuLxDWBfuUIzaI8NnjQb7gRH24Xd0HdLgBshYtBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"95f0de59bfe61198d4cab9a3f84c7669fd3d91a43f4d9f16a080450f031b0cea","last_reissued_at":"2026-07-05T08:33:06.247693Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:33:06.247693Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Equivalence Classes of Quantum Error-Correcting Codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alexander Li, Andrey Boris Khesin","submitted_at":"2024-06-17T20:48:43Z","abstract_excerpt":"Quantum error-correcting codes (QECC's) are needed to combat the inherent noise affecting quantum processes. Using ZX calculus, we represent QECC's in a form called a ZX diagram, consisting of a tensor network. In this paper, we present canonical forms for CSS codes and CSS states (which are CSS codes with 0 inputs), and we show the resulting canonical forms for the toric code and certain surface codes. Next, we introduce the notion of prime code diagrams, ZX diagrams of codes that have a single connected component with the property that no sequence of rewrite rules can split such a diagram in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.12083","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/2406.12083/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":"2406.12083","created_at":"2026-07-05T08:33:06.247756+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.12083v1","created_at":"2026-07-05T08:33:06.247756+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.12083","created_at":"2026-07-05T08:33:06.247756+00:00"},{"alias_kind":"pith_short_12","alias_value":"SXYN4WN74YIZ","created_at":"2026-07-05T08:33:06.247756+00:00"},{"alias_kind":"pith_short_16","alias_value":"SXYN4WN74YIZRVGK","created_at":"2026-07-05T08:33:06.247756+00:00"},{"alias_kind":"pith_short_8","alias_value":"SXYN4WN7","created_at":"2026-07-05T08:33:06.247756+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.02542","citing_title":"Chutes and Ladders: Dynamical Automorphisms via the ZX-Calculus","ref_index":68,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SXYN4WN74YIZRVGKXGR7QTDWNH","json":"https://pith.science/pith/SXYN4WN74YIZRVGKXGR7QTDWNH.json","graph_json":"https://pith.science/api/pith-number/SXYN4WN74YIZRVGKXGR7QTDWNH/graph.json","events_json":"https://pith.science/api/pith-number/SXYN4WN74YIZRVGKXGR7QTDWNH/events.json","paper":"https://pith.science/paper/SXYN4WN7"},"agent_actions":{"view_html":"https://pith.science/pith/SXYN4WN74YIZRVGKXGR7QTDWNH","download_json":"https://pith.science/pith/SXYN4WN74YIZRVGKXGR7QTDWNH.json","view_paper":"https://pith.science/paper/SXYN4WN7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.12083&json=true","fetch_graph":"https://pith.science/api/pith-number/SXYN4WN74YIZRVGKXGR7QTDWNH/graph.json","fetch_events":"https://pith.science/api/pith-number/SXYN4WN74YIZRVGKXGR7QTDWNH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SXYN4WN74YIZRVGKXGR7QTDWNH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SXYN4WN74YIZRVGKXGR7QTDWNH/action/storage_attestation","attest_author":"https://pith.science/pith/SXYN4WN74YIZRVGKXGR7QTDWNH/action/author_attestation","sign_citation":"https://pith.science/pith/SXYN4WN74YIZRVGKXGR7QTDWNH/action/citation_signature","submit_replication":"https://pith.science/pith/SXYN4WN74YIZRVGKXGR7QTDWNH/action/replication_record"}},"created_at":"2026-07-05T08:33:06.247756+00:00","updated_at":"2026-07-05T08:33:06.247756+00:00"}