{"work":{"id":"d02ea74c-b444-42d3-99c7-9f5e8e5f468e","openalex_id":null,"doi":null,"arxiv_id":"quant-ph/0201067","raw_key":null,"title":"An approximate Fourier transform useful in quantum factoring","authors":null,"authors_text":"D","year":2002,"venue":"quant-ph","abstract":"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)","external_url":"https://arxiv.org/abs/quant-ph/0201067","cited_by_count":null,"metadata_source":"pith","metadata_fetched_at":"2026-05-24T12:24:27.563325+00:00","pith_arxiv_id":"quant-ph/0201067","created_at":"2026-05-10T22:55:48.832950+00:00","updated_at":"2026-06-05T21:23:00.469572+00:00","title_quality_ok":true,"display_title":"An approximate Fourier transform useful in quantum factoring","render_title":"An approximate Fourier transform useful in quantum factoring"},"hub":{"state":{"work_id":"d02ea74c-b444-42d3-99c7-9f5e8e5f468e","tier":"hub","tier_reason":"10+ Pith inbound or 1,000+ external citations","pith_inbound_count":15,"external_cited_by_count":null,"distinct_field_count":2,"first_pith_cited_at":"2022-01-25T19:00:10+00:00","last_pith_cited_at":"2026-05-20T22:43:03+00:00","author_build_status":"not_needed","summary_status":"needed","contexts_status":"needed","graph_status":"needed","ask_index_status":"not_needed","reader_status":"not_needed","recognition_status":"not_needed","updated_at":"2026-06-08T10:02:57.094251+00:00","tier_text":"hub"},"tier":"hub","role_counts":[{"context_role":"background","n":2},{"context_role":"dataset","n":2}],"polarity_counts":[{"context_polarity":"use_dataset","n":2},{"context_polarity":"background","n":1},{"context_polarity":"unclear","n":1}],"runs":{},"summary":{},"graph":{},"authors":[]}}