{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:HENLPADABOFOUYY7G7P4EOF2LG","short_pith_number":"pith:HENLPADA","schema_version":"1.0","canonical_sha256":"391ab780600b8aea631f37dfc238ba59908ca81f4d80314240598ca8028cc2df","source":{"kind":"arxiv","id":"2302.02192","version":2},"attestation_state":"computed","paper":{"title":"Relaxing Hardware Requirements for Surface Code Circuits using Time-dynamics","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Craig Gidney, Dave Bacon, Matt McEwen","submitted_at":"2023-02-04T16:35:42Z","abstract_excerpt":"The typical time-independent view of quantum error correction (QEC) codes hides significant freedom in the decomposition into circuits that are executable on hardware. Using the concept of detecting regions, we design time-dynamic QEC circuits directly instead of designing static QEC codes to decompose into circuits. In particular, we improve on the standard circuit constructions for the surface code, presenting new circuits that can embed on a hexagonal grid instead of a square grid, that can use ISWAP gates instead of CNOT or CZ gates, that can exchange qubit data and measure roles, and that"},"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":"2302.02192","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-02-04T16:35:42Z","cross_cats_sorted":[],"title_canon_sha256":"4c4de9d164cd36a459831a559b7a646ca3881c0fd2490b5e53b0c1b2d6117c50","abstract_canon_sha256":"827fafc92d9f909580a386c98334e7cb28bf56ade75fc899bafbc7ccfc78796d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:10:17.885699Z","signature_b64":"stediONAefG/w1FrbrTuMEO7HZMntVCwEvnk4+ZzrWv43vuvQhsHWZuD6qnsYCbMJnl/qfkfhWgsNqscpjzsAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"391ab780600b8aea631f37dfc238ba59908ca81f4d80314240598ca8028cc2df","last_reissued_at":"2026-07-05T07:10:17.885194Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:10:17.885194Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Relaxing Hardware Requirements for Surface Code Circuits using Time-dynamics","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Craig Gidney, Dave Bacon, Matt McEwen","submitted_at":"2023-02-04T16:35:42Z","abstract_excerpt":"The typical time-independent view of quantum error correction (QEC) codes hides significant freedom in the decomposition into circuits that are executable on hardware. Using the concept of detecting regions, we design time-dynamic QEC circuits directly instead of designing static QEC codes to decompose into circuits. In particular, we improve on the standard circuit constructions for the surface code, presenting new circuits that can embed on a hexagonal grid instead of a square grid, that can use ISWAP gates instead of CNOT or CZ gates, that can exchange qubit data and measure roles, and that"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.02192","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/2302.02192/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":"2302.02192","created_at":"2026-07-05T07:10:17.885252+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.02192v2","created_at":"2026-07-05T07:10:17.885252+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.02192","created_at":"2026-07-05T07:10:17.885252+00:00"},{"alias_kind":"pith_short_12","alias_value":"HENLPADABOFO","created_at":"2026-07-05T07:10:17.885252+00:00"},{"alias_kind":"pith_short_16","alias_value":"HENLPADABOFOUYY7","created_at":"2026-07-05T07:10:17.885252+00:00"},{"alias_kind":"pith_short_8","alias_value":"HENLPADA","created_at":"2026-07-05T07:10:17.885252+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2607.01887","citing_title":"LUCI on IBM Hardware: Error Suppression with Almost Half Syndrome Density","ref_index":35,"is_internal_anchor":false},{"citing_arxiv_id":"2606.09678","citing_title":"The dynamic 4.8.8 Floquet code","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2412.01446","citing_title":"Magic State Injection on IBM Quantum Processors Above the Distillation Threshold","ref_index":36,"is_internal_anchor":false},{"citing_arxiv_id":"2602.20238","citing_title":"Proof of a finite threshold for the union-find decoder","ref_index":69,"is_internal_anchor":false},{"citing_arxiv_id":"2409.17595","citing_title":"Magic state cultivation: growing T states as cheap as CNOT gates","ref_index":206,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HENLPADABOFOUYY7G7P4EOF2LG","json":"https://pith.science/pith/HENLPADABOFOUYY7G7P4EOF2LG.json","graph_json":"https://pith.science/api/pith-number/HENLPADABOFOUYY7G7P4EOF2LG/graph.json","events_json":"https://pith.science/api/pith-number/HENLPADABOFOUYY7G7P4EOF2LG/events.json","paper":"https://pith.science/paper/HENLPADA"},"agent_actions":{"view_html":"https://pith.science/pith/HENLPADABOFOUYY7G7P4EOF2LG","download_json":"https://pith.science/pith/HENLPADABOFOUYY7G7P4EOF2LG.json","view_paper":"https://pith.science/paper/HENLPADA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.02192&json=true","fetch_graph":"https://pith.science/api/pith-number/HENLPADABOFOUYY7G7P4EOF2LG/graph.json","fetch_events":"https://pith.science/api/pith-number/HENLPADABOFOUYY7G7P4EOF2LG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HENLPADABOFOUYY7G7P4EOF2LG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HENLPADABOFOUYY7G7P4EOF2LG/action/storage_attestation","attest_author":"https://pith.science/pith/HENLPADABOFOUYY7G7P4EOF2LG/action/author_attestation","sign_citation":"https://pith.science/pith/HENLPADABOFOUYY7G7P4EOF2LG/action/citation_signature","submit_replication":"https://pith.science/pith/HENLPADABOFOUYY7G7P4EOF2LG/action/replication_record"}},"created_at":"2026-07-05T07:10:17.885252+00:00","updated_at":"2026-07-05T07:10:17.885252+00:00"}