{"id":"https://openalex.org/W2990019366","doi":null,"title":"Span programs and quantum query algorithms.","display_name":"Span programs and quantum query algorithms.","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W2990019366","mag":"2990019366"},"language":"en","primary_location":{"id":"mag:2990019366","doi":null,"is_oa":false,"landing_page_url":"http://dblp.uni-trier.de/db/journals/eccc/eccc17.html#Reichardt10a","pdf_url":null,"source":{"id":"https://openalex.org/S11189987","display_name":"Electronic colloquium on computational complexity","issn_l":"1433-8092","issn":["1433-8092"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"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":null,"is_accepted":false,"is_published":false,"raw_source_name":"Electronic colloquium on computational complexity","raw_type":null},"volume":null,"type":"preprint","is_traditional":true,"indexed_in":[],"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/A5065994445","display_name":"Ben W. Reichardt","orcid":"https://orcid.org/0000-0002-4934-8732","observed_orcids":["https://orcid.org/0000-0002-4934-8732"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Ben W. Reichardt","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-4934-8732","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5065994445"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"17","issue":null,"first_page":"110","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.9990000128746033,"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.9990000128746033,"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.0003000000142492354,"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.0003000000142492354,"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/span-programs","display_name":"span programs","score":0.9169999957084656},{"id":"https://openalex.org/keywords/quantum-query-complexity","display_name":"quantum query complexity","score":0.9890000224113464},{"id":"https://openalex.org/keywords/quantum-query-algorithms","display_name":"quantum query algorithms","score":0.6579999923706055},{"id":"https://openalex.org/keywords/read-once-formulas","display_name":"read-once formulas","score":0.8230000138282776},{"id":"https://openalex.org/keywords/function-composition","display_name":"function composition","score":0.7250000238418579},{"id":"https://openalex.org/keywords/spectral-gap","display_name":"spectral gap","score":0.7860000133514404},{"id":"https://openalex.org/keywords/unstructured-search","display_name":"unstructured search","score":0.609000027179718},{"id":"https://openalex.org/keywords/semidefinite-programming","display_name":"semidefinite programming","score":0.5770000219345093}],"concepts":[{"id":"https://openalex.org/C137019171","wikidata":"https://www.wikidata.org/wiki/Q2623817","display_name":"Quantum algorithm","level":3,"score":0.6971908807754517},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5595368146896362},{"id":"https://openalex.org/C92043244","wikidata":"https://www.wikidata.org/wiki/Q7269023","display_name":"Quantum complexity theory","level":4,"score":0.5593433976173401},{"id":"https://openalex.org/C192122513","wikidata":"https://www.wikidata.org/wiki/Q2835770","display_name":"Quantum phase estimation algorithm","level":5,"score":0.49741771817207336},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.45207902789115906},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.41950860619544983},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35425829887390137},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3216622471809387},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.29370349645614624},{"id":"https://openalex.org/C51003876","wikidata":"https://www.wikidata.org/wiki/Q1536431","display_name":"Quantum error correction","level":4,"score":0.22184616327285767},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0971284806728363},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2990019366","doi":null,"is_oa":false,"landing_page_url":"http://dblp.uni-trier.de/db/journals/eccc/eccc17.html#Reichardt10a","pdf_url":null,"source":{"id":"https://openalex.org/S11189987","display_name":"Electronic colloquium on computational complexity","issn_l":"1433-8092","issn":["1433-8092"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"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":null,"is_accepted":false,"is_published":false,"raw_source_name":"Electronic colloquium on computational complexity","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":50,"referenced_works":["https://openalex.org/W66339572","https://openalex.org/W103828875","https://openalex.org/W1485192821","https://openalex.org/W1550421702","https://openalex.org/W1561344775","https://openalex.org/W1589314219","https://openalex.org/W1597947384","https://openalex.org/W1601135701","https://openalex.org/W1624621931","https://openalex.org/W1900573637","https://openalex.org/W1917967022","https://openalex.org/W2000070319","https://openalex.org/W2001383654","https://openalex.org/W2009353303","https://openalex.org/W2012496360","https://openalex.org/W2020918964","https://openalex.org/W2026325622","https://openalex.org/W2033216491","https://openalex.org/W2034038586","https://openalex.org/W2038435918","https://openalex.org/W2065768518","https://openalex.org/W2070717444","https://openalex.org/W2084565809","https://openalex.org/W2084652510","https://openalex.org/W2100827027","https://openalex.org/W2102687371","https://openalex.org/W2109924867","https://openalex.org/W2112553910","https://openalex.org/W2117584890","https://openalex.org/W2120551550","https://openalex.org/W2120560473","https://openalex.org/W2122780600","https://openalex.org/W2123056342","https://openalex.org/W2123540893","https://openalex.org/W2126323053","https://openalex.org/W2134298805","https://openalex.org/W2136299681","https://openalex.org/W2137370200","https://openalex.org/W2150340379","https://openalex.org/W2156652176","https://openalex.org/W2158503306","https://openalex.org/W2570634700","https://openalex.org/W2593070235","https://openalex.org/W2887468738","https://openalex.org/W2945338313","https://openalex.org/W2950838192","https://openalex.org/W2952496423","https://openalex.org/W3023478445","https://openalex.org/W3041308142","https://openalex.org/W3124818529"],"related_works":["https://openalex.org/W2158503306","https://openalex.org/W1990066863","https://openalex.org/W66339572","https://openalex.org/W2952496423","https://openalex.org/W7100714054","https://openalex.org/W7220661753","https://openalex.org/W2404437241","https://openalex.org/W7100533407","https://openalex.org/W2135977679","https://openalex.org/W1880672992"],"abstract_inverted_index":{"Quantum":[0],"query":[1,36,130,147,164,186,225],"complexity":[2,148,165],"measures":[3],"the":[4,29,47,78,95,145,162,167,182,185,212,238],"number":[5],"of":[6,91,94,149,166,177,184,188,223],"input":[7,206],"bits":[8],"that":[9,33,46,89,118,161,236],"must":[10],"be":[11,242],"read":[12],"by":[13,122,129],"a":[14,21,40,65,109,138,150,193,202,220,229],"quantum":[15,35,42,110,126,146,163,224,250,265],"algorithm":[16,111,200,231],"in":[17,97],"order":[18],"to":[19,75,77,83,137,241],"evaluate":[20],"function.":[22,57],"Hoyer":[23],"et":[24],"al.":[25],"(2007)":[26],"have":[27,246,260],"generalized":[28],"adversary":[30,49],"semidefinite":[31],"program":[32],"lower-bounds":[34],"complexity.":[37],"By":[38],"giving":[39],"matching":[41],"algorithm,":[43],"we":[44],"show":[45],"general":[48],"lower":[50],"bound":[51],"is":[52,60,218],"tight":[53],"for":[54,112,196,210,232,252,262],"every":[55],"boolean":[56,179],"The":[58,86,141,199],"proof":[59],"based":[61],"on":[62],"span":[63,114,119,234],"programs,":[64,120],"linear-algebraic":[66],"computational":[67,134],"model":[68],"without":[69,192],"inherent":[70],"dynamics.":[71],"Span":[72,257],"programs":[73,235,258],"correspond":[74],"solutions":[76],"dual":[79],"semi-definite":[80],"program,":[81],"and":[82,125,190],"bipartite":[84],"graphs.":[85],"analysis":[87],"shows":[88],"properties":[90],"eigenvalue-zero":[92],"eigenvectors":[93],"graphs":[96],"fact":[98],"imply":[99],"an":[100],"\u201ceffective\u201d":[101],"spectral":[102],"gap":[103],"around":[104],"zero":[105],"We":[106,227],"thus":[107],"develop":[108],"evaluating":[113,233,253],"programs.":[115],"It":[116,158],"follows":[117],"measured":[121,128],"witness":[123],"size,":[124],"algorithms,":[127],"complexity,":[131],"are":[132],"equivalent":[133],"models,":[135],"up":[136],"constant":[139],"factor.":[140],"result":[142],"efficiently":[143],"characterizes":[144],"read-once":[151,255],"formula":[152],"over":[153],"any":[154],"finite":[155],"gate":[156],"set.":[157],"also":[159],"implies":[160],"composition":[168],"f":[169,189],"\u25e6":[170],"(g,":[171],".":[172,173,174],",":[175],"g)":[176],"two":[178],"functions":[180],"matches":[181],"product":[183],"complexities":[187],"g,":[191],"logarithmic":[194],"factor":[195],"error":[197],"reduction.":[198],"alternates":[201],"fixed":[203],"reflection":[204],"with":[205],"queries.":[207],"Originally":[208],"introduced":[209],"solving":[211],"unstructured":[213],"search":[214],"problem,":[215],"this":[216],"structure":[217],"therefore":[219],"universal":[221],"feature":[222],"algorithms.":[226,266],"give":[228],"second":[230],"has":[237],"further":[239],"potential":[240],"time-efficient.":[243],"Subsequent":[244],"applications":[245],"derived":[247],"nearly":[248],"time-optimal":[249],"algorithms":[251],"many":[254],"formulas.":[256],"may":[259],"promise":[261],"developing":[263],"more":[264]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2019-12-05T00:00:00"}