{"id":"https://openalex.org/W4235656990","doi":"https://doi.org/10.1137/1.9781611973075.37","title":"Quantum algorithms for highly non-linear Boolean functions","display_name":"Quantum algorithms for highly non-linear Boolean functions","publication_year":2010,"publication_date":"2010-01-17","ids":{"openalex":"https://openalex.org/W4235656990","doi":"https://doi.org/10.1137/1.9781611973075.37"},"language":"en","primary_location":{"id":"doi:10.1137/1.9781611973075.37","doi":"https://doi.org/10.1137/1.9781611973075.37","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9781611973075.37","pdf_url":null,"source":{"id":"https://openalex.org/S4363608728","display_name":"ACM-SIAM Symposium on Discrete Algorithms (SODA)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5109086831","display_name":"Martin R\u00f6tteler","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Martin R\u00f6tteler","raw_affiliation_strings":["NEC Laboratories America, 4 Independence Way, Suite 200, Princeton, NJ"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"NEC Laboratories America, 4 Independence Way, Suite 200, Princeton, NJ","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5109086831"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.8543,"has_fulltext":false,"cited_by_count":28,"citation_normalized_percentile":{"value":0.66007085,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"448","last_page":"457"},"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.9951000213623047,"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.9951000213623047,"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"}},{"id":"https://openalex.org/T10020","display_name":"Quantum Information and Cryptography","score":0.00139999995008111,"subfield":{"id":"https://openalex.org/subfields/3107","display_name":"Atomic and Molecular Physics, and Optics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.00139999995008111,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/quantum-algorithms","display_name":"quantum algorithms","score":0.9639999866485596},{"id":"https://openalex.org/keywords/bent-functions","display_name":"bent functions","score":0.9879999756813049},{"id":"https://openalex.org/keywords/exponential-separation","display_name":"exponential separation","score":0.5860000252723694},{"id":"https://openalex.org/keywords/query-complexity","display_name":"query complexity","score":0.7699999809265137},{"id":"https://openalex.org/keywords/boolean-hypercube","display_name":"Boolean hypercube","score":0.640999972820282}],"concepts":[{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.7035542726516724},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6214125752449036},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5351563096046448},{"id":"https://openalex.org/C58053490","wikidata":"https://www.wikidata.org/wiki/Q176555","display_name":"Quantum computer","level":3,"score":0.4545331597328186},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.43792349100112915},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.4151774048805237},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3356761634349823},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.10781005024909973},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.09240373969078064}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/1.9781611973075.37","doi":"https://doi.org/10.1137/1.9781611973075.37","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9781611973075.37","pdf_url":null,"source":{"id":"https://openalex.org/S4363608728","display_name":"ACM-SIAM Symposium on Discrete Algorithms (SODA)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1790722724","https://openalex.org/W7098785113","https://openalex.org/W4416410500","https://openalex.org/W3194693657","https://openalex.org/W1815531993","https://openalex.org/W2017112356","https://openalex.org/W4249060295","https://openalex.org/W2305234604","https://openalex.org/W7095256069","https://openalex.org/W2539060030"],"abstract_inverted_index":{"Attempts":[0],"to":[1,20,79,180],"separate":[2],"the":[3,44,134,152,174,190],"power":[4],"of":[5,10,46,63,83,112,127,143,160,171],"classical":[6,175],"and":[7,86,166,195],"quantum":[8,67,148],"models":[9],"computation":[11],"have":[12,73],"a":[13,33,35,61,168,186],"long":[14],"history.":[15],"The":[16],"ultimate":[17],"goal":[18],"is":[19,178],"find":[21],"exponential":[22,99],"separations":[23,29,100],"for":[24,50,60,98,109,156],"computational":[25],"problems.":[26],"However,":[27],"such":[28],"do":[30],"not":[31],"come":[32],"dime":[34],"dozen:":[36],"while":[37,173],"there":[38],"were":[39,69],"some":[40],"early":[41],"successes":[42],"in":[43,122,163],"form":[45],"hidden":[47,81,103,153],"subgroup":[48],"problems":[49,72,105,155],"abelian":[51],"groups\u2013which":[52],"generalize":[53],"Shor's":[54],"factoring":[55],"algorithm":[56],"perhaps":[57],"most":[58],"faithfully\u2013only":[59],"handful":[62],"non-abelian":[64],"groups":[65],"efficient":[66],"algorithms":[68,149],"found.":[70],"Recently,":[71],"gotten":[74],"increased":[75],"attention":[76],"that":[77,106,150,188],"seek":[78],"identify":[80],"sub-structures":[82],"other":[84],"combinatorial":[85],"algebraic":[87],"objects":[88],"besides":[89],"groups.":[90],"In":[91],"this":[92],"paper":[93],"we":[94],"provide":[95],"new":[96,147],"examples":[97],"by":[101],"considering":[102],"shift":[104,154],"are":[107],"defined":[108],"several":[110,157],"classes":[111,159],"highly":[113],"non-linear":[114],"Boolean":[115,135],"functions.":[116],"These":[117],"so-called":[118],"bent":[119,161,193],"functions":[120,162,194],"arise":[121],"cryptography,":[123],"where":[124],"their":[125,196],"property":[126],"having":[128],"perfectly":[129],"flat":[130],"Fourier":[131,197],"spectra":[132],"on":[133],"hypercube":[136],"gives":[137],"them":[138],"resilience":[139],"against":[140],"certain":[141],"types":[142],"attack.":[144],"We":[145],"present":[146],"solve":[151],"well-known":[158],"polynomial":[164],"time":[165],"with":[167],"constant":[169],"number":[170],"queries,":[172],"query":[176],"complexity":[177],"shown":[179],"be":[181],"exponential.":[182],"Our":[183],"approach":[184],"uses":[185],"technique":[187],"exploits":[189],"duality":[191],"between":[192],"transforms.":[198]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2022-05-12T00:00:00"}