{"id":"https://openalex.org/W2953285152","doi":"https://doi.org/10.1137/1.9781611973082.43","title":"Faster quantum algorithm for evaluating game trees","display_name":"Faster quantum algorithm for evaluating game trees","alternate_titles":[],"publication_year":2011,"publication_date":"2011-01-23","ids":{"openalex":"https://openalex.org/W2953285152","doi":"https://doi.org/10.1137/1.9781611973082.43","mag":"2953285152"},"language":"en","primary_location":{"id":"doi:10.1137/1.9781611973082.43","doi":"https://doi.org/10.1137/1.9781611973082.43","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9781611973082.43","pdf_url":null,"source":{"id":"https://openalex.org/S4363608728","display_name":"ACM-SIAM Symposium on Discrete Algorithms (SODA)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms","raw_type":"proceedings-article"},"parent_works":[{"id":"https://openalex.org/W100324934","display_name":"Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms","relationship":"volume","link_type":"volume"}],"lineage":["https://openalex.org/W2953285152","https://openalex.org/W100324934"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"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/A5065994445","display_name":"Ben W. Reichardt","orcid":"https://orcid.org/0000-0002-4934-8732","observed_orcids":["https://orcid.org/0000-0002-4934-8732"]},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]},{"id":"https://openalex.org/I4405289715","display_name":"Institute for Quantum Computing","ror":"https://ror.org/022rxbq09","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483","https://openalex.org/I4405289715"]}],"countries":["CA"],"is_corresponding":true,"contributor_roles":[],"raw_author_name":"Ben W. Reichardt","raw_affiliation_strings":["School of Computer Science and Institute for Quantum Computing, University of Waterloo"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science and Institute for Quantum Computing, University of Waterloo","institution_ids":["https://openalex.org/I151746483","https://openalex.org/I4405289715"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5065994445"],"corresponding_institution_ids":["https://openalex.org/I151746483","https://openalex.org/I4405289715"],"apc_list":null,"apc_paid":null,"fwci":1.8519,"has_fulltext":false,"cited_by_count":22,"reviewed_by_count":0,"citation_normalized_percentile":{"value":0.85326307,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":86,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"546","last_page":"559"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9980000257492065,"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.9980000257492065,"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.0010000000474974513,"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/quantum-algorithms","display_name":"quantum algorithms","score":0.8690000176429749},{"id":"https://openalex.org/keywords/quantum-walks","display_name":"quantum walks","score":0.7300000190734863},{"id":"https://openalex.org/keywords/span-programs","display_name":"span programs","score":0.8050000071525574},{"id":"https://openalex.org/keywords/query-complexity","display_name":"query complexity","score":0.7319999933242798}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.680631160736084},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47261929512023926},{"id":"https://openalex.org/C58053490","wikidata":"https://www.wikidata.org/wiki/Q176555","display_name":"Quantum computer","level":3,"score":0.44794607162475586},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.4263404905796051},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3743489980697632},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.11170214414596558},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.06747043132781982}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/1.9781611973082.43","doi":"https://doi.org/10.1137/1.9781611973082.43","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9781611973082.43","pdf_url":null,"source":{"id":"https://openalex.org/S4363608728","display_name":"ACM-SIAM Symposium on Discrete Algorithms (SODA)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1485192821","https://openalex.org/W1561344775","https://openalex.org/W1589314219","https://openalex.org/W1618756527","https://openalex.org/W1631356911","https://openalex.org/W1917967022","https://openalex.org/W2006290558","https://openalex.org/W2070053775","https://openalex.org/W2084652510","https://openalex.org/W2086290259","https://openalex.org/W2090704101","https://openalex.org/W2102687371","https://openalex.org/W2120551550","https://openalex.org/W2123056342","https://openalex.org/W2123540893","https://openalex.org/W2134298805","https://openalex.org/W2136299681","https://openalex.org/W2158503306","https://openalex.org/W2593070235","https://openalex.org/W2949399092"],"related_works":["https://openalex.org/W2031374990","https://openalex.org/W2609340483","https://openalex.org/W7100714054","https://openalex.org/W1589314219","https://openalex.org/W1965858702","https://openalex.org/W7095760085","https://openalex.org/W2404437241","https://openalex.org/W2952311581","https://openalex.org/W3103735887"],"abstract_inverted_index":{"We":[0],"give":[1],"an":[2],"O(\u221an":[3],"log":[4],"n)-query":[5],"quantum":[6,31],"algorithm":[7,26,43],"for":[8],"evaluating":[9],"size-n":[10],"AND-OR":[11],"formulas.":[12],"Its":[13],"running":[14],"time":[15],"is":[16,27,37,44],"poly-logarithmically":[17],"greater":[18],"after":[19],"efficient":[20],"preprocessing.":[21],"Unlike":[22],"previous":[23],"approaches,":[24],"the":[25,42],"based":[28,45],"on":[29,33,46],"a":[30,34,39,47,59],"walk":[32],"graph":[35],"that":[36],"not":[38],"tree.":[40],"Instead,":[41],"hybrid":[48],"of":[49],"direct-sum":[50],"span":[51,62],"program":[52,63],"composition,":[53],"which":[54,66],"generates":[55,67],"tree-like":[56],"graphs,":[57],"and":[58],"novel":[60],"tensor-product":[61],"composition":[64],"method,":[65],"graphs":[68],"with":[69],"vertices":[70],"corresponding":[71],"to":[72],"minimal":[73],"zero-certificates.":[74]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2953285152","counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2026-11-22T12:46:00.618207","created_date":"2019-06-27T00:00:00"}
