{"id":"https://openalex.org/W1843656387","doi":null,"title":"Lower Bounds on Quantum Query and Learning Graph Complexities","display_name":"Lower Bounds on Quantum Query and Learning Graph Complexities","publication_year":2014,"publication_date":"2014-07-22","ids":{"openalex":"https://openalex.org/W1843656387","mag":"1843656387"},"language":"en","primary_location":{"id":"pmh:oai:uwspace.uwaterloo.ca:10012/8577","doi":null,"is_oa":true,"landing_page_url":"http://hdl.handle.net/10012/8577","pdf_url":"http://hdl.handle.net/10012/8577","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","indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/10012/8577","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5088352536","display_name":"Ansis Rosmanis","orcid":"https://orcid.org/0000-0003-1012-1693","observed_orcids":["https://orcid.org/0000-0003-1012-1693"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Ansis Rosmanis","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0003-1012-1693","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5088352536"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":2,"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.9937000274658203,"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.9937000274658203,"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.004100000020116568,"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.0006000000284984708,"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-query-algorithms","display_name":"quantum query algorithms","score":0.8370000123977661},{"id":"https://openalex.org/keywords/lower-bounds","display_name":"lower bounds","score":0.8899999856948853},{"id":"https://openalex.org/keywords/dual-problem","display_name":"dual problem","score":0.781000018119812},{"id":"https://openalex.org/keywords/boolean-functions","display_name":"Boolean functions","score":0.7049999833106995},{"id":"https://openalex.org/keywords/decision-problems","display_name":"decision problems","score":0.8799999952316284},{"id":"https://openalex.org/keywords/quantum-query-complexity","display_name":"quantum query complexity","score":0.49900001287460327}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5343918204307556},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5125160217285156},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.48122382164001465},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4244639575481415},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4176713228225708},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4056329131126404},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.30713677406311035},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27027028799057007},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:uwspace.uwaterloo.ca:10012/8577","doi":null,"is_oa":true,"landing_page_url":"http://hdl.handle.net/10012/8577","pdf_url":"http://hdl.handle.net/10012/8577","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":"pmh:oai:CiteSeerX.psu:10.1.1.1032.2604","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1032.2604","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://uwspace.uwaterloo.ca/bitstream/handle/10012/8577/Rosmanis_Ansis.pdf%3Bjsessionid%3D222DE58A761498A2929E0736C48E858D?sequence%3D1","raw_type":"text"},{"id":"mag:1843656387","doi":null,"is_oa":false,"landing_page_url":"https://uwspace.uwaterloo.ca/bitstream/10012/8577/1/Rosmanis_Ansis.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/8577","doi":null,"is_oa":true,"landing_page_url":"http://hdl.handle.net/10012/8577","pdf_url":"http://hdl.handle.net/10012/8577","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/W1843656387.pdf","grobid_xml":"https://content.openalex.org/works/W1843656387.grobid-xml"},"referenced_works_count":58,"referenced_works":["https://openalex.org/W103828875","https://openalex.org/W572922989","https://openalex.org/W998887031","https://openalex.org/W1503154552","https://openalex.org/W1541824250","https://openalex.org/W1564709644","https://openalex.org/W1596185498","https://openalex.org/W1631356911","https://openalex.org/W1763960172","https://openalex.org/W1800146307","https://openalex.org/W1854955606","https://openalex.org/W1890830092","https://openalex.org/W1892798954","https://openalex.org/W1902551940","https://openalex.org/W1964032471","https://openalex.org/W1965820166","https://openalex.org/W1971200845","https://openalex.org/W1993000433","https://openalex.org/W2001383654","https://openalex.org/W2007224204","https://openalex.org/W2023316152","https://openalex.org/W2029495732","https://openalex.org/W2034038586","https://openalex.org/W2040958198","https://openalex.org/W2044747430","https://openalex.org/W2051307215","https://openalex.org/W2052900991","https://openalex.org/W2058286540","https://openalex.org/W2068911609","https://openalex.org/W2084652510","https://openalex.org/W2086590681","https://openalex.org/W2102687371","https://openalex.org/W2104549991","https://openalex.org/W2112553910","https://openalex.org/W2113364475","https://openalex.org/W2117584890","https://openalex.org/W2122271558","https://openalex.org/W2122780600","https://openalex.org/W2126323053","https://openalex.org/W2135046907","https://openalex.org/W2144385516","https://openalex.org/W2149215674","https://openalex.org/W2158503306","https://openalex.org/W2162225525","https://openalex.org/W2246801328","https://openalex.org/W2248297545","https://openalex.org/W2762094014","https://openalex.org/W2887468738","https://openalex.org/W2912300924","https://openalex.org/W2945338313","https://openalex.org/W2952003592","https://openalex.org/W2953375833","https://openalex.org/W2964030075","https://openalex.org/W3023478445","https://openalex.org/W3041308142","https://openalex.org/W3103161513","https://openalex.org/W3106123690","https://openalex.org/W3151594935"],"related_works":["https://openalex.org/W2950315256","https://openalex.org/W2162225525","https://openalex.org/W2964030075","https://openalex.org/W3104804890","https://openalex.org/W7098768457","https://openalex.org/W2009155360","https://openalex.org/W3121290864","https://openalex.org/W7096073408","https://openalex.org/W1541629428","https://openalex.org/W7042865814"],"abstract_inverted_index":{"I":[0,4,30],"hereby":[1],"declare":[2],"that":[3,32],"am":[5],"the":[6,18,41,49,58,143,148],"sole":[7],"author":[8],"of":[9,17,51,93,112,147],"this":[10,45],"thesis.":[11],"This":[12],"is":[13],"a":[14],"true":[15],"copy":[16],"thesis,":[19],"including":[20],"any":[21],"required":[22],"final":[23],"revisions,":[24],"as":[25,118],"accepted":[26],"by":[27],"my":[28,33],"examiners.":[29],"understand":[31],"thesis":[34,46],"may":[35],"be":[36],"made":[37],"electronically":[38],"available":[39],"to":[40,134],"public.":[42],"ii":[43],"In":[44],"we":[47,81,130,152],"study":[48,82],"power":[50],"quantum":[52,64],"query":[53,65],"algorithms":[54,66],"and":[55,107,122],"learning":[56,86,94,101,109],"graphs;":[57],"latter":[59],"essentially":[60],"being":[61],"very":[62],"specialized":[63],"themselves.":[67],"We":[68,89,103],"almost":[69,155],"exclusively":[70],"focus":[71],"on":[72,85,142],"proving":[73],"lower":[74,83,140],"bounds":[75,84,141],"for":[76],"these":[77,135],"computational":[78],"models.":[79],"First,":[80],"graph":[87,110,145],"complexity.":[88],"consider":[90],"two":[91],"types":[92],"graphs:":[95],"adaptive":[96,106],"and,":[97],"more":[98],"restricted,":[99],"non-adaptive":[100,108],"graphs.":[102],"express":[104],"both":[105],"complexities":[111],"Boolean-valued":[113],"functions":[114],"(i.e.,":[115],"decision":[116],"problems)":[117],"semidefinite":[119],"minimization":[120],"problems,":[121,137],"derive":[123],"their":[124],"dual":[125,136],"problems.":[126],"For":[127],"various":[128],"functions,":[129],"construct":[131],"feasible":[132],"solutions":[133],"thereby":[138],"obtaining":[139],"learn-ing":[144],"complexity":[146],"functions.":[149],"Most":[150],"notably,":[151],"prove":[153],"an":[154],"optimal":[156],"\u2126(n9/7/":[157],"log":[158],"n)":[159]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-10-16T09:59:22.235173","created_date":"2016-06-24T00:00:00"}