{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:P6A6WA3WPVKSUYSBCXQXFNP5MU","short_pith_number":"pith:P6A6WA3W","schema_version":"1.0","canonical_sha256":"7f81eb03767d552a624115e172b5fd6502d968e2cb635a5e8931cbf68dad3679","source":{"kind":"arxiv","id":"2410.17240","version":2},"attestation_state":"computed","paper":{"title":"Floquetifying stabiliser codes with distance-preserving rewrites","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Aleks Kissinger, Benjamin Rodatz, Boldizs\\'ar Po\\'or","submitted_at":"2024-10-22T17:56:26Z","abstract_excerpt":"Stabiliser codes with large weight measurements can be challenging to implement fault-tolerantly. To overcome this, we propose a Floquetification procedure which, given a stabiliser code, synthesises a novel Floquet code that only uses single- and two-qubit operations. Moreover, this procedure preserves the distance and number of logicals of the original code. The new Floquet code requires additional physical qubits. This overhead is linear in the weight of the largest measurement of the original code. Our method is based on the ZX calculus, a graphical language for representing and rewriting "},"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":"2410.17240","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-10-22T17:56:26Z","cross_cats_sorted":[],"title_canon_sha256":"4c7a1174e268e51853aba6c4c189dd2689bfcee521870df52936d55cd7ac6ebd","abstract_canon_sha256":"fab2a0e90297c7d51a97afccced7a38d60e31a08434d26a758f490586dc7d883"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:49:46.014854Z","signature_b64":"/2wRE+SIGy052HrvCI5DfistZ7hILGqqwS14X5zbl+b9HIppGZDR2Fub5is5BC5X75rK/yAMlGE2DlNxedt9Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f81eb03767d552a624115e172b5fd6502d968e2cb635a5e8931cbf68dad3679","last_reissued_at":"2026-07-05T09:49:46.013826Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:49:46.013826Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Floquetifying stabiliser codes with distance-preserving rewrites","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Aleks Kissinger, Benjamin Rodatz, Boldizs\\'ar Po\\'or","submitted_at":"2024-10-22T17:56:26Z","abstract_excerpt":"Stabiliser codes with large weight measurements can be challenging to implement fault-tolerantly. To overcome this, we propose a Floquetification procedure which, given a stabiliser code, synthesises a novel Floquet code that only uses single- and two-qubit operations. Moreover, this procedure preserves the distance and number of logicals of the original code. The new Floquet code requires additional physical qubits. This overhead is linear in the weight of the largest measurement of the original code. Our method is based on the ZX calculus, a graphical language for representing and rewriting "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.17240","kind":"arxiv","version":2},"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/2410.17240/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":"2410.17240","created_at":"2026-07-05T09:49:46.013883+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.17240v2","created_at":"2026-07-05T09:49:46.013883+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.17240","created_at":"2026-07-05T09:49:46.013883+00:00"},{"alias_kind":"pith_short_12","alias_value":"P6A6WA3WPVKS","created_at":"2026-07-05T09:49:46.013883+00:00"},{"alias_kind":"pith_short_16","alias_value":"P6A6WA3WPVKSUYSB","created_at":"2026-07-05T09:49:46.013883+00:00"},{"alias_kind":"pith_short_8","alias_value":"P6A6WA3W","created_at":"2026-07-05T09:49:46.013883+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2606.02542","citing_title":"Chutes and Ladders: Dynamical Automorphisms via the ZX-Calculus","ref_index":45,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/P6A6WA3WPVKSUYSBCXQXFNP5MU","json":"https://pith.science/pith/P6A6WA3WPVKSUYSBCXQXFNP5MU.json","graph_json":"https://pith.science/api/pith-number/P6A6WA3WPVKSUYSBCXQXFNP5MU/graph.json","events_json":"https://pith.science/api/pith-number/P6A6WA3WPVKSUYSBCXQXFNP5MU/events.json","paper":"https://pith.science/paper/P6A6WA3W"},"agent_actions":{"view_html":"https://pith.science/pith/P6A6WA3WPVKSUYSBCXQXFNP5MU","download_json":"https://pith.science/pith/P6A6WA3WPVKSUYSBCXQXFNP5MU.json","view_paper":"https://pith.science/paper/P6A6WA3W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.17240&json=true","fetch_graph":"https://pith.science/api/pith-number/P6A6WA3WPVKSUYSBCXQXFNP5MU/graph.json","fetch_events":"https://pith.science/api/pith-number/P6A6WA3WPVKSUYSBCXQXFNP5MU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P6A6WA3WPVKSUYSBCXQXFNP5MU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P6A6WA3WPVKSUYSBCXQXFNP5MU/action/storage_attestation","attest_author":"https://pith.science/pith/P6A6WA3WPVKSUYSBCXQXFNP5MU/action/author_attestation","sign_citation":"https://pith.science/pith/P6A6WA3WPVKSUYSBCXQXFNP5MU/action/citation_signature","submit_replication":"https://pith.science/pith/P6A6WA3WPVKSUYSBCXQXFNP5MU/action/replication_record"}},"created_at":"2026-07-05T09:49:46.013883+00:00","updated_at":"2026-07-05T09:49:46.013883+00:00"}