{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:5OJFCTZCCHMI6DE7KCP2PBO5L4","short_pith_number":"pith:5OJFCTZC","schema_version":"1.0","canonical_sha256":"eb92514f2211d88f0c9f509fa785dd5f0bb8a1a72a35a2e19a2b63ffba243542","source":{"kind":"arxiv","id":"2411.03632","version":2},"attestation_state":"computed","paper":{"title":"Quantum fault tolerance with constant-space and logarithmic-time overheads","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Christopher A. Pattison, Quynh T. Nguyen","submitted_at":"2024-11-06T03:16:33Z","abstract_excerpt":"In a model of fault-tolerant quantum computation with quick and noiseless polyloglog-time auxiliary classical computation, we construct a fault tolerance protocol with constant-space and $\\widetilde{O}(\\log N)$-time overhead, where $\\widetilde{O}(\\cdot)$ hides sub-polylog factors. Our construction utilizes constant-rate quantum locally testable codes (qLTC), new fault-tolerant gadgets on qLTCs and qLDPC codes, and a new analysis framework. In particular, 1) we develop a new simple and self-contained construction of magic state distillation for qubits using qudit quantum Reed-Solomon codes with"},"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":"2411.03632","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-11-06T03:16:33Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"1d0f399a7b78cdadab5721fc17c09b6260be83811225488c9d93fdff103eaaa7","abstract_canon_sha256":"7dc71b17e3e6f3a8b704b6f61e1810f86641fc98f6547eb4489848d14375da48"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:53:42.361615Z","signature_b64":"vLXvef64Iw4ctuE4m15rxg9Y3DN5snPdKY1sQIu5XlwKWphHIh2QMLheNroPFfsDQG/DEPCegaJnkdi8ZTADCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb92514f2211d88f0c9f509fa785dd5f0bb8a1a72a35a2e19a2b63ffba243542","last_reissued_at":"2026-07-05T11:53:42.361126Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:53:42.361126Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum fault tolerance with constant-space and logarithmic-time overheads","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Christopher A. Pattison, Quynh T. Nguyen","submitted_at":"2024-11-06T03:16:33Z","abstract_excerpt":"In a model of fault-tolerant quantum computation with quick and noiseless polyloglog-time auxiliary classical computation, we construct a fault tolerance protocol with constant-space and $\\widetilde{O}(\\log N)$-time overhead, where $\\widetilde{O}(\\cdot)$ hides sub-polylog factors. Our construction utilizes constant-rate quantum locally testable codes (qLTC), new fault-tolerant gadgets on qLTCs and qLDPC codes, and a new analysis framework. In particular, 1) we develop a new simple and self-contained construction of magic state distillation for qubits using qudit quantum Reed-Solomon codes with"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.03632","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/2411.03632/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":"2411.03632","created_at":"2026-07-05T11:53:42.361180+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.03632v2","created_at":"2026-07-05T11:53:42.361180+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.03632","created_at":"2026-07-05T11:53:42.361180+00:00"},{"alias_kind":"pith_short_12","alias_value":"5OJFCTZCCHMI","created_at":"2026-07-05T11:53:42.361180+00:00"},{"alias_kind":"pith_short_16","alias_value":"5OJFCTZCCHMI6DE7","created_at":"2026-07-05T11:53:42.361180+00:00"},{"alias_kind":"pith_short_8","alias_value":"5OJFCTZC","created_at":"2026-07-05T11:53:42.361180+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2510.19442","citing_title":"Accelerating Fault-Tolerant Quantum Computation with Good qLDPC Codes","ref_index":46,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5OJFCTZCCHMI6DE7KCP2PBO5L4","json":"https://pith.science/pith/5OJFCTZCCHMI6DE7KCP2PBO5L4.json","graph_json":"https://pith.science/api/pith-number/5OJFCTZCCHMI6DE7KCP2PBO5L4/graph.json","events_json":"https://pith.science/api/pith-number/5OJFCTZCCHMI6DE7KCP2PBO5L4/events.json","paper":"https://pith.science/paper/5OJFCTZC"},"agent_actions":{"view_html":"https://pith.science/pith/5OJFCTZCCHMI6DE7KCP2PBO5L4","download_json":"https://pith.science/pith/5OJFCTZCCHMI6DE7KCP2PBO5L4.json","view_paper":"https://pith.science/paper/5OJFCTZC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.03632&json=true","fetch_graph":"https://pith.science/api/pith-number/5OJFCTZCCHMI6DE7KCP2PBO5L4/graph.json","fetch_events":"https://pith.science/api/pith-number/5OJFCTZCCHMI6DE7KCP2PBO5L4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5OJFCTZCCHMI6DE7KCP2PBO5L4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5OJFCTZCCHMI6DE7KCP2PBO5L4/action/storage_attestation","attest_author":"https://pith.science/pith/5OJFCTZCCHMI6DE7KCP2PBO5L4/action/author_attestation","sign_citation":"https://pith.science/pith/5OJFCTZCCHMI6DE7KCP2PBO5L4/action/citation_signature","submit_replication":"https://pith.science/pith/5OJFCTZCCHMI6DE7KCP2PBO5L4/action/replication_record"}},"created_at":"2026-07-05T11:53:42.361180+00:00","updated_at":"2026-07-05T11:53:42.361180+00:00"}