{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2002:RMZYZ3GXHOZSKLBUZH4BSNPD6T","short_pith_number":"pith:RMZYZ3GX","schema_version":"1.0","canonical_sha256":"8b338cecd73bb3252c34c9f81935e3f4fed96603c0ddbda2bb51232587fc0f81","source":{"kind":"arxiv","id":"quant-ph/0201067","version":1},"attestation_state":"computed","paper":{"title":"An approximate Fourier transform useful in quantum factoring","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"D. Coppersmith","submitted_at":"2002-01-16T21:04:03Z","abstract_excerpt":"We define an approximate version of the Fourier transform on $2^L$ elements, which is computationally attractive in a certain setting, and which may find application to the problem of factoring integers with a quantum computer as is currently under investigation by Peter Shor. (1994 IBM Internal Report)"},"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":"quant-ph/0201067","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2002-01-16T21:04:03Z","cross_cats_sorted":[],"title_canon_sha256":"a8a788f78a8eb552dd9069ef96ab3e2325a7299e3730aa88119176a5687edc2d","abstract_canon_sha256":"0196eca7958ed692027c48bd2388cf0172f95628fc14a67bdc47c2cd9634e683"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:45:52.667875Z","signature_b64":"cOzN/izAICQzz+dLXOZU5hpNos8RlfB0dA7zati5vysCb6UfeEc4KvKNjLgo4X9EHHthlYKOPbaUlAYBMpMJDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b338cecd73bb3252c34c9f81935e3f4fed96603c0ddbda2bb51232587fc0f81","last_reissued_at":"2026-07-04T14:45:52.667511Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:45:52.667511Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An approximate Fourier transform useful in quantum factoring","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"D. Coppersmith","submitted_at":"2002-01-16T21:04:03Z","abstract_excerpt":"We define an approximate version of the Fourier transform on $2^L$ elements, which is computationally attractive in a certain setting, and which may find application to the problem of factoring integers with a quantum computer as is currently under investigation by Peter Shor. (1994 IBM Internal Report)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0201067","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/quant-ph/0201067/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":"quant-ph/0201067","created_at":"2026-07-04T14:45:52.667572+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0201067v1","created_at":"2026-07-04T14:45:52.667572+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0201067","created_at":"2026-07-04T14:45:52.667572+00:00"},{"alias_kind":"pith_short_12","alias_value":"RMZYZ3GXHOZS","created_at":"2026-07-04T14:45:52.667572+00:00"},{"alias_kind":"pith_short_16","alias_value":"RMZYZ3GXHOZSKLBU","created_at":"2026-07-04T14:45:52.667572+00:00"},{"alias_kind":"pith_short_8","alias_value":"RMZYZ3GX","created_at":"2026-07-04T14:45:52.667572+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":21,"internal_anchor_count":14,"sample":[{"citing_arxiv_id":"2606.18981","citing_title":"Not Your Usual FFT: QFT$\\rightarrow$FFT via Classical Quantum-Circuit Simulation","ref_index":9,"is_internal_anchor":true},{"citing_arxiv_id":"2606.18494","citing_title":"Towards an Optimally Distributed Quantum Fourier Transform Circuit","ref_index":29,"is_internal_anchor":true},{"citing_arxiv_id":"2607.02456","citing_title":"A Quantum-Walk Representation of Color-Ordered MHV Scattering Amplitudes","ref_index":43,"is_internal_anchor":true},{"citing_arxiv_id":"2606.11843","citing_title":"Quantum iterative approach to the Traveling Salesman Problem","ref_index":14,"is_internal_anchor":true},{"citing_arxiv_id":"2606.08276","citing_title":"QnRL: Quantum-Native Reinforcement Learning","ref_index":34,"is_internal_anchor":true},{"citing_arxiv_id":"2605.26021","citing_title":"Toward General Quantum Control with Physics-Informed Large Language Models","ref_index":48,"is_internal_anchor":true},{"citing_arxiv_id":"2201.10574","citing_title":"Basic Quantum Algorithms","ref_index":15,"is_internal_anchor":true},{"citing_arxiv_id":"2409.15645","citing_title":"Quantum Machine Learning in Drug Discovery: Applications in Academia and Pharmaceutical Industries","ref_index":1,"is_internal_anchor":true},{"citing_arxiv_id":"2605.21795","citing_title":"ATHENA: A Compiler For Optimized Scheduling In Distributed Quantum Computers","ref_index":36,"is_internal_anchor":true},{"citing_arxiv_id":"2510.07195","citing_title":"Accelerating Inference for Multilayer Neural Networks with Quantum Computers","ref_index":107,"is_internal_anchor":true},{"citing_arxiv_id":"2605.16074","citing_title":"When Noisy Quantum Order Finding Remains Recoverable for Shor's Algorithm","ref_index":8,"is_internal_anchor":true},{"citing_arxiv_id":"2605.19854","citing_title":"Unveiling Energetic Advantage in Superconducting Cat-Qubits Quantum Computation","ref_index":54,"is_internal_anchor":true},{"citing_arxiv_id":"2605.16998","citing_title":"$\\mathcal{O}(n)$ alternative to Quantum Fourier Transform with efficient neural net classical post-processing","ref_index":14,"is_internal_anchor":true},{"citing_arxiv_id":"2506.01666","citing_title":"Synthesis of discrete-continuous quantum circuits with multimodal diffusion models","ref_index":54,"is_internal_anchor":true},{"citing_arxiv_id":"2605.10710","citing_title":"Communication-Efficient Distributed Inverse Quantum Fourier Transform","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2605.05347","citing_title":"The true cost of factoring: Linking magic and number-theoretic complexity in Shor's algorithm","ref_index":49,"is_internal_anchor":false},{"citing_arxiv_id":"2605.00118","citing_title":"Toward Secure Multitenant Quantum Computing: Circuit Affinity, Crosstalk Patterns, and Grouping Strategies","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2604.12256","citing_title":"Large-Scale Quantum Circuit Simulation on HPC Cluster via Cache Blocking, Boosting, and Gate Fusion Optimization","ref_index":7,"is_internal_anchor":false},{"citing_arxiv_id":"2605.07876","citing_title":"Per-Phase Fidelity Attribution for Quantum Compilers using HBR Decomposition","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2604.06094","citing_title":"Pixel-Translation-Equivariant Quantum Convolutional Neural Networks via Fourier Multiplexers","ref_index":46,"is_internal_anchor":false},{"citing_arxiv_id":"2604.05456","citing_title":"Phase-Fidelity-Aware Truncated Quantum Fourier Transform for Scalable Phase Estimation on NISQ Hardware","ref_index":15,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RMZYZ3GXHOZSKLBUZH4BSNPD6T","json":"https://pith.science/pith/RMZYZ3GXHOZSKLBUZH4BSNPD6T.json","graph_json":"https://pith.science/api/pith-number/RMZYZ3GXHOZSKLBUZH4BSNPD6T/graph.json","events_json":"https://pith.science/api/pith-number/RMZYZ3GXHOZSKLBUZH4BSNPD6T/events.json","paper":"https://pith.science/paper/RMZYZ3GX"},"agent_actions":{"view_html":"https://pith.science/pith/RMZYZ3GXHOZSKLBUZH4BSNPD6T","download_json":"https://pith.science/pith/RMZYZ3GXHOZSKLBUZH4BSNPD6T.json","view_paper":"https://pith.science/paper/RMZYZ3GX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0201067&json=true","fetch_graph":"https://pith.science/api/pith-number/RMZYZ3GXHOZSKLBUZH4BSNPD6T/graph.json","fetch_events":"https://pith.science/api/pith-number/RMZYZ3GXHOZSKLBUZH4BSNPD6T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RMZYZ3GXHOZSKLBUZH4BSNPD6T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RMZYZ3GXHOZSKLBUZH4BSNPD6T/action/storage_attestation","attest_author":"https://pith.science/pith/RMZYZ3GXHOZSKLBUZH4BSNPD6T/action/author_attestation","sign_citation":"https://pith.science/pith/RMZYZ3GXHOZSKLBUZH4BSNPD6T/action/citation_signature","submit_replication":"https://pith.science/pith/RMZYZ3GXHOZSKLBUZH4BSNPD6T/action/replication_record"}},"created_at":"2026-07-04T14:45:52.667572+00:00","updated_at":"2026-07-04T14:45:52.667572+00:00"}