{"id":"https://openalex.org/W7149873465","doi":"https://doi.org/10.4230/lipics.esa.2026.37","title":"Quantum Time-Space Tradeoffs for Exponential Dynamic Programming","display_name":"Quantum Time-Space Tradeoffs for Exponential Dynamic Programming","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7149873465","doi":"https://doi.org/10.4230/lipics.esa.2026.37"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2604.02233","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2604.02233","pdf_url":"https://arxiv.org/pdf/2604.02233","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"volume":null,"type":"preprint","indexed_in":["arxiv","datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2604.02233","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5092491256","display_name":"Susanna Caroppo","orcid":"https://orcid.org/0009-0001-4538-8198","observed_orcids":["https://orcid.org/0009-0001-4538-8198"]},"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, Department of Engineering, Rome, Italy"],"raw_orcid":"https://orcid.org/0009-0001-4538-8198","affiliations":[{"raw_affiliation_string":"Roma Tre University, Department of Engineering, Rome, Italy","institution_ids":["https://openalex.org/I119003972"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5083311648","display_name":"Jevg\u0113nijs Vihrovs","orcid":"https://orcid.org/0000-0002-3143-2610","observed_orcids":["https://orcid.org/0000-0002-3143-2610"]},"institutions":[{"id":"https://openalex.org/I91123046","display_name":"University of Latvia","ror":"https://ror.org/05g3mes96","country_code":"LV","type":"education","lineage":["https://openalex.org/I91123046"]}],"countries":["LV"],"is_corresponding":false,"raw_author_name":"Vihrovs, Jevg\u0113nijs","raw_affiliation_strings":["Faculty of Science and Technology, University of Latvia, Riga, Latvia"],"raw_orcid":"https://orcid.org/0000-0002-3143-2610","affiliations":[{"raw_affiliation_string":"Faculty of Science and Technology, University of Latvia, Riga, Latvia","institution_ids":["https://openalex.org/I91123046"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5009490243","display_name":"Darta Zajakina","orcid":"https://orcid.org/0000-0003-2638-6434","observed_orcids":["https://orcid.org/0000-0003-2638-6434"]},"institutions":[{"id":"https://openalex.org/I91123046","display_name":"University of Latvia","ror":"https://ror.org/05g3mes96","country_code":"LV","type":"education","lineage":["https://openalex.org/I91123046"]}],"countries":["LV"],"is_corresponding":false,"raw_author_name":"Zajakina, D\u0101rta","raw_affiliation_strings":["Faculty of Science and Technology, University of Latvia, Riga, Latvia"],"raw_orcid":"https://orcid.org/0000-0003-2638-6434","affiliations":[{"raw_affiliation_string":"Faculty of Science and Technology, University of Latvia, Riga, Latvia","institution_ids":["https://openalex.org/I91123046"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5132868647","display_name":"Aleksejs Zajakins","orcid":"https://orcid.org/0009-0006-7218-4584","observed_orcids":["https://orcid.org/0009-0006-7218-4584"]},"institutions":[{"id":"https://openalex.org/I91123046","display_name":"University of Latvia","ror":"https://ror.org/05g3mes96","country_code":"LV","type":"education","lineage":["https://openalex.org/I91123046"]}],"countries":["LV"],"is_corresponding":false,"raw_author_name":"Zajakins, Aleksejs","raw_affiliation_strings":["Faculty of Science and Technology, University of Latvia, Riga, Latvia"],"raw_orcid":"https://orcid.org/0009-0006-7218-4584","affiliations":[{"raw_affiliation_string":"Faculty of Science and Technology, University of Latvia, Riga, Latvia","institution_ids":["https://openalex.org/I91123046"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":0,"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.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.0013000000035390258,"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":9.999999747378752e-05,"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.7519999742507935},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"dynamic programming","score":0.9190000295639038},{"id":"https://openalex.org/keywords/space-time-tradeoff","display_name":"space-time tradeoff","score":0.8230000138282776},{"id":"https://openalex.org/keywords/quantum-random-access-memory","display_name":"quantum random access memory","score":0.9229999780654907},{"id":"https://openalex.org/keywords/exponential-time-algorithms","display_name":"exponential-time algorithms","score":0.5690000057220459},{"id":"https://openalex.org/keywords/np-hard-problems","display_name":"NP-hard problems","score":0.746999979019165},{"id":"https://openalex.org/keywords/traveling-salesman-problem","display_name":"traveling salesman problem","score":0.8489999771118164},{"id":"https://openalex.org/keywords/space-complexity","display_name":"space complexity","score":0.6669999957084656}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6255999803543091},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.6079999804496765},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.5723000168800354},{"id":"https://openalex.org/C137019171","wikidata":"https://www.wikidata.org/wiki/Q2623817","display_name":"Quantum algorithm","level":3,"score":0.5493999719619751},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.5450999736785889},{"id":"https://openalex.org/C136197465","wikidata":"https://www.wikidata.org/wiki/Q1729295","display_name":"Variety (cybernetics)","level":2,"score":0.4927999973297119},{"id":"https://openalex.org/C58053490","wikidata":"https://www.wikidata.org/wiki/Q176555","display_name":"Quantum computer","level":3,"score":0.47540000081062317},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4348999857902527},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.414900004863739},{"id":"https://openalex.org/C62641251","wikidata":"https://www.wikidata.org/wiki/Q7269097","display_name":"Quantum sort","level":5,"score":0.40540000796318054},{"id":"https://openalex.org/C92043244","wikidata":"https://www.wikidata.org/wiki/Q7269023","display_name":"Quantum complexity theory","level":4,"score":0.39160001277923584},{"id":"https://openalex.org/C192122513","wikidata":"https://www.wikidata.org/wiki/Q2835770","display_name":"Quantum phase estimation algorithm","level":5,"score":0.3817000091075897},{"id":"https://openalex.org/C101471828","wikidata":"https://www.wikidata.org/wiki/Q17083575","display_name":"Quantum algorithm for linear systems of equations","level":5,"score":0.365200012922287},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.35499998927116394},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33500000834465027},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3165999948978424},{"id":"https://openalex.org/C59500034","wikidata":"https://www.wikidata.org/wiki/Q1464944","display_name":"Quantum Fourier transform","level":5,"score":0.30300000309944153},{"id":"https://openalex.org/C15706264","wikidata":"https://www.wikidata.org/wiki/Q230883","display_name":"Quantum state","level":3,"score":0.2865999937057495},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.28439998626708984},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.2687999904155731},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.26759999990463257},{"id":"https://openalex.org/C58849907","wikidata":"https://www.wikidata.org/wiki/Q2118982","display_name":"Quantum gate","level":4,"score":0.2628999948501587},{"id":"https://openalex.org/C11255438","wikidata":"https://www.wikidata.org/wiki/Q7269085","display_name":"Quantum process","level":4,"score":0.25699999928474426}],"mesh":[],"locations_count":5,"locations":[{"id":"pmh:oai:arXiv.org:2604.02233","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2604.02233","pdf_url":"https://arxiv.org/pdf/2604.02233","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:drops-oai.dagstuhl.de:27173","doi":null,"is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2026.37","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol388-esa2026/LIPIcs.ESA.2026.37/LIPIcs.ESA.2026.37.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,"listed_in":[],"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/559478","doi":null,"is_oa":false,"landing_page_url":"https://hdl.handle.net/11590/559478","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,"listed_in":[],"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"},{"id":"doi:10.48550/arxiv.2604.02233","doi":"https://doi.org/10.48550/arxiv.2604.02233","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.02233","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},{"id":"doi:10.4230/lipics.esa.2026.37","doi":"https://doi.org/10.4230/lipics.esa.2026.37","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.esa.2026.37","pdf_url":null,"source":{"id":"https://openalex.org/S4393917817","display_name":"Leibniz international proceedings in informatics","issn_l":"1868-8969","issn":["1868-8969"],"is_oa":true,"is_in_doaj":true,"is_core":false,"listed_in":["doaj","jufo-1","norway-1"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2604.02233","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2604.02233","pdf_url":"https://arxiv.org/pdf/2604.02233","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7149873465.pdf","grobid_xml":"https://content.openalex.org/works/W7149873465.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4416888656","https://openalex.org/W4289753953","https://openalex.org/W2948580656","https://openalex.org/W3183339197","https://openalex.org/W4403443674","https://openalex.org/W3128201895","https://openalex.org/W4226499716","https://openalex.org/W3108011577","https://openalex.org/W7163895615","https://openalex.org/W7204630013"],"abstract_inverted_index":{"We":[0,82],"investigate":[1],"the":[2,62,79,101],"quantum":[3,54,85,94],"algorithms":[4,27],"for":[5,71],"dynamic":[6],"programming":[7],"by":[8,68,88],"Ambainis":[9],"et":[10],"al.":[11],"(SODA'19).":[12],"While":[13],"giving":[14],"provable":[15],"complexity":[16,64],"speedups":[17],"and":[18,112],"applicable":[19],"to":[20,49],"a":[21,29,34,52,76],"variety":[22],"of":[23,37],"NP-hard":[24],"problems,":[25],"these":[26],"have":[28],"notable":[30],"drawback:":[31],"they":[32],"require":[33],"large":[35],"amount":[36],"Quantum":[38],"Random":[39],"Access":[40],"Memory":[41],"(QRAM),":[42],"which":[43],"potentially":[44],"could":[45],"be":[46,66,106],"very":[47],"challenging":[48],"implement":[50],"in":[51,109],"physical":[53],"computer.":[55],"In":[56],"this":[57],"work,":[58],"we":[59,98],"study":[60],"how":[61],"space":[63],"can":[65,105],"improved":[67],"trading":[69],"it":[70],"time,":[72],"while":[73],"still":[74],"retaining":[75],"speedup":[77],"over":[78],"classical":[80,91],"algorithms.":[81],"show":[83,99],"novel":[84],"time-space":[86],"tradeoffs":[87],"combining":[89],"different":[90],"approaches":[92],"with":[93],"techniques.":[95],"For":[96],"instance,":[97],"that":[100],"Travelling":[102],"Salesman":[103],"Problem":[104],"solved":[107],"quantumly":[108],"\u00d5(1.859\u207f)":[110],"time":[111],"\u00d5(1.315\u207f)":[113],"QRAM":[114],"space.":[115]},"counts_by_year":[],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2026-04-05T00:00:00"}