{"id":"https://openalex.org/W7109993164","doi":"https://doi.org/10.4230/lipics.wads.2025.14","title":"Quantum Speedups for Polynomial-Time Dynamic Programming Algorithms","display_name":"Quantum Speedups for Polynomial-Time Dynamic Programming Algorithms","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W7109993164","doi":"https://doi.org/10.4230/lipics.wads.2025.14"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:24245","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.WADS.2025.14","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol349-wads2025/LIPIcs.WADS.2025.14/LIPIcs.WADS.2025.14.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"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":null,"raw_type":"InProceedings"},"type":"article","indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol349-wads2025/LIPIcs.WADS.2025.14/LIPIcs.WADS.2025.14.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Caroppo, Susanna","orcid":null},"institutions":[{"id":"https://openalex.org/I119003972","display_name":"Roma Tre University","ror":"https://ror.org/05vf0dg29","country_code":"IT","type":"education","lineage":["https://openalex.org/I119003972"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Caroppo, Susanna","raw_affiliation_strings":["Roma Tre University, Rome, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Roma Tre University, Rome, Italy","institution_ids":["https://openalex.org/I119003972"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Da Lozzo, Giordano","orcid":null},"institutions":[{"id":"https://openalex.org/I119003972","display_name":"Roma Tre University","ror":"https://ror.org/05vf0dg29","country_code":"IT","type":"education","lineage":["https://openalex.org/I119003972"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Da Lozzo, Giordano","raw_affiliation_strings":["Roma Tre University, Rome, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Roma Tre University, Rome, Italy","institution_ids":["https://openalex.org/I119003972"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Di Battista, Giuseppe","orcid":null},"institutions":[{"id":"https://openalex.org/I119003972","display_name":"Roma Tre University","ror":"https://ror.org/05vf0dg29","country_code":"IT","type":"education","lineage":["https://openalex.org/I119003972"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Di Battista, Giuseppe","raw_affiliation_strings":["Roma Tre University, Rome, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Roma Tre University, Rome, Italy","institution_ids":["https://openalex.org/I119003972"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Goodrich, Michael T.","orcid":null},"institutions":[{"id":"https://openalex.org/I204250578","display_name":"University of California, Irvine","ror":"https://ror.org/04gyf1771","country_code":"US","type":"education","lineage":["https://openalex.org/I204250578"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Goodrich, Michael T.","raw_affiliation_strings":["University of California, Irvine, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California, Irvine, CA, USA","institution_ids":["https://openalex.org/I204250578"]}]},{"author_position":"last","author":{"id":null,"display_name":"N\u00f6llenburg, Martin","orcid":null},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"N\u00f6llenburg, Martin","raw_affiliation_strings":["TU Wien, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"TU Wien, Austria","institution_ids":["https://openalex.org/I145847075"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.76076107,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"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.9334999918937683,"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.9334999918937683,"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.03480000048875809,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.0035000001080334187,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/digraph","display_name":"Digraph","score":0.6552000045776367},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.645799994468689},{"id":"https://openalex.org/keywords/quantum-algorithm","display_name":"Quantum algorithm","score":0.5644999742507935},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.4887999892234802},{"id":"https://openalex.org/keywords/quantum","display_name":"Quantum","score":0.46219998598098755},{"id":"https://openalex.org/keywords/dependency-graph","display_name":"Dependency graph","score":0.4544999897480011},{"id":"https://openalex.org/keywords/quantum-computer","display_name":"Quantum computer","score":0.4478999972343445},{"id":"https://openalex.org/keywords/dependency","display_name":"Dependency (UML)","score":0.39430001378059387},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.3901999890804291}],"concepts":[{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.6552000045776367},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.645799994468689},{"id":"https://openalex.org/C137019171","wikidata":"https://www.wikidata.org/wiki/Q2623817","display_name":"Quantum algorithm","level":3,"score":0.5644999742507935},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5022000074386597},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.4887999892234802},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.46219998598098755},{"id":"https://openalex.org/C16311509","wikidata":"https://www.wikidata.org/wiki/Q4148050","display_name":"Dependency graph","level":3,"score":0.4544999897480011},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4537999927997589},{"id":"https://openalex.org/C58053490","wikidata":"https://www.wikidata.org/wiki/Q176555","display_name":"Quantum computer","level":3,"score":0.4478999972343445},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3953999876976013},{"id":"https://openalex.org/C19768560","wikidata":"https://www.wikidata.org/wiki/Q320727","display_name":"Dependency (UML)","level":2,"score":0.39430001378059387},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.3901999890804291},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.37380000948905945},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.3370000123977661},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.33250001072883606},{"id":"https://openalex.org/C62641251","wikidata":"https://www.wikidata.org/wiki/Q7269097","display_name":"Quantum sort","level":5,"score":0.31769999861717224},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.30219998955726624},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.30079999566078186},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2978000044822693},{"id":"https://openalex.org/C38754835","wikidata":"https://www.wikidata.org/wiki/Q2003238","display_name":"Strongly connected component","level":2,"score":0.288100004196167},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2849000096321106},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.2827000021934509},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.27149999141693115},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.2678999900817871},{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.260699987411499},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.2596000134944916},{"id":"https://openalex.org/C73301696","wikidata":"https://www.wikidata.org/wiki/Q5469984","display_name":"Formalism (music)","level":3,"score":0.25679999589920044}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:24245","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.WADS.2025.14","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol349-wads2025/LIPIcs.WADS.2025.14/LIPIcs.WADS.2025.14.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"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":null,"raw_type":"InProceedings"},{"id":"pmh:oai:iris.uniroma3.it:11590/526738","is_oa":false,"landing_page_url":"https://hdl.handle.net/11590/526738","pdf_url":null,"source":{"id":"https://openalex.org/S4377196120","display_name":"Iris (Roma Tre University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I119003972","host_organization_name":"Roma Tre University","host_organization_lineage":["https://openalex.org/I119003972"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:24245","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.WADS.2025.14","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol349-wads2025/LIPIcs.WADS.2025.14/LIPIcs.WADS.2025.14.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"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":null,"raw_type":"InProceedings"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7210885136","display_name":"Collaborative Research: AF: Medium: Algorithms for Geometric Graphs","funder_award_id":"2212129","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7109993164.pdf"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0],"introduce":[1],"a":[2,17,42,46,60,81,134,146,156],"quantum":[3,15,27,135],"dynamic":[4,22,28],"programming":[5,23,29],"framework":[6,117],"that":[7,163],"allows":[8,118],"us":[9,119],"to":[10,13,107,120,150],"directly":[11],"extend":[12],"the":[14,32,68,73,92,122,138,152,170],"realm":[16],"large":[18],"body":[19],"of":[20,57,67,72,77,84,88,94,137],"classical":[21,38,173],"algorithms.":[24],"The":[25,86],"corresponding":[26],"algorithms":[30],"retain":[31],"same":[33],"space":[34],"complexity":[35],"as":[36],"their":[37],"counterpart,":[39],"while":[40],"achieving":[41],"computational":[43],"speedup.":[44],"For":[45],"combinatorial":[47],"(search":[48],"or":[49],"optimization)":[50],"problem":[51],"P":[52,95],"and":[53,99],"an":[54,130],"instance":[55],"I":[56,98],"P,":[58],"such":[59],"speedup":[61],"can":[62],"be":[63],"expressed":[64],"in":[65,125,155,165],"terms":[66],"average":[69],"degree":[70],"\u03b4":[71],"dependency":[74],"digraph":[75,159],"GP(I)":[76],"I,":[78],"determined":[79],"by":[80,97],"recursive":[82],"formulation":[83],"P.":[85],"nodes":[87],"this":[89],"graph":[90],"are":[91,102],"subproblems":[93],"induced":[96],"its":[100],"arcs":[101],"directed":[103],"from":[104,145],"each":[105],"subproblem":[106],"those":[108],"on":[109],"whose":[110],"solution":[111],"it":[112],"relies.":[113],"In":[114],"particular,":[115],"our":[116],"solve":[121],"considered":[123],"problems":[124],"O\u0303(|V":[126],"(GP(I))|\u221a\u03b4)":[127],"time.":[128],"As":[129],"example,":[131],"we":[132],"obtain":[133],"version":[136],"Bellman-Ford":[139],"algorithm":[140],"for":[141],"computing":[142],"shortest":[143],"paths":[144],"single":[147],"source":[148],"vertex":[149],"all":[151],"other":[153],"vertices":[154],"weighted":[157],"n-vertex":[158],"with":[160],"m":[161,177],"edges":[162],"runs":[164],"O\u0303(n\u221anm)":[166],"time,":[167],"which":[168],"improves":[169],"best":[171],"known":[172],"upper":[174],"bound":[175],"when":[176],"\u2208":[178],"\u03a9(n1.4).":[179]},"counts_by_year":[],"updated_date":"2026-07-16T13:24:37.021932","created_date":"2025-12-08T00:00:00"}