{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:YUND3VSGE2ZTCVOFAKS22257H6","short_pith_number":"pith:YUND3VSG","schema_version":"1.0","canonical_sha256":"c51a3dd64626b33155c502a5ad6bbf3f84ea4c54ff7f4c1369aa8bb24fe238dc","source":{"kind":"arxiv","id":"2605.16998","version":1},"attestation_state":"computed","paper":{"title":"$\\mathcal{O}(n)$ alternative to Quantum Fourier Transform with efficient neural net classical post-processing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"An O(n) circuit using Hadamards and controlled-phase gates can replace the O(n squared) quantum Fourier transform in Shor's algorithm with neural-net post-processing.","cross_cats":["cs.LG"],"primary_cat":"quant-ph","authors_text":"Kaiming Bian, Oscar Dahlsten, Zujin Wen","submitted_at":"2026-05-16T13:47:11Z","abstract_excerpt":"The Quantum Fourier Transform (QFT) is required by hidden subgroup problem (HSP) algorithms, including Shor's algorithm for factoring. The circuit depth of the QFT remains challenging for near-term hardware. To find shallower alternatives we identify two properties that are exploited by the QFT to enable HSP. Firstly, the shift invariance of the QFT allows for the removal of a random overall shift. Secondly, the QFT retains information about the hidden subgroup generator accessible in the measurement outcomes. We quantify that information via the discrete Fisher information. We construct a fam"},"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":true,"formal_links_present":true},"canonical_record":{"source":{"id":"2605.16998","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-05-16T13:47:11Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"f98b16b93984d35fa06f227a3fea493ede763b73a5624cbbb111affe38a38ae8","abstract_canon_sha256":"57a2fd942f280f5454e7e2f2bf30fc28173bba97086d66fac550be5a1ad00ae4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:03:35.197259Z","signature_b64":"VwmV+JIzs2POuu1MaxYEXaotreji5k+qRCo+jkhjSYxm0WWTmlHEV0P3Ain5EOUha2Gx412WV0FAjpOwcYJrCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c51a3dd64626b33155c502a5ad6bbf3f84ea4c54ff7f4c1369aa8bb24fe238dc","last_reissued_at":"2026-05-20T00:03:35.196470Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:03:35.196470Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"$\\mathcal{O}(n)$ alternative to Quantum Fourier Transform with efficient neural net classical post-processing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"An O(n) circuit using Hadamards and controlled-phase gates can replace the O(n squared) quantum Fourier transform in Shor's algorithm with neural-net post-processing.","cross_cats":["cs.LG"],"primary_cat":"quant-ph","authors_text":"Kaiming Bian, Oscar Dahlsten, Zujin Wen","submitted_at":"2026-05-16T13:47:11Z","abstract_excerpt":"The Quantum Fourier Transform (QFT) is required by hidden subgroup problem (HSP) algorithms, including Shor's algorithm for factoring. The circuit depth of the QFT remains challenging for near-term hardware. To find shallower alternatives we identify two properties that are exploited by the QFT to enable HSP. Firstly, the shift invariance of the QFT allows for the removal of a random overall shift. Secondly, the QFT retains information about the hidden subgroup generator accessible in the measurement outcomes. We quantify that information via the discrete Fisher information. We construct a fam"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"The O(n) HP-1 can replace the O(n^2) QFT in Shor's algorithm, as demonstrated numerically, with an efficient neural network implementing classical post-processing.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the neural network post-processing can reliably extract the hidden subgroup generator from the measurement statistics of the HP-1 circuit for arbitrary problem sizes without requiring resources that grow exponentially with n or failing under realistic noise.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"HP-1 circuits achieve O(n) depth while preserving shift invariance and exponentially growing Fisher information, enabling numerical replacement of the QFT in Shor's algorithm with neural net classical post-processing.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"An O(n) circuit using Hadamards and controlled-phase gates can replace the O(n squared) quantum Fourier transform in Shor's algorithm with neural-net post-processing.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"deed6c9147a6c6caa166305b3c10a854ed9217d3b35207a64f84e35c29cc3619"},"source":{"id":"2605.16998","kind":"arxiv","version":1},"verdict":{"id":"6d08eb12-fb26-45c7-98ee-744e99d65bc1","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T20:32:19.389950Z","strongest_claim":"The O(n) HP-1 can replace the O(n^2) QFT in Shor's algorithm, as demonstrated numerically, with an efficient neural network implementing classical post-processing.","one_line_summary":"HP-1 circuits achieve O(n) depth while preserving shift invariance and exponentially growing Fisher information, enabling numerical replacement of the QFT in Shor's algorithm with neural net classical post-processing.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the neural network post-processing can reliably extract the hidden subgroup generator from the measurement statistics of the HP-1 circuit for arbitrary problem sizes without requiring resources that grow exponentially with n or failing under realistic noise.","pith_extraction_headline":"An O(n) circuit using Hadamards and controlled-phase gates can replace the O(n squared) quantum Fourier transform in Shor's algorithm with neural-net post-processing."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.16998/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-19T21:01:19.047762Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T20:40:42.812139Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"citation_quote_validity","ran_at":"2026-05-19T19:49:57.219288Z","status":"skipped","version":"0.1.0","findings_count":0},{"name":"cited_work_retraction","ran_at":"2026-05-19T19:23:35.909929Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T18:41:56.200996Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T18:33:26.290537Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"50bf0f0f24e36d9a79a288ac92b7a284191d59330f25a64157837b6a40adac7e"},"references":{"count":38,"sample":[{"doi":"","year":1997,"title":"D. R. Simon, On the power of quantum computation, SIAM Journal on Computing26, 1474 (1997)","work_id":"7f1a715a-bbf7-4f2f-9abc-26bb3b1c23d8","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1994,"title":"P. W. Shor, Algorithms for quantum computation: Dis- crete logarithms and factoring, inProceedings 35th An- nual Symposium on Foundations of Computer Science (IEEE, 1994) pp. 124–134","work_id":"7e3b4157-e4c4-452d-bba0-fe585f289f71","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1997,"title":"P. W. Shor, Polynomial-time algorithms for prime factor- ization and discrete logarithms on a quantum computer, SIAM Journal on Computing26, 1484 (1997)","work_id":"a83c1c42-8198-46f4-ad66-596e3fe470a2","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1995,"title":"Quantum measurements and the Abelian Stabilizer Problem","work_id":"0840a06c-bc13-4619-9fd6-9abb6810e838","ref_index":4,"cited_arxiv_id":"quant-ph/9511026","is_internal_anchor":true},{"doi":"","year":2001,"title":"Jozsa, Quantum factoring, discrete logarithms, and the hidden subgroup problem, Computing in Science & Engineering3, 34 (2001)","work_id":"623e0899-b0d5-41ef-9434-7f5060a4d2d3","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":38,"snapshot_sha256":"3ec9ad6ec79fe025fe87d442026ae4db0811d1845fa3da397d19f444d83d779a","internal_anchors":5},"formal_canon":{"evidence_count":2,"snapshot_sha256":"fb94ca640776fd467d34aff479f6a571c7dc20cac6b49fd5f32461799a9585ca"},"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":"2605.16998","created_at":"2026-05-20T00:03:35.196607+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.16998v1","created_at":"2026-05-20T00:03:35.196607+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16998","created_at":"2026-05-20T00:03:35.196607+00:00"},{"alias_kind":"pith_short_12","alias_value":"YUND3VSGE2ZT","created_at":"2026-05-20T00:03:35.196607+00:00"},{"alias_kind":"pith_short_16","alias_value":"YUND3VSGE2ZTCVOF","created_at":"2026-05-20T00:03:35.196607+00:00"},{"alias_kind":"pith_short_8","alias_value":"YUND3VSG","created_at":"2026-05-20T00:03:35.196607+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":2,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YUND3VSGE2ZTCVOFAKS22257H6","json":"https://pith.science/pith/YUND3VSGE2ZTCVOFAKS22257H6.json","graph_json":"https://pith.science/api/pith-number/YUND3VSGE2ZTCVOFAKS22257H6/graph.json","events_json":"https://pith.science/api/pith-number/YUND3VSGE2ZTCVOFAKS22257H6/events.json","paper":"https://pith.science/paper/YUND3VSG"},"agent_actions":{"view_html":"https://pith.science/pith/YUND3VSGE2ZTCVOFAKS22257H6","download_json":"https://pith.science/pith/YUND3VSGE2ZTCVOFAKS22257H6.json","view_paper":"https://pith.science/paper/YUND3VSG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.16998&json=true","fetch_graph":"https://pith.science/api/pith-number/YUND3VSGE2ZTCVOFAKS22257H6/graph.json","fetch_events":"https://pith.science/api/pith-number/YUND3VSGE2ZTCVOFAKS22257H6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YUND3VSGE2ZTCVOFAKS22257H6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YUND3VSGE2ZTCVOFAKS22257H6/action/storage_attestation","attest_author":"https://pith.science/pith/YUND3VSGE2ZTCVOFAKS22257H6/action/author_attestation","sign_citation":"https://pith.science/pith/YUND3VSGE2ZTCVOFAKS22257H6/action/citation_signature","submit_replication":"https://pith.science/pith/YUND3VSGE2ZTCVOFAKS22257H6/action/replication_record"}},"created_at":"2026-05-20T00:03:35.196607+00:00","updated_at":"2026-05-20T00:03:35.196607+00:00"}