{"id":"https://openalex.org/W2051165831","doi":"https://doi.org/10.1137/050639090","title":"Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments","display_name":"Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W2051165831","doi":"https://doi.org/10.1137/050639090","mag":"2051165831"},"language":"en","primary_location":{"id":"doi:10.1137/050639090","is_oa":false,"landing_page_url":"https://doi.org/10.1137/050639090","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-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/A5046789004","display_name":"Sophie Laplante","orcid":"https://orcid.org/0009-0005-2304-4625"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Sophie Laplante","raw_affiliation_strings":["[email\u00a0protected] and [email\u00a0protected]#TAB#"],"affiliations":[{"raw_affiliation_string":"[email\u00a0protected] and [email\u00a0protected]#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5045780938","display_name":"Fr\u00e9d\u00e9ric Magniez","orcid":"https://orcid.org/0000-0003-2384-9026"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Fr\u00e9d\u00e9ric Magniez","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5046789004"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":19.4497,"has_fulltext":false,"cited_by_count":46,"citation_normalized_percentile":{"value":0.99293446,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"38","issue":"1","first_page":"46","last_page":"62"},"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9991999864578247,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9988999962806702,"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/mathematics","display_name":"Mathematics","score":0.6750187873840332},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6045469045639038},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5541149377822876},{"id":"https://openalex.org/keywords/kolmogorov-complexity","display_name":"Kolmogorov complexity","score":0.5385739207267761},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.5272922515869141},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4899994432926178},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4711049199104309},{"id":"https://openalex.org/keywords/certificate","display_name":"Certificate","score":0.468656450510025},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.43327295780181885},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.42299824953079224},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1778564453125}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6750187873840332},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6045469045639038},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5541149377822876},{"id":"https://openalex.org/C2779341405","wikidata":"https://www.wikidata.org/wiki/Q1456811","display_name":"Kolmogorov complexity","level":2,"score":0.5385739207267761},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.5272922515869141},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4899994432926178},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4711049199104309},{"id":"https://openalex.org/C96865113","wikidata":"https://www.wikidata.org/wiki/Q2946816","display_name":"Certificate","level":2,"score":0.468656450510025},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.43327295780181885},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.42299824953079224},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1778564453125},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/050639090","is_oa":false,"landing_page_url":"https://doi.org/10.1137/050639090","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1987152249","https://openalex.org/W2001383654","https://openalex.org/W2008231303","https://openalex.org/W2033216491","https://openalex.org/W2050334794","https://openalex.org/W2109924867","https://openalex.org/W2117584890","https://openalex.org/W2122780600","https://openalex.org/W2123056342","https://openalex.org/W2148132004","https://openalex.org/W2887468738","https://openalex.org/W3023447009","https://openalex.org/W3041308142","https://openalex.org/W3101695904"],"related_works":["https://openalex.org/W2964451256","https://openalex.org/W2947191600","https://openalex.org/W4377371889","https://openalex.org/W2036758175","https://openalex.org/W3046990805","https://openalex.org/W4389362338","https://openalex.org/W4287691960","https://openalex.org/W2113623403","https://openalex.org/W2055932080","https://openalex.org/W2565109825"],"abstract_inverted_index":{"We":[0],"prove":[1,18,73],"a":[2],"very":[3],"general":[4],"lower":[5,74],"bound":[6],"technique":[7,38],"for":[8,76],"quantum":[9],"and":[10,42,47,54,91],"randomized":[11],"query":[12,35],"complexity":[13,33,90],"that":[14,68],"is":[15,87,93],"easy":[16],"to":[17,22,34],"as":[19,21],"well":[20],"apply.":[23],"To":[24],"achieve":[25],"this,":[26],"we":[27],"introduce":[28],"the":[29,40,48,88,94,97],"use":[30],"of":[31,45,51,60,96],"Kolmogorov":[32],"complexity.":[36],"Our":[37],"generalizes":[39],"weighted":[41],"unweighted":[43],"methods":[44,70],"Ambainis":[46],"spectral":[49],"method":[50],"Barnum,":[52],"Saks,":[53],"Szegedy.":[55],"As":[56],"an":[57],"immediate":[58],"consequence":[59],"our":[61],"main":[62],"theorem,":[63],"it":[64],"can":[65,71],"be":[66],"shown":[67],"adversary":[69],"only":[72],"bounds":[75],"Boolean":[77],"functions":[78],"f":[79],"in":[80],"$O(\\min(\\sqrt{n":[81],"C_0(f)},\\sqrt{n":[82],"C_1(f)}))$,":[83],"where":[84],"$C_0,":[85],"C_1$":[86],"certificate":[89],"n":[92],"size":[95],"input.":[98]},"counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}