{"paper":{"title":"Towards Deploying Optimistic Quantum Fourier Transforms: An Architecture-Algorithm Co-Design Study","license":"http://creativecommons.org/licenses/by/4.0/","headline":"A hot-zone architecture lets the Optimistic Quantum Fourier Transform reach half its serial latency with roughly 500 extra logical ancillae and 128-qubit peak parallelism.","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Pedro L. S. Lopes","submitted_at":"2026-05-14T18:11:04Z","abstract_excerpt":"We present an architecture-algorithm co-design study of the Optimistic Quantum Fourier Transform (OQFT) under a surface-code fault-tolerant execution model for reconfigurable neutral-atom hardware. Analyzing the OQFT structure, particularly its reliance on phase-gradient resources and small-scale blocks, highlights architectural requirements for resource mobility and parallel execution. Guided by that, we introduce a hot-zone architecture that decouples data storage from processing and dynamically routes mobile resource packages (magic-state factories, bridge qubits, and phase-gradient registe"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Across 256-2048-bit instances, the requirements for half-time performance converge to about 500 additional logical ancillae and a peak parallelism of 128 logical qubits.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The surface-code fault-tolerant execution model together with the heuristic micro-scheduling of ripple-carry adders and catalytic phase-gradient addition accurately capture the dominant space-time costs on reconfigurable neutral-atom hardware (stated in the abstract as the basis for routing and parallelism analysis).","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A hot-zone architecture for OQFT on reconfigurable neutral-atom hardware yields tunable latency via 2-4 zones, converging to roughly 500 extra logical ancillae and 128-qubit peak parallelism for half-time performance on 256-2048 bit instances.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A hot-zone architecture lets the Optimistic Quantum Fourier Transform reach half its serial latency with roughly 500 extra logical ancillae and 128-qubit peak parallelism.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"a433882bb5e20b3150cbd7f97dc933e5c39a90fd3480b5036dba75fea3a4cb6c"},"source":{"id":"2605.15297","kind":"arxiv","version":1},"verdict":{"id":"09f4797b-2ab6-455c-86fe-c5ac7e0c3ddc","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T16:01:55.308046Z","strongest_claim":"Across 256-2048-bit instances, the requirements for half-time performance converge to about 500 additional logical ancillae and a peak parallelism of 128 logical qubits.","one_line_summary":"A hot-zone architecture for OQFT on reconfigurable neutral-atom hardware yields tunable latency via 2-4 zones, converging to roughly 500 extra logical ancillae and 128-qubit peak parallelism for half-time performance on 256-2048 bit instances.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The surface-code fault-tolerant execution model together with the heuristic micro-scheduling of ripple-carry adders and catalytic phase-gradient addition accurately capture the dominant space-time costs on reconfigurable neutral-atom hardware (stated in the abstract as the basis for routing and parallelism analysis).","pith_extraction_headline":"A hot-zone architecture lets the Optimistic Quantum Fourier Transform reach half its serial latency with roughly 500 extra logical ancillae and 128-qubit peak parallelism."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.15297/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-19T16:31:18.363324Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T16:16:17.979983Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T14:41:54.232705Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T13:33:22.782559Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"f15bdc5dc4f3d4130ca626d46388fcd6bb1bb54828759402e7f5f6431a2a841e"},"references":{"count":55,"sample":[{"doi":"10.22331/q-201","year":2018,"title":"Halving the cost of quantum addition,","work_id":"f772778a-94f6-4ede-83c4-52032f1e898f","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2004,"title":"A new quantum ripple-carry addition circuit","work_id":"800d759b-b04d-4b3d-b7be-0fd926923e1f","ref_index":2,"cited_arxiv_id":"quant-ph/0410184","is_internal_anchor":true},{"doi":"","year":2013,"title":"arXiv preprint arXiv:1210.4626 , year=","work_id":"c91729d1-757f-4229-8f93-8dfc6fe5ea3f","ref_index":3,"cited_arxiv_id":"1210.4626","is_internal_anchor":true},{"doi":"","year":2020,"title":"Quantum block lookahead adders and the wait for magic states , publisher =","work_id":"a2eab5ce-f584-43f1-993a-808c50c44f55","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2024,"title":"Magic state cultivation: growing T states as cheap as CNOT gates","work_id":"4cfb255f-1ed0-4158-9c9b-5c3133e0e6aa","ref_index":5,"cited_arxiv_id":"2409.17595","is_internal_anchor":true}],"resolved_work":55,"snapshot_sha256":"05bf884ae2842e89b186adabf37d53abfe3d279108f0b60e0238cca9478d26e6","internal_anchors":12},"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"}