{"id":"https://openalex.org/W4415315015","doi":"https://doi.org/10.1145/3798129.3800750","title":"Fourier Spectrum of Noisy Quantum Algorithms","display_name":"Fourier Spectrum of Noisy Quantum Algorithms","publication_year":2026,"publication_date":"2026-06-09","ids":{"openalex":"https://openalex.org/W4415315015","doi":"https://doi.org/10.1145/3798129.3800750"},"language":"en","primary_location":{"id":"doi:10.1145/3798129.3800750","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800750","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1145/3798129.3800750","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5043669506","display_name":"Uma Girish","orcid":"https://orcid.org/0000-0003-3055-9406"},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]},{"id":"https://openalex.org/I78577930","display_name":"Columbia University","ror":"https://ror.org/00hj8s172","country_code":"US","type":"education","lineage":["https://openalex.org/I78577930"]}],"countries":["CA","US"],"is_corresponding":true,"raw_author_name":"Uma Girish","raw_affiliation_strings":["Columbia University, New York, USA","University of Toronto, Toronto, Canada"],"raw_orcid":"https://orcid.org/0000-0003-3055-9406","affiliations":[{"raw_affiliation_string":"Columbia University, New York, USA","institution_ids":["https://openalex.org/I78577930"]},{"raw_affiliation_string":"University of Toronto, Toronto, Canada","institution_ids":["https://openalex.org/I185261750"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5043669506"],"corresponding_institution_ids":["https://openalex.org/I185261750","https://openalex.org/I78577930"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.00860671,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"305","last_page":"313"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9940000176429749,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9940000176429749,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/quantum-fourier-transform","display_name":"Quantum Fourier transform","score":0.8414000272750854},{"id":"https://openalex.org/keywords/quantum-algorithm","display_name":"Quantum algorithm","score":0.7215999960899353},{"id":"https://openalex.org/keywords/quantum-computer","display_name":"Quantum computer","score":0.6284999847412109},{"id":"https://openalex.org/keywords/quantum-phase-estimation-algorithm","display_name":"Quantum phase estimation algorithm","score":0.6003000140190125},{"id":"https://openalex.org/keywords/fourier-transform","display_name":"Fourier transform","score":0.53329998254776},{"id":"https://openalex.org/keywords/quantum","display_name":"Quantum","score":0.43959999084472656},{"id":"https://openalex.org/keywords/qubit","display_name":"Qubit","score":0.39649999141693115},{"id":"https://openalex.org/keywords/quantum-state","display_name":"Quantum state","score":0.37860000133514404},{"id":"https://openalex.org/keywords/discrete-fourier-transform","display_name":"Discrete Fourier transform (general)","score":0.3727000057697296}],"concepts":[{"id":"https://openalex.org/C59500034","wikidata":"https://www.wikidata.org/wiki/Q1464944","display_name":"Quantum Fourier transform","level":5,"score":0.8414000272750854},{"id":"https://openalex.org/C137019171","wikidata":"https://www.wikidata.org/wiki/Q2623817","display_name":"Quantum algorithm","level":3,"score":0.7215999960899353},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6474999785423279},{"id":"https://openalex.org/C58053490","wikidata":"https://www.wikidata.org/wiki/Q176555","display_name":"Quantum computer","level":3,"score":0.6284999847412109},{"id":"https://openalex.org/C192122513","wikidata":"https://www.wikidata.org/wiki/Q2835770","display_name":"Quantum phase estimation algorithm","level":5,"score":0.6003000140190125},{"id":"https://openalex.org/C102519508","wikidata":"https://www.wikidata.org/wiki/Q6520159","display_name":"Fourier transform","level":2,"score":0.53329998254776},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4683000147342682},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.43959999084472656},{"id":"https://openalex.org/C203087015","wikidata":"https://www.wikidata.org/wiki/Q378201","display_name":"Qubit","level":3,"score":0.39649999141693115},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.37929999828338623},{"id":"https://openalex.org/C15706264","wikidata":"https://www.wikidata.org/wiki/Q230883","display_name":"Quantum state","level":3,"score":0.37860000133514404},{"id":"https://openalex.org/C57733114","wikidata":"https://www.wikidata.org/wiki/Q1006032","display_name":"Discrete Fourier transform (general)","level":5,"score":0.3727000057697296},{"id":"https://openalex.org/C43682372","wikidata":"https://www.wikidata.org/wiki/Q7269080","display_name":"Quantum operation","level":4,"score":0.34880000352859497},{"id":"https://openalex.org/C51003876","wikidata":"https://www.wikidata.org/wiki/Q1536431","display_name":"Quantum error correction","level":4,"score":0.3400999903678894},{"id":"https://openalex.org/C41241483","wikidata":"https://www.wikidata.org/wiki/Q7269015","display_name":"Quantum capacity","level":5,"score":0.31310001015663147},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.3095000088214874},{"id":"https://openalex.org/C203024314","wikidata":"https://www.wikidata.org/wiki/Q1365258","display_name":"Fourier analysis","level":3,"score":0.3095000088214874},{"id":"https://openalex.org/C187486625","wikidata":"https://www.wikidata.org/wiki/Q2122176","display_name":"Quantum channel","level":4,"score":0.30570000410079956},{"id":"https://openalex.org/C207864730","wikidata":"https://www.wikidata.org/wiki/Q179467","display_name":"Fourier series","level":2,"score":0.299699991941452},{"id":"https://openalex.org/C169699857","wikidata":"https://www.wikidata.org/wiki/Q2122243","display_name":"Quantum information","level":3,"score":0.28940001130104065},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.28110000491142273},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.2808000147342682},{"id":"https://openalex.org/C122444316","wikidata":"https://www.wikidata.org/wiki/Q1440048","display_name":"Discrete-time Fourier transform","level":5,"score":0.27869999408721924},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.2777999937534332},{"id":"https://openalex.org/C186468114","wikidata":"https://www.wikidata.org/wiki/Q836478","display_name":"Quantum network","level":4,"score":0.2775999903678894},{"id":"https://openalex.org/C185429906","wikidata":"https://www.wikidata.org/wiki/Q1130160","display_name":"Estimator","level":2,"score":0.27230000495910645},{"id":"https://openalex.org/C42355184","wikidata":"https://www.wikidata.org/wiki/Q1361088","display_name":"Matrix decomposition","level":3,"score":0.2685999870300293},{"id":"https://openalex.org/C99498987","wikidata":"https://www.wikidata.org/wiki/Q2210247","display_name":"Noise (video)","level":3,"score":0.2621999979019165},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.25920000672340393},{"id":"https://openalex.org/C11255438","wikidata":"https://www.wikidata.org/wiki/Q7269085","display_name":"Quantum process","level":4,"score":0.25099998712539673}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3798129.3800750","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800750","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:2510.06385","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2510.06385","pdf_url":"https://arxiv.org/pdf/2510.06385","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2510.06385","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2510.06385","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.1145/3798129.3800750","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800750","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Quantum":[0],"computing":[1],"promises":[2],"exponential":[3],"speedups":[4],"for":[5],"certain":[6],"problems,":[7],"yet":[8],"fully":[9],"universal":[10],"quantum":[11,29,46,78,94],"computers":[12],"remain":[13],"out":[14],"of":[15,57,60,63,65,84,107],"reach":[16],"and":[17,31,36,47,68],"near-term":[18],"devices":[19],"are":[20],"inherently":[21],"noisy.":[22],"Motivated":[23],"by":[24],"this,":[25],"we":[26],"study":[27],"noisy":[28],"algorithms":[30,49,79],"the":[32,51,82,105],"landscape":[33],"between":[34],"BQP":[35],"BPP.":[37],"We":[38,87],"build":[39],"on":[40,81,92],"a":[41,93],"powerful":[42],"technique":[43],"to":[44,76,104],"differentiate":[45,77],"classical":[48],"called":[50],"level-\u2113":[52],"Fourier":[53,61,98],"growth":[54,99],"(the":[55],"sum":[56],"absolute":[58],"values":[59],"coefficients":[62],"sets":[64],"size":[66],"\u2113)":[67],"show":[69,88],"that":[70,89],"it":[71],"can":[72],"also":[73],"be":[74],"used":[75],"based":[80],"types":[83],"resources":[85],"used.":[86],"noise":[90],"acting":[91],"algorithm":[95],"dampens":[96],"its":[97],"in":[100],"ways":[101],"intricately":[102],"linked":[103],"type":[106],"noise.":[108]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-18T00:00:00"}