{"id":"https://openalex.org/W1175323720","doi":null,"title":"Efficient algorithms in quantum query complexity","display_name":"Efficient algorithms in quantum query complexity","publication_year":2014,"publication_date":"2014-08-13","ids":{"openalex":"https://openalex.org/W1175323720","mag":"1175323720"},"language":"en","primary_location":{"id":"pmh:oai:uwspace.uwaterloo.ca:10012/8625","doi":null,"is_oa":true,"landing_page_url":"http://hdl.handle.net/10012/8625","pdf_url":"http://hdl.handle.net/10012/8625","source":{"id":"https://openalex.org/S4306401661","display_name":"UWSpace (University of Waterloo)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I151746483","host_organization_name":"University of Waterloo","host_organization_lineage":["https://openalex.org/I151746483"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Doctoral Thesis"},"volume":null,"type":"dissertation","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/10012/8625","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5049220382","display_name":"Robin Kothari","orcid":"https://orcid.org/0000-0001-6114-943X","observed_orcids":["https://orcid.org/0000-0001-6114-943X"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Robin Kothari","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5049220382"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":26,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.9984999895095825,"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.9984999895095825,"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.0007999999797903001,"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/T10020","display_name":"Quantum Information and Cryptography","score":0.00019999999494757503,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/quantum-query-complexity","display_name":"quantum query complexity","score":1.0},{"id":"https://openalex.org/keywords/hamiltonian-simulation","display_name":"Hamiltonian simulation","score":0.9399999976158142},{"id":"https://openalex.org/keywords/boolean-matrix-multiplication","display_name":"Boolean matrix multiplication","score":0.7549999952316284},{"id":"https://openalex.org/keywords/forbidden-subgraphs","display_name":"forbidden subgraphs","score":0.7289999723434448},{"id":"https://openalex.org/keywords/quantum-walk-search","display_name":"quantum walk search","score":0.6629999876022339},{"id":"https://openalex.org/keywords/semidefinite-programming","display_name":"semidefinite programming","score":0.8479999899864197},{"id":"https://openalex.org/keywords/composition-theorem","display_name":"composition theorem","score":0.5960000157356262},{"id":"https://openalex.org/keywords/sublinear-algorithms","display_name":"sublinear-time algorithms","score":0.47200000286102295}],"concepts":[{"id":"https://openalex.org/C17349429","wikidata":"https://www.wikidata.org/wiki/Q1049914","display_name":"Matrix multiplication","level":3,"score":0.5757524967193604},{"id":"https://openalex.org/C137019171","wikidata":"https://www.wikidata.org/wiki/Q2623817","display_name":"Quantum algorithm","level":3,"score":0.544483482837677},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.514807403087616},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4784277081489563},{"id":"https://openalex.org/C39096654","wikidata":"https://www.wikidata.org/wiki/Q728507","display_name":"Strassen algorithm","level":4,"score":0.43215325474739075},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.42481929063796997},{"id":"https://openalex.org/C58053490","wikidata":"https://www.wikidata.org/wiki/Q176555","display_name":"Quantum computer","level":3,"score":0.4144389033317566},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3554399013519287},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.33862584829330444},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.2541466951370239},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:uwspace.uwaterloo.ca:10012/8625","doi":null,"is_oa":true,"landing_page_url":"http://hdl.handle.net/10012/8625","pdf_url":"http://hdl.handle.net/10012/8625","source":{"id":"https://openalex.org/S4306401661","display_name":"UWSpace (University of Waterloo)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I151746483","host_organization_name":"University of Waterloo","host_organization_lineage":["https://openalex.org/I151746483"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Doctoral Thesis"},{"id":"mag:1175323720","doi":null,"is_oa":false,"landing_page_url":"https://uwspace.uwaterloo.ca/bitstream/10012/8625/1/Kothari_Robin.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"pmh:oai:uwspace.uwaterloo.ca:10012/8625","doi":null,"is_oa":true,"landing_page_url":"http://hdl.handle.net/10012/8625","pdf_url":"http://hdl.handle.net/10012/8625","source":{"id":"https://openalex.org/S4306401661","display_name":"UWSpace (University of Waterloo)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I151746483","host_organization_name":"University of Waterloo","host_organization_lineage":["https://openalex.org/I151746483"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Doctoral Thesis"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1175323720.pdf","grobid_xml":"https://content.openalex.org/works/W1175323720.grobid-xml"},"referenced_works_count":103,"referenced_works":["https://openalex.org/W130302987","https://openalex.org/W998887031","https://openalex.org/W1444168583","https://openalex.org/W1480910789","https://openalex.org/W1483489440","https://openalex.org/W1492999010","https://openalex.org/W1493399357","https://openalex.org/W1516729503","https://openalex.org/W1523387560","https://openalex.org/W1527197079","https://openalex.org/W1531411745","https://openalex.org/W1531431453","https://openalex.org/W1541629428","https://openalex.org/W1550265671","https://openalex.org/W1561344775","https://openalex.org/W1562115776","https://openalex.org/W1564709644","https://openalex.org/W1575050855","https://openalex.org/W1576866980","https://openalex.org/W1597947384","https://openalex.org/W1638042873","https://openalex.org/W1667742331","https://openalex.org/W1699132431","https://openalex.org/W1704039455","https://openalex.org/W1741741009","https://openalex.org/W1751325145","https://openalex.org/W1766136245","https://openalex.org/W1815531993","https://openalex.org/W1915058039","https://openalex.org/W1964032471","https://openalex.org/W1967546560","https://openalex.org/W1980669364","https://openalex.org/W1985671429","https://openalex.org/W1987962147","https://openalex.org/W1987965590","https://openalex.org/W1987996179","https://openalex.org/W1993000433","https://openalex.org/W1999502904","https://openalex.org/W2001383654","https://openalex.org/W2006096862","https://openalex.org/W2006290558","https://openalex.org/W2007224204","https://openalex.org/W2008231303","https://openalex.org/W2009155360","https://openalex.org/W2009948449","https://openalex.org/W2010275623","https://openalex.org/W2012496360","https://openalex.org/W2017112356","https://openalex.org/W2020918964","https://openalex.org/W2028212109","https://openalex.org/W2033216491","https://openalex.org/W2035476608","https://openalex.org/W2035627701","https://openalex.org/W2038435918","https://openalex.org/W2039565992","https://openalex.org/W2040792108","https://openalex.org/W2048106445","https://openalex.org/W2051165831","https://openalex.org/W2053993705","https://openalex.org/W2058286540","https://openalex.org/W2067661972","https://openalex.org/W2079692740","https://openalex.org/W2081161648","https://openalex.org/W2082507052","https://openalex.org/W2082949155","https://openalex.org/W2083349416","https://openalex.org/W2084565809","https://openalex.org/W2084652510","https://openalex.org/W2084803275","https://openalex.org/W2098948451","https://openalex.org/W2100827027","https://openalex.org/W2102687371","https://openalex.org/W2103473460","https://openalex.org/W2107808918","https://openalex.org/W2120560473","https://openalex.org/W2121981260","https://openalex.org/W2122271558","https://openalex.org/W2122780600","https://openalex.org/W2122964527","https://openalex.org/W2129113961","https://openalex.org/W2135046907","https://openalex.org/W2139709458","https://openalex.org/W2147862220","https://openalex.org/W2148007971","https://openalex.org/W2151438396","https://openalex.org/W2156652176","https://openalex.org/W2179731956","https://openalex.org/W2281849010","https://openalex.org/W2295428206","https://openalex.org/W2490907619","https://openalex.org/W2583308334","https://openalex.org/W2593070235","https://openalex.org/W2887468738","https://openalex.org/W2952408444","https://openalex.org/W2964030075","https://openalex.org/W3023478445","https://openalex.org/W3041308142","https://openalex.org/W3098076883","https://openalex.org/W3100606823","https://openalex.org/W3101636216","https://openalex.org/W3103161513","https://openalex.org/W3103735887","https://openalex.org/W4244771276"],"related_works":["https://openalex.org/W130302987","https://openalex.org/W1599413552","https://openalex.org/W2294113999","https://openalex.org/W1699132431","https://openalex.org/W2082507052","https://openalex.org/W3197851786","https://openalex.org/W1619921224","https://openalex.org/W121256723","https://openalex.org/W7215113765","https://openalex.org/W7100030433"],"abstract_inverted_index":{"In":[0],"this":[1],"thesis":[2],"we":[3,22,42,116,263],"provide":[4,43],"new":[5,67,90,175,256],"upper":[6,349],"and":[7,33,137,161,173,197,203,254,273,294,331,346],"lower":[8,311],"bounds":[9,350],"on":[10,65,159,167,246,315],"the":[11,38,52,102,105,112,146,151,181,190,204,236,239,250,265,320,341],"quantum":[12,24,45,68,148,191,266,290,342],"query":[13,48,192,229,267,291],"complexity":[14,49,193,230,268,292],"of":[15,19,81,92,134,180,194,238,269,287,319,322,340],"a":[16,44,66,89,131,174,247,255,284,300,316,337],"diverse":[17],"set":[18,133,286],"problems.":[20,354],"Specifically,":[21],"study":[23,189,264],"algorithms":[25,335],"for":[26,70,150,178,216,258,351],"Hamiltonian":[27,39],"simulation,":[28],"matrix":[29,195,218],"multiplication,":[30],"oracle":[31,113,119],"identification,":[32],"graph-property":[34],"recognition.":[35],"\\n":[36,110,186,261],"\\nFor":[37],"simulation":[40],"problem,":[41,115],"algorithm":[46,62,69,87,149,164,215,243,257],"with":[47,228,307,325],"sublogarithmic":[50],"in":[51,156,207],"inverse":[53],"error,":[54],"an":[55,122,213],"exponential":[56],"improvement":[57],"over":[58,200],"previous":[59],"methods.":[60],"Our":[61,163,209,310,334],"is":[63,108,140,154,165,212,235,244,313],"based":[64,166,245,314],"implementing":[71],"unitary":[72,84],"matrices":[73,227],"that":[74,96,153,220,275,279,296],"can":[75,97,302],"be":[76,98,281,303],"written":[77],"as":[78],"linear":[79],"combinations":[80],"efficiently":[82],"implementable":[83],"gates.":[85],"This":[86],"uses":[88],"form":[91],"``oblivious":[93],"amplitude":[94],"amplification''":[95],"applied":[99],"even":[100],"though":[101],"reflection":[103],"about":[104],"input":[106],"state":[107],"unavailable.":[109],"\\nIn":[111],"identification":[114],"are":[117,336],"given":[118],"access":[120],"to":[121,128,130,141,249,327],"unknown":[123],"N-bit":[124],"string":[125],"x":[126,224],"promised":[127],"belong":[129],"known":[132],"size":[135],"M,":[136],"our":[138],"task":[139],"identify":[142],"x.":[143],"We":[144],"present":[145],"first":[147],"problem":[152,253],"optimal":[155],"its":[157],"dependence":[158],"N":[160],"M.":[162],"ideas":[168],"from":[169],"classical":[170],"learning":[171],"theory":[172],"composition":[176],"theorem":[177],"solutions":[179],"filtered":[182],"gamma_2-norm":[183],"semidefinite":[184],"program.":[185],"\\nWe":[187],"then":[188],"multiplication":[196,219],"related":[198],"problems":[199],"rings,":[201],"semirings,":[202],"Boolean":[205,217,226],"semiring":[206],"particular.":[208],"main":[210],"result":[211],"output-sensitive":[214],"multiplies":[221],"two":[222],"n":[223,225],"O(n":[231],"sqrt{l}),":[232],"where":[233],"l":[234],"sparsity":[237],"output":[240],"matrix.":[241],"The":[242],"reduction":[248],"graph":[251,259,271],"collision":[252],"collision.":[260],"\\nFinally,":[262],"minor-closed":[270,277,323],"properties":[272,324],"show":[274],"most":[276],"properties---those":[278],"cannot":[280],"characterized":[282],"by":[283],"finite":[285],"forbidden":[288,328,332],"subgraphs---have":[289],"Theta(n^{3/2})":[293],"those":[295],"do":[297],"have":[298],"such":[299],"characterization":[301],"solved":[304],"strictly":[305],"faster,":[306],"o(n^{3/2})":[308],"queries.":[309],"bound":[312],"detailed":[317],"analysis":[318],"structure":[321],"respect":[326],"topological":[329],"minors":[330],"subgraphs.":[333],"novel":[338],"application":[339],"walk":[343],"search":[344],"framework":[345],"give":[347],"improved":[348],"several":[352],"subgraph-finding":[353]},"counts_by_year":[{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-06-24T00:00:00"}
