{"id":"https://openalex.org/W2948580656","doi":null,"title":"Quantum Algorithms for Solving Dynamic Programming Problems","display_name":"Quantum Algorithms for Solving Dynamic Programming Problems","publication_year":2019,"publication_date":"2019-06-05","ids":{"openalex":"https://openalex.org/W2948580656","mag":"2948580656"},"language":"en","primary_location":{"id":"mag:2948580656","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1906.02229.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},"volume":null,"type":"preprint","indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1906.02229.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5083977271","display_name":"Pooya Ronagh","orcid":"https://orcid.org/0000-0002-9591-9727","observed_orcids":["https://orcid.org/0000-0002-9591-9727"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Pooya Ronagh","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-9591-9727","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5083977271"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":15,"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.9994999766349792,"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.9994999766349792,"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.00019999999494757503,"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.0,"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-algorithms","display_name":"quantum algorithms","score":0.9629999995231628},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"dynamic programming","score":0.9629999995231628},{"id":"https://openalex.org/keywords/quantum-advantage","display_name":"quantum advantage","score":0.6359999775886536},{"id":"https://openalex.org/keywords/quadratic-speedup","display_name":"quadratic speedup","score":0.7940000295639038},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.8870000243186951},{"id":"https://openalex.org/keywords/traveling-salesman-problem","display_name":"traveling salesman problem","score":0.9290000200271606},{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"set covering problem","score":0.8489999771118164},{"id":"https://openalex.org/keywords/query-complexity-lower-bounds","display_name":"query complexity lower bounds","score":0.9399999976158142},{"id":"https://openalex.org/keywords/randomized-algorithms","display_name":"randomized algorithms","score":0.6299999952316284}],"concepts":[{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.7339715361595154},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.6473259329795837},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5414493083953857},{"id":"https://openalex.org/C137019171","wikidata":"https://www.wikidata.org/wiki/Q2623817","display_name":"Quantum algorithm","level":3,"score":0.5242072343826294},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.48798125982284546},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.46495378017425537},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4454016089439392},{"id":"https://openalex.org/C58053490","wikidata":"https://www.wikidata.org/wiki/Q176555","display_name":"Quantum computer","level":3,"score":0.4352720081806183},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.42617490887641907},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.42181670665740967},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.38529494404792786},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.33288219571113586},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.33215194940567017},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.32288867235183716},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.296611487865448},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.093730628490448},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","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},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2948580656","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1906.02229.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null}],"best_oa_location":{"id":"mag:2948580656","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1906.02229.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W3183339197","https://openalex.org/W7109993164","https://openalex.org/W4289753953","https://openalex.org/W3108011577","https://openalex.org/W4403443674","https://openalex.org/W2964920388","https://openalex.org/W7148859772","https://openalex.org/W3013898648","https://openalex.org/W7163895615","https://openalex.org/W4411540050"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2,19,31,108,157],"general":[3],"quantum":[4,21,109,172,208],"algorithm":[5,17,75],"for":[6,167,178,202],"solving":[7,179,203],"finite-horizon":[8],"dynamic":[9,33,57,86,180,204],"programming":[10,34,58,87,181,205],"problems.":[11],"Up":[12],"to":[13,79,155],"polylogarithmic":[14],"factors,":[15],"our":[16],"provides":[18],"quadratic":[20],"advantage":[22],"in":[23,102,143,189],"terms":[24],"of":[25,28,30,42,45,50,53,55,63,71,116,118,152,159,171,193,197],"the":[26,40,43,51,56,60,64,68,72,95,114,119,136,150,168,191],"number":[27,52,115,151,192,196],"states":[29,194],"given":[32],"problem.":[35,73],"This":[36],"speedup":[37,188],"comes":[38],"at":[39],"expense":[41],"appearance":[44],"other":[46],"polynomial":[47],"factors":[48],"representative":[49],"actions":[54,198],"problem,":[59],"maximum":[61,128],"value":[62],"instantaneous":[65],"reward,":[66],"and":[67,122,174,183],"time":[69],"horizon":[70],"Our":[74],"can":[76,99,140,199],"be":[77,100,141,200],"applied":[78],"combinatorial":[80],"optimization":[81],"problems":[82,206],"solved":[83,101,142],"classically":[84],"using":[85,207],"techniques.":[88],"As":[89,130],"one":[90],"application,":[91],"we":[92,133,163],"show":[93,134,184],"that":[94,135,185],"travelling":[96],"salesperson":[97],"problem":[98,139],"$O^*(\\lceil":[103],"c":[104,124],"\\rceil^4":[105],"\\sqrt{2^n})$":[106],"on":[107],"computer,":[110],"where":[111,147],"$n$":[112],"is":[113,126,149],"vertices":[117],"underlying":[120],"graph":[121],"$\\lceil":[123],"\\rceil$":[125],"its":[127],"edge-weight.":[129],"another":[131],"example,":[132],"minimum":[137],"set-cover":[138],"$O(\\sqrt{2^n}":[144],"\\operatorname{poly}(m,":[145],"n))$,":[146],"$m$":[148],"sets":[153],"used":[154],"cover":[156],"universe":[158],"size":[160],"$n$.":[161],"Finally,":[162],"prove":[164],"lower":[165],"bounds":[166],"query":[169],"complexity":[170],"algorithms":[173,177],"classical":[175],"randomized":[176],"problems,":[182],"no":[186],"greater-than-quadratic":[187],"either":[190],"or":[195],"achieved":[201],"algorithms.":[209]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2}],"updated_date":"2026-11-03T10:50:19.383937","created_date":"2019-06-14T00:00:00"}