{"id":"https://openalex.org/W2963551170","doi":"https://doi.org/10.4086/toc.2018.v014a015","title":"","display_name":"","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2963551170","doi":"https://doi.org/10.4086/toc.2018.v014a015","mag":"2963551170"},"language":"en","primary_location":{"id":"doi:10.4086/toc.2018.v014a015","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2018.v014a015","pdf_url":"http://www.theoryofcomputing.org/articles/v014a015/v014a015.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"http://www.theoryofcomputing.org/articles/v014a015/v014a015.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5023685398","display_name":"Ashley Montanaro","orcid":"https://orcid.org/0000-0001-5640-0343"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Ashley Montanaro","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5023685398"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.5691,"has_fulltext":true,"cited_by_count":74,"citation_normalized_percentile":{"value":0.96714755,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"14","issue":"1","first_page":"1","last_page":"24"},"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.9878000020980835,"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.9878000020980835,"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/backtracking","display_name":"Backtracking","score":0.950386643409729},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5706348419189453},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5551964044570923},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.5465852618217468},{"id":"https://openalex.org/keywords/quantum-algorithm","display_name":"Quantum algorithm","score":0.5419569611549377},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4769774377346039},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4716966152191162},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.45546209812164307},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.45187634229660034},{"id":"https://openalex.org/keywords/dpll-algorithm","display_name":"DPLL algorithm","score":0.4354274272918701},{"id":"https://openalex.org/keywords/beam-stack-search","display_name":"Beam stack search","score":0.41063880920410156},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40208208560943604},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38058626651763916},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3572324216365814},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.3479721248149872},{"id":"https://openalex.org/keywords/quantum","display_name":"Quantum","score":0.31341421604156494},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.29851871728897095},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.1680874228477478},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.09718206524848938},{"id":"https://openalex.org/keywords/best-first-search","display_name":"Best-first search","score":0.09069395065307617}],"concepts":[{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.950386643409729},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5706348419189453},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5551964044570923},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.5465852618217468},{"id":"https://openalex.org/C137019171","wikidata":"https://www.wikidata.org/wiki/Q2623817","display_name":"Quantum algorithm","level":3,"score":0.5419569611549377},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4769774377346039},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4716966152191162},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.45546209812164307},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.45187634229660034},{"id":"https://openalex.org/C143936061","wikidata":"https://www.wikidata.org/wiki/Q2030088","display_name":"DPLL algorithm","level":4,"score":0.4354274272918701},{"id":"https://openalex.org/C194036150","wikidata":"https://www.wikidata.org/wiki/Q4876196","display_name":"Beam stack search","level":5,"score":0.41063880920410156},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40208208560943604},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38058626651763916},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3572324216365814},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.3479721248149872},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.31341421604156494},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.29851871728897095},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.1680874228477478},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.09718206524848938},{"id":"https://openalex.org/C46011968","wikidata":"https://www.wikidata.org/wiki/Q830527","display_name":"Best-first search","level":4,"score":0.09069395065307617},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C12707504","wikidata":"https://www.wikidata.org/wiki/Q52637","display_name":"Phase-locked loop","level":3,"score":0.0},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"id":"https://openalex.org/C134652429","wikidata":"https://www.wikidata.org/wiki/Q1052698","display_name":"Jitter","level":2,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.4086/toc.2018.v014a015","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2018.v014a015","pdf_url":"http://www.theoryofcomputing.org/articles/v014a015/v014a015.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"},{"id":"pmh:oai:research-information.bris.ac.uk:publications/d6797749-4bee-41a6-8499-33820bf4cf07","is_oa":true,"landing_page_url":"http://www.scopus.com/inward/record.url?scp=85062178758&partnerID=8YFLogxK","pdf_url":"https://research-information.bris.ac.uk/ws/files/202776270/Full_text_PDF_final_published_version_.pdf","source":{"id":"https://openalex.org/S4306400895","display_name":"Bristol Research (University of Bristol)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I36234482","host_organization_name":"University of Bristol","host_organization_lineage":["https://openalex.org/I36234482"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:oai:research-information.bris.ac.uk:publications/d6797749-4bee-41a6-8499-33820bf4cf07","is_oa":true,"landing_page_url":"https://research-information.bris.ac.uk/en/publications/d6797749-4bee-41a6-8499-33820bf4cf07","pdf_url":"https://research-information.bris.ac.uk/ws/files/202776270/Full_text_PDF_final_published_version_.pdf","source":{"id":"https://openalex.org/S4306400895","display_name":"Bristol Research (University of Bristol)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I36234482","host_organization_name":"University of Bristol","host_organization_lineage":["https://openalex.org/I36234482"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Montanaro, A 2018, 'Quantum-Walk Speedup of Backtracking Algorithms', Theory of Computing, vol. 14, 15. https://doi.org/10.4086/toc.2018.v014a015","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.4086/toc.2018.v014a015","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2018.v014a015","pdf_url":"http://www.theoryofcomputing.org/articles/v014a015/v014a015.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1065894962","display_name":"New insights in quantum algorithms and complexity","funder_award_id":"EP/L021005/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2963551170.pdf","grobid_xml":"https://content.openalex.org/works/W2963551170.grobid-xml"},"referenced_works_count":63,"referenced_works":["https://openalex.org/W80562455","https://openalex.org/W127744604","https://openalex.org/W247655530","https://openalex.org/W1496100162","https://openalex.org/W1499143214","https://openalex.org/W1508413598","https://openalex.org/W1518705996","https://openalex.org/W1537532043","https://openalex.org/W1544328127","https://openalex.org/W1549449731","https://openalex.org/W1561344775","https://openalex.org/W1589045411","https://openalex.org/W1593169756","https://openalex.org/W1727475799","https://openalex.org/W1845765495","https://openalex.org/W1964032471","https://openalex.org/W1975528636","https://openalex.org/W1980458533","https://openalex.org/W1993688167","https://openalex.org/W1993804709","https://openalex.org/W1998539366","https://openalex.org/W2002372750","https://openalex.org/W2005234139","https://openalex.org/W2006096862","https://openalex.org/W2006290558","https://openalex.org/W2009948449","https://openalex.org/W2014603110","https://openalex.org/W2025956887","https://openalex.org/W2031374990","https://openalex.org/W2033216491","https://openalex.org/W2048572907","https://openalex.org/W2057361103","https://openalex.org/W2058286540","https://openalex.org/W2062897452","https://openalex.org/W2096056318","https://openalex.org/W2098208160","https://openalex.org/W2105614108","https://openalex.org/W2108583516","https://openalex.org/W2109741106","https://openalex.org/W2121124751","https://openalex.org/W2121981260","https://openalex.org/W2124209567","https://openalex.org/W2126442135","https://openalex.org/W2126483728","https://openalex.org/W2127309711","https://openalex.org/W2143677375","https://openalex.org/W2171256340","https://openalex.org/W2237958821","https://openalex.org/W2494078997","https://openalex.org/W2508700012","https://openalex.org/W2564579510","https://openalex.org/W2566400626","https://openalex.org/W2609340483","https://openalex.org/W2764347725","https://openalex.org/W2963277272","https://openalex.org/W2963343262","https://openalex.org/W3004545975","https://openalex.org/W3099805706","https://openalex.org/W3100213179","https://openalex.org/W3101715799","https://openalex.org/W4226347946","https://openalex.org/W4381304672","https://openalex.org/W4391285994"],"related_works":["https://openalex.org/W181880326","https://openalex.org/W2282636749","https://openalex.org/W2913258176","https://openalex.org/W1598581090","https://openalex.org/W2394027715","https://openalex.org/W4253828685","https://openalex.org/W2000531666","https://openalex.org/W2004425492","https://openalex.org/W2021700650","https://openalex.org/W1538913535"],"abstract_inverted_index":{"We":[0],"describe":[1],"a":[2,20,32,40,47,53,59,62,83,86,95,150],"general":[3],"method":[4],"to":[5,39,45,61,82,120,156],"obtain":[6],"quantum":[7,97,115,142,151],"speedups":[8],"of":[9,18,85,130,132,149,154],"classical":[10,54],"algorithms":[11,30],"which":[12,57,99,126],"are":[13,36],"based":[14,145],"on":[15,64,146],"the":[16,101,123,128,133,147,159],"technique":[17],"backtracking,":[19],"standard":[21],"approach":[22],"for":[23],"solving":[24],"constraint":[25],"satisfaction":[26],"problems":[27],"(CSPs).":[28],"Backtracking":[29],"explore":[31],"tree":[33,75],"whose":[34,73],"vertices":[35],"partial":[37,87],"solutions":[38],"CSP":[41,63],"in":[42,139,158],"an":[43],"attempt":[44],"find":[46],"complete":[48],"solution.":[49,88],"Assume":[50],"there":[51,93],"is":[52,94,127,144],"backtracking":[55,160],"algorithm":[56,98,116,143,153],"finds":[58],"solution":[60],"n":[65,107],"variables,":[66],"or":[67],"outputs":[68],"that":[69,92],"none":[70],"exists,":[71],"and":[72],"corresponding":[74,81],"contains":[76],"T":[77,106],"vertices,":[78],"each":[79],"vertex":[80],"test":[84],"Then":[89],"we":[90],"show":[91],"bounded-error":[96],"completes":[100],"same":[102],"task":[103],"using":[104],"O(":[105],"3/2":[108],"log":[109],"n)":[110],"tests.":[111],"In":[112],"particular,":[113],"this":[114],"can":[117],"be":[118],"used":[119,138],"speed":[121],"up":[122],"DPLL":[124],"algorithm,":[125],"basis":[129],"many":[131],"most":[134],"efficient":[135],"SAT":[136],"solvers":[137],"practice.":[140],"The":[141],"use":[148],"walk":[152],"Belovs":[155],"search":[157],"tree.":[161]},"counts_by_year":[{"year":2026,"cited_by_count":4},{"year":2025,"cited_by_count":10},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":8},{"year":2022,"cited_by_count":8},{"year":2021,"cited_by_count":10},{"year":2020,"cited_by_count":15},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2025-12-17T22:08:43.090829","created_date":"2019-07-30T00:00:00"}