{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:2GJO64LNGQA23KNAZO7RTOIPEB","short_pith_number":"pith:2GJO64LN","schema_version":"1.0","canonical_sha256":"d192ef716d3401ada9a0cbbf19b90f20508517f3a8bc2af351d70c518cf7411e","source":{"kind":"arxiv","id":"2410.16963","version":2},"attestation_state":"computed","paper":{"title":"Scalable Constant-Time Logical Gates for Large-Scale Quantum Computation Using Window-Based Correlated Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Guo-Ping Guo, Huan-Yu Liu, Jia-Ning Li, Jiaxuan Zhang, Qing-Song Li, Tian-Hao Wei, Xi-Ning Zhuang, Yu-Chun Wu, Zhao-Yun Chen","submitted_at":"2024-10-22T12:44:41Z","abstract_excerpt":"Large-scale quantum computation requires to be performed in the fault-tolerant manner. One crucial challenge of fault-tolerant quantum computing (FTQC) is reducing the overhead of implementing logical gates. Recently work proposed correlated decoding and ``algorithmic fault tolerance\" to achieve constant-time logical gates that enables universal quantum computation. However, for circuits involving mid-circuit measurements and feedback, the previous scheme for constant-time logical gates is incompatible with window-based decoding, which is a scalable approach for handling large-scale circuits. "},"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.16963","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-10-22T12:44:41Z","cross_cats_sorted":[],"title_canon_sha256":"3ff23ea2d38f2e70cf9ebe24a1cd1712673847dc79ded9c200ffa56c97785399","abstract_canon_sha256":"2e24ec1248c62047fe53da98fdb62785193399194e0cdfdd972ce48abe203482"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:56:01.591359Z","signature_b64":"qtK2ghq2NgbSlOUF53NT9siZnKemPdka1TcirSwkxtRLkEkiveqVFAstqCtdyufE9jZBgzxshQcF8E9SoM68Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d192ef716d3401ada9a0cbbf19b90f20508517f3a8bc2af351d70c518cf7411e","last_reissued_at":"2026-07-05T09:56:01.590843Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:56:01.590843Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scalable Constant-Time Logical Gates for Large-Scale Quantum Computation Using Window-Based Correlated Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Guo-Ping Guo, Huan-Yu Liu, Jia-Ning Li, Jiaxuan Zhang, Qing-Song Li, Tian-Hao Wei, Xi-Ning Zhuang, Yu-Chun Wu, Zhao-Yun Chen","submitted_at":"2024-10-22T12:44:41Z","abstract_excerpt":"Large-scale quantum computation requires to be performed in the fault-tolerant manner. One crucial challenge of fault-tolerant quantum computing (FTQC) is reducing the overhead of implementing logical gates. Recently work proposed correlated decoding and ``algorithmic fault tolerance\" to achieve constant-time logical gates that enables universal quantum computation. However, for circuits involving mid-circuit measurements and feedback, the previous scheme for constant-time logical gates is incompatible with window-based decoding, which is a scalable approach for handling large-scale circuits. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.16963","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.16963/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.16963","created_at":"2026-07-05T09:56:01.590904+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.16963v2","created_at":"2026-07-05T09:56:01.590904+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.16963","created_at":"2026-07-05T09:56:01.590904+00:00"},{"alias_kind":"pith_short_12","alias_value":"2GJO64LNGQA2","created_at":"2026-07-05T09:56:01.590904+00:00"},{"alias_kind":"pith_short_16","alias_value":"2GJO64LNGQA23KNA","created_at":"2026-07-05T09:56:01.590904+00:00"},{"alias_kind":"pith_short_8","alias_value":"2GJO64LN","created_at":"2026-07-05T09:56:01.590904+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2603.05320","citing_title":"Simplified circuit-level decoding using Knill error correction","ref_index":41,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2GJO64LNGQA23KNAZO7RTOIPEB","json":"https://pith.science/pith/2GJO64LNGQA23KNAZO7RTOIPEB.json","graph_json":"https://pith.science/api/pith-number/2GJO64LNGQA23KNAZO7RTOIPEB/graph.json","events_json":"https://pith.science/api/pith-number/2GJO64LNGQA23KNAZO7RTOIPEB/events.json","paper":"https://pith.science/paper/2GJO64LN"},"agent_actions":{"view_html":"https://pith.science/pith/2GJO64LNGQA23KNAZO7RTOIPEB","download_json":"https://pith.science/pith/2GJO64LNGQA23KNAZO7RTOIPEB.json","view_paper":"https://pith.science/paper/2GJO64LN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.16963&json=true","fetch_graph":"https://pith.science/api/pith-number/2GJO64LNGQA23KNAZO7RTOIPEB/graph.json","fetch_events":"https://pith.science/api/pith-number/2GJO64LNGQA23KNAZO7RTOIPEB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2GJO64LNGQA23KNAZO7RTOIPEB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2GJO64LNGQA23KNAZO7RTOIPEB/action/storage_attestation","attest_author":"https://pith.science/pith/2GJO64LNGQA23KNAZO7RTOIPEB/action/author_attestation","sign_citation":"https://pith.science/pith/2GJO64LNGQA23KNAZO7RTOIPEB/action/citation_signature","submit_replication":"https://pith.science/pith/2GJO64LNGQA23KNAZO7RTOIPEB/action/replication_record"}},"created_at":"2026-07-05T09:56:01.590904+00:00","updated_at":"2026-07-05T09:56:01.590904+00:00"}