{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:S23GLASCPONMNEZAX77UFHDPBA","short_pith_number":"pith:S23GLASC","schema_version":"1.0","canonical_sha256":"96b66582427b9ac69320bfff429c6f0814f171f9f161eaeb7aca78782aadcc6f","source":{"kind":"arxiv","id":"2504.20832","version":1},"attestation_state":"computed","paper":{"title":"Approximate Quantum Fourier Transform in Logarithmic Depth on a Line","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"David Sutter, Elisa B\\\"aumer, Stefan Woerner","submitted_at":"2025-04-29T14:56:41Z","abstract_excerpt":"The approximate quantum Fourier transform (AQFT) on $n$ qubits can be implemented in logarithmic depth using $8n$ qubits with all-to-all connectivity, as shown in [Hales, PhD Thesis Berkeley, 2002]. However, realizing the required all-to-all connectivity can be challenging in practice. In this work, we use dynamic circuits, i.e., mid-circuit measurements and feed-forward operations, to implement the AQFT in logarithmic depth using only $4n$ qubits arranged on a line with nearest-neighbor connectivity. Furthermore, for states with a specific structure, the number of qubits can be further reduce"},"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":"2504.20832","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-04-29T14:56:41Z","cross_cats_sorted":[],"title_canon_sha256":"611cbe2d05746ca030982b75307cfd786f5a4cf30f657d6ea0fc974febe18cdf","abstract_canon_sha256":"b9a31a2cc39be7ecf9710a14917f23b374b2db858ee3067ae4653452850d5a74"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:55:49.519438Z","signature_b64":"20q1hqafErGR01DphiQgt3jLq2zoHC/ncLrt/B2oGqRQ/eMinWVKwbTbSrrv4ZP28K+6llAGR4gyQIGFOHRsBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"96b66582427b9ac69320bfff429c6f0814f171f9f161eaeb7aca78782aadcc6f","last_reissued_at":"2026-07-05T10:55:49.518932Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:55:49.518932Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximate Quantum Fourier Transform in Logarithmic Depth on a Line","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"David Sutter, Elisa B\\\"aumer, Stefan Woerner","submitted_at":"2025-04-29T14:56:41Z","abstract_excerpt":"The approximate quantum Fourier transform (AQFT) on $n$ qubits can be implemented in logarithmic depth using $8n$ qubits with all-to-all connectivity, as shown in [Hales, PhD Thesis Berkeley, 2002]. However, realizing the required all-to-all connectivity can be challenging in practice. In this work, we use dynamic circuits, i.e., mid-circuit measurements and feed-forward operations, to implement the AQFT in logarithmic depth using only $4n$ qubits arranged on a line with nearest-neighbor connectivity. Furthermore, for states with a specific structure, the number of qubits can be further reduce"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.20832","kind":"arxiv","version":1},"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/2504.20832/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":"2504.20832","created_at":"2026-07-05T10:55:49.518994+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.20832v1","created_at":"2026-07-05T10:55:49.518994+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.20832","created_at":"2026-07-05T10:55:49.518994+00:00"},{"alias_kind":"pith_short_12","alias_value":"S23GLASCPONM","created_at":"2026-07-05T10:55:49.518994+00:00"},{"alias_kind":"pith_short_16","alias_value":"S23GLASCPONMNEZA","created_at":"2026-07-05T10:55:49.518994+00:00"},{"alias_kind":"pith_short_8","alias_value":"S23GLASC","created_at":"2026-07-05T10:55:49.518994+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.18494","citing_title":"Towards an Optimally Distributed Quantum Fourier Transform Circuit","ref_index":65,"is_internal_anchor":false},{"citing_arxiv_id":"2605.05256","citing_title":"Error Mitigation in Dynamic Circuits for Hamiltonian Simulation","ref_index":2,"is_internal_anchor":false},{"citing_arxiv_id":"2604.03360","citing_title":"Characterizing and Benchmarking Dynamic Quantum Circuits","ref_index":11,"is_internal_anchor":false},{"citing_arxiv_id":"2605.05256","citing_title":"Error Mitigation in Dynamic Circuits for Hamiltonian Simulation","ref_index":2,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/S23GLASCPONMNEZAX77UFHDPBA","json":"https://pith.science/pith/S23GLASCPONMNEZAX77UFHDPBA.json","graph_json":"https://pith.science/api/pith-number/S23GLASCPONMNEZAX77UFHDPBA/graph.json","events_json":"https://pith.science/api/pith-number/S23GLASCPONMNEZAX77UFHDPBA/events.json","paper":"https://pith.science/paper/S23GLASC"},"agent_actions":{"view_html":"https://pith.science/pith/S23GLASCPONMNEZAX77UFHDPBA","download_json":"https://pith.science/pith/S23GLASCPONMNEZAX77UFHDPBA.json","view_paper":"https://pith.science/paper/S23GLASC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.20832&json=true","fetch_graph":"https://pith.science/api/pith-number/S23GLASCPONMNEZAX77UFHDPBA/graph.json","fetch_events":"https://pith.science/api/pith-number/S23GLASCPONMNEZAX77UFHDPBA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S23GLASCPONMNEZAX77UFHDPBA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S23GLASCPONMNEZAX77UFHDPBA/action/storage_attestation","attest_author":"https://pith.science/pith/S23GLASCPONMNEZAX77UFHDPBA/action/author_attestation","sign_citation":"https://pith.science/pith/S23GLASCPONMNEZAX77UFHDPBA/action/citation_signature","submit_replication":"https://pith.science/pith/S23GLASCPONMNEZAX77UFHDPBA/action/replication_record"}},"created_at":"2026-07-05T10:55:49.518994+00:00","updated_at":"2026-07-05T10:55:49.518994+00:00"}