{"id":"https://openalex.org/W2015919213","doi":"https://doi.org/10.1145/1007352.1007427","title":"Quantum and classical query complexities of local search are polynomially related","display_name":"Quantum and classical query complexities of local search are polynomially related","publication_year":2004,"publication_date":"2004-06-13","ids":{"openalex":"https://openalex.org/W2015919213","doi":"https://doi.org/10.1145/1007352.1007427","mag":"2015919213"},"language":"en","primary_location":{"id":"doi:10.1145/1007352.1007427","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1007352.1007427","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirty-sixth annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},"type":"article","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/A5046562790","display_name":"Mikl\u00f3s S\u00e1ntha","orcid":null},"institutions":[{"id":"https://openalex.org/I102197404","display_name":"Universit\u00e9 Paris-Sud","ror":"https://ror.org/028rypz17","country_code":"FR","type":"education","lineage":["https://openalex.org/I102197404"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Miklos Santha","raw_affiliation_strings":["Universit\u00e9 Paris--Sud, Orsay, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e9 Paris--Sud, Orsay, France","institution_ids":["https://openalex.org/I102197404"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113860564","display_name":"M\u00e1ri\u00f3 Szegedy","orcid":null},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mario Szegedy","raw_affiliation_strings":["Rutgers University, Piscataway, NJ"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Rutgers University, Piscataway, NJ","institution_ids":["https://openalex.org/I102322142"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":6.4765,"has_fulltext":false,"cited_by_count":23,"citation_normalized_percentile":{"value":0.96309979,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"494","last_page":"501"},"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.9998999834060669,"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.9998999834060669,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9973000288009644,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9968000054359436,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/combinatorics","display_name":"Combinatorics","score":0.6250714063644409},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6159242391586304},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.5376464128494263},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5372445583343506},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5191342234611511},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.47508135437965393},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.47406548261642456},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.46967631578445435},{"id":"https://openalex.org/keywords/deterministic-algorithm","display_name":"Deterministic algorithm","score":0.459003210067749},{"id":"https://openalex.org/keywords/value","display_name":"Value (mathematics)","score":0.41788220405578613},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.41128405928611755},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.30593907833099365}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6250714063644409},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6159242391586304},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.5376464128494263},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5372445583343506},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5191342234611511},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.47508135437965393},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.47406548261642456},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46967631578445435},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.459003210067749},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.41788220405578613},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.41128405928611755},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.30593907833099365},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1007352.1007427","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1007352.1007427","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirty-sixth annual ACM symposium on Theory of computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W67017478","https://openalex.org/W976211528","https://openalex.org/W1878136078","https://openalex.org/W1973725012","https://openalex.org/W1980813953","https://openalex.org/W2001383654","https://openalex.org/W2006290558","https://openalex.org/W2007873061","https://openalex.org/W2025373303","https://openalex.org/W2034038586","https://openalex.org/W2040958198","https://openalex.org/W2050334794","https://openalex.org/W2052642357","https://openalex.org/W2067046685","https://openalex.org/W2083120484","https://openalex.org/W2084652510","https://openalex.org/W2103981148","https://openalex.org/W2109924867","https://openalex.org/W2117584890","https://openalex.org/W2122780600","https://openalex.org/W2126323053","https://openalex.org/W2126338609","https://openalex.org/W2137370200","https://openalex.org/W2144385516","https://openalex.org/W2150340379","https://openalex.org/W2153887174","https://openalex.org/W2753176400","https://openalex.org/W3041308142","https://openalex.org/W3100558667","https://openalex.org/W4249958171"],"related_works":["https://openalex.org/W2052299349","https://openalex.org/W1901944325","https://openalex.org/W4297728441","https://openalex.org/W2187824534","https://openalex.org/W2148720069","https://openalex.org/W4205772203","https://openalex.org/W1994341438","https://openalex.org/W1608057972","https://openalex.org/W2963872281","https://openalex.org/W4300486487"],"abstract_inverted_index":{"Let":[0],"f":[1,30,57,84],"be":[2,32],"an":[3,14],"integer":[4],"valued":[5],"function":[6],"on":[7,59,85],"a":[8,26,36,42],"finite":[9],"set":[10],"V.":[11],"We":[12,87],"call":[13],"undirected":[15],"graph":[16],"G(V,E)a":[17],"neighborhood":[18,38],"structure":[19,39],"for":[20,29,35],"f.":[21],"The":[22,64],"problem":[23,99,119],"of":[24,62,66,74,76,83,97,107],"finding":[25],"local":[27],"minimum":[28],"can":[31],"phrased":[33],"as:":[34],"fixed":[37],"G(V,E)":[40],"find":[41],"vertex":[43],"x":[44],"\u2208":[45],"V":[46],"such":[47],"that":[48,56,89],"f(x)":[49],"is":[50,69,80],"not":[51],"bigger":[52],"than":[53],"any":[54],"value":[55,82],"takes":[58],"some":[60],"neighbor":[61],"x.":[63],"complexity":[65],"the":[67,72,77,81,90,98,116],"algorithm":[68],"measured":[70],"by":[71],"number":[73],"questions":[75],"form":[78],"what":[79],"x?":[86],"show":[88],"deterministic,":[91],"randomized":[92],"and":[93,110,114],"quantum":[94],"query":[95],"complexities":[96],"are":[100],"polynomially":[101],"related.":[102],"This":[103],"generalizes":[104],"earlier":[105],"results":[106],"Aldous[4]":[108],"Ald":[109],"Aaronson":[111],"[1]":[112],"Aar":[113],"solves":[115],"main":[117],"open":[118],"in":[120],"Aar.":[121]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}