{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:JMR5ZZNUHMRDNQG6Y3ESIW7MNE","short_pith_number":"pith:JMR5ZZNU","schema_version":"1.0","canonical_sha256":"4b23dce5b43b2236c0dec6c9245bec693952aa01e68ecf3993da450a284206bc","source":{"kind":"arxiv","id":"2606.18981","version":1},"attestation_state":"computed","paper":{"title":"Not Your Usual FFT: QFT$\\rightarrow$FFT via Classical Quantum-Circuit Simulation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.ET","authors_text":"Frej Larssen, Gilbert Netzer, Ivy Peng, Luca Pennati, Stefano Markidis","submitted_at":"2026-06-17T12:03:39Z","abstract_excerpt":"We introduce QFT$\\rightarrow$FFT, a family of HPC FFT libraries that compute the discrete Fourier transform by executing a quantum Fourier transform (QFT) circuit on classical quantum computer simulators. Input arrays are mapped directly to state amplitudes with explicit normalization/indexing, making QFT a drop-in replacement for FFT primitives. A backend-agnostic planner builds a fused-gate schedule and memory layout adapters to increase arithmetic intensity and reduce memory data movement. We implement this design on top of Google's C++ \\texttt{qsim} and evaluate OpenMP, AVX, and CUDA backe"},"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":"2606.18981","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.ET","submitted_at":"2026-06-17T12:03:39Z","cross_cats_sorted":[],"title_canon_sha256":"543e780a2c1a141a018f0ff0c511093635e1e6cf829971ff8dec62f8f4ee5fc6","abstract_canon_sha256":"c691a66420a313cde548bbd789e5d623d91de2435811bc944ea060eabc78bb28"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:11:53.705166Z","signature_b64":"IQhnpTixMD7TeEznGKoRLsZs7TrfpUMuv1uCaBeENyGpTD8xmhTTHluf65Wr8nMwtdGD/TEAxs9Z6nMZhfTMCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4b23dce5b43b2236c0dec6c9245bec693952aa01e68ecf3993da450a284206bc","last_reissued_at":"2026-06-19T16:11:53.704781Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:11:53.704781Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Not Your Usual FFT: QFT$\\rightarrow$FFT via Classical Quantum-Circuit Simulation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.ET","authors_text":"Frej Larssen, Gilbert Netzer, Ivy Peng, Luca Pennati, Stefano Markidis","submitted_at":"2026-06-17T12:03:39Z","abstract_excerpt":"We introduce QFT$\\rightarrow$FFT, a family of HPC FFT libraries that compute the discrete Fourier transform by executing a quantum Fourier transform (QFT) circuit on classical quantum computer simulators. Input arrays are mapped directly to state amplitudes with explicit normalization/indexing, making QFT a drop-in replacement for FFT primitives. A backend-agnostic planner builds a fused-gate schedule and memory layout adapters to increase arithmetic intensity and reduce memory data movement. We implement this design on top of Google's C++ \\texttt{qsim} and evaluate OpenMP, AVX, and CUDA backe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.18981","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/2606.18981/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":"2606.18981","created_at":"2026-06-19T16:11:53.704848+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.18981v1","created_at":"2026-06-19T16:11:53.704848+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.18981","created_at":"2026-06-19T16:11:53.704848+00:00"},{"alias_kind":"pith_short_12","alias_value":"JMR5ZZNUHMRD","created_at":"2026-06-19T16:11:53.704848+00:00"},{"alias_kind":"pith_short_16","alias_value":"JMR5ZZNUHMRDNQG6","created_at":"2026-06-19T16:11:53.704848+00:00"},{"alias_kind":"pith_short_8","alias_value":"JMR5ZZNU","created_at":"2026-06-19T16:11:53.704848+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JMR5ZZNUHMRDNQG6Y3ESIW7MNE","json":"https://pith.science/pith/JMR5ZZNUHMRDNQG6Y3ESIW7MNE.json","graph_json":"https://pith.science/api/pith-number/JMR5ZZNUHMRDNQG6Y3ESIW7MNE/graph.json","events_json":"https://pith.science/api/pith-number/JMR5ZZNUHMRDNQG6Y3ESIW7MNE/events.json","paper":"https://pith.science/paper/JMR5ZZNU"},"agent_actions":{"view_html":"https://pith.science/pith/JMR5ZZNUHMRDNQG6Y3ESIW7MNE","download_json":"https://pith.science/pith/JMR5ZZNUHMRDNQG6Y3ESIW7MNE.json","view_paper":"https://pith.science/paper/JMR5ZZNU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.18981&json=true","fetch_graph":"https://pith.science/api/pith-number/JMR5ZZNUHMRDNQG6Y3ESIW7MNE/graph.json","fetch_events":"https://pith.science/api/pith-number/JMR5ZZNUHMRDNQG6Y3ESIW7MNE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JMR5ZZNUHMRDNQG6Y3ESIW7MNE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JMR5ZZNUHMRDNQG6Y3ESIW7MNE/action/storage_attestation","attest_author":"https://pith.science/pith/JMR5ZZNUHMRDNQG6Y3ESIW7MNE/action/author_attestation","sign_citation":"https://pith.science/pith/JMR5ZZNUHMRDNQG6Y3ESIW7MNE/action/citation_signature","submit_replication":"https://pith.science/pith/JMR5ZZNUHMRDNQG6Y3ESIW7MNE/action/replication_record"}},"created_at":"2026-06-19T16:11:53.704848+00:00","updated_at":"2026-06-19T16:11:53.704848+00:00"}