Document Open Access Logo

Quantum Speedups for Polynomial-Time Dynamic Programming Algorithms

Authors Susanna Caroppo , Giordano Da Lozzo , Giuseppe Di Battista , Michael T. Goodrich , Martin Nöllenburg

PDF

File

Thumbnail PDF
PDF
LIPIcs.WADS.2025.14.pdf
  • Filesize: 1.09 MB
  • 22 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Dynamic programming
  • Theory of computation → Quantum complexity theory
Keywords
  • Dynamic Programming
  • Quantum Algorithms
  • Quantum Random Access Memory

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

We introduce a quantum dynamic programming framework that allows us to directly extend to the quantum realm a large body of classical dynamic programming algorithms. The corresponding quantum dynamic programming algorithms retain the same space complexity as their classical counterpart, while achieving a computational speedup. For a combinatorial (search or optimization) problem P and an instance I of P, such a speedup can be expressed in terms of the average degree δ of the {dependency digraph} G_𝒫(I) of I, determined by a recursive formulation of P. The nodes of this graph are the subproblems of P induced by I and its arcs are directed from each subproblem to those on whose solution it relies. In particular, our framework allows us to solve the considered problems in Õ(|V(G_𝒫(I))| √δ) time. As an example, we obtain a quantum version of the Bellman-Ford algorithm for computing shortest paths from a single source vertex to all the other vertices in a weighted n-vertex digraph with m edges that runs in Õ(n√{nm}) time, which improves the best known classical upper bound when m ∈ Ω(n^{1.4}).

Cite As Get BibTex

Susanna Caroppo, Giordano Da Lozzo, Giuseppe Di Battista, Michael T. Goodrich, and Martin Nöllenburg. Quantum Speedups for Polynomial-Time Dynamic Programming Algorithms. In 19th International Symposium on Algorithms and Data Structures (WADS 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 349, pp. 14:1-14:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.WADS.2025.14

Author Details

Susanna Caroppo
  • Roma Tre University, Rome, Italy
Giordano Da Lozzo
  • Roma Tre University, Rome, Italy
Giuseppe Di Battista
  • Roma Tre University, Rome, Italy
Michael T. Goodrich
  • University of California, Irvine, CA, USA
Martin Nöllenburg
  • TU Wien, Austria

Funding

This research was supported, in part, by MUR of Italy (PRIN Project no. 2022ME9Z78 - NextGRAAL and PRIN Project no. 2022TS4Y3N - EXPAND), and the U.S. NSF under grant 2212129.

References

  1. Scott Aaronson. Introduction to quantum information science lecture notes, April 2019. URL: https://www.scottaaronson.com/qclec.pdf.
  2. Scott Aaronson, Nai-Hui Chia, Han-Hsuan Lin, Chunhao Wang, and Ruizhe Zhang. On the quantum complexity of closest pair and related problems. In Shubhangi Saraf, editor, 35th Computational Complexity Conference, CCC 2020, volume 169 of LIPIcs, pages 16:1-16:43. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. URL: https://doi.org/10.4230/LIPICS.CCC.2020.16.
  3. Andris Ambainis. Quantum search algorithms. SIGACT News, 35(2):22-35, June 2004. URL: https://doi.org/10.1145/992287.992296.
  4. Andris Ambainis, Kaspars Balodis, Janis Iraids, Martins Kokainis, Krisjanis Prusis, and Jevgenijs Vihrovs. Quantum speedups for exponential-time dynamic programming algorithms. In Timothy M. Chan, editor, SODA 2019, pages 1783-1793. SIAM, 2019. URL: https://doi.org/10.1137/1.9781611975482.107.
  5. Andris Ambainis and Nikita Larka. Quantum algorithms for computational geometry problems. In Steven T. Flammia, editor, 15th Conference on the Theory of Quantum Computation, Communication and Cryptography, TQC 2020, volume 158 of LIPIcs, pages 9:1-9:10. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. URL: https://doi.org/10.4230/LIPICS.TQC.2020.9.
  6. Andris Ambainis and Ilja Repko. Quantum algorithm for the domatic number problem. Balt. J. Mod. Comput., 12(3), 2024. URL: https://doi.org/10.22364/BJMC.2024.12.3.03.
  7. Vladimirs Andrejevs, Aleksandrs Belovs, and Jevgenijs Vihrovs. Quantum algorithms for hopcroft’s problem. In Rastislav Královic and Antonín Kucera, editors, 49th International Symposium on Mathematical Foundations of Computer Science, MFCS 2024, volume 306 of LIPIcs, pages 9:1-9:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. URL: https://doi.org/10.4230/LIPICS.MFCS.2024.9.
  8. Richard Bellman. On a routing problem. Quarterly of Applied Mathematics, 16(1):87-90, 1958. URL: http://www.jstor.org/stable/43634538.
  9. Richard Bellman. On the approximation of curves by line segments using dynamic programming. Commun. ACM, 4(6):284, 1961. URL: https://doi.org/10.1145/366573.366611.
  10. Marc Benkert, Herman J. Haverkort, Moritz Kroll, and Martin Nöllenburg. Algorithms for multi-criteria one-sided boundary labeling. In Seok-Hee Hong, Takao Nishizeki, and Wu Quan, editors, Graph Drawing, 15th International Symposium, GD 2007, volume 4875 of Lecture Notes in Computer Science, pages 243-254. Springer, 2007. URL: https://doi.org/10.1007/978-3-540-77537-9_25.
  11. Marc Benkert, Herman J. Haverkort, Moritz Kroll, and Martin Nöllenburg. Algorithms for multi-criteria boundary labeling. J. Graph Algorithms Appl., 13(3):289-317, 2009. URL: https://doi.org/10.7155/JGAA.00189.
  12. Gilles Brassard, Peter Høyer, and Alain Tapp. Quantum counting. In Kim Guldstrand Larsen, Sven Skyum, and Glynn Winskel, editors, ICALP'98, volume 1443 of LNCS, pages 820-831. Springer, 1998. URL: https://doi.org/10.1007/BFB0055105.
  13. Susanna Caroppo, Giordano Da Lozzo, and Giuseppe Di Battista. Quantum algorithms for one-sided crossing minimization. In Stefan Felsner and Karsten Klein, editors, 32nd International Symposium on Graph Drawing and Network Visualization, GD 2024, volume 320 of LIPIcs, pages 20:1-20:9. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. URL: https://doi.org/10.4230/LIPICS.GD.2024.20.
  14. Susanna Caroppo, Giordano Da Lozzo, and Giuseppe Di Battista. Quantum algorithms for one-sided crossing minimization. Theoretical Computer Science, 1052:115424, 2025. URL: https://doi.org/10.1016/j.tcs.2025.115424.
  15. Susanna Caroppo, Giordano Da Lozzo, and Giuseppe Di Battista. Quantum graph drawing. J. Graph Algorithms Appl., 29(2):3-47, 2025. URL: https://doi.org/10.7155/JGAA.V29I2.3039.
  16. Susanna Caroppo, Giordano Da Lozzo, Giuseppe Di Battista, Michael T. Goodrich, and Martin Nöllenburg. Quantum speedups for polynomial-time dynamic programming algorithms, 2025. URL: https://arxiv.org/abs/2507.00823.
  17. Susanna Caroppo, Giordano Da Lozzo, and Giuseppe Di Battista. Quantum graph drawing. In Ryuhei Uehara, Katsuhisa Yamanaka, and Hsu-Chun Yen, editors, Proc. 18th International Conference and Workshops on Algorithms and Computation, WALCOM 2024, volume 14549 of Lecture Notes in Computer Science, pages 32-46. Springer, 2024. URL: https://doi.org/10.1007/978-981-97-0566-5_4.
  18. John Cocke. Programming languages and their compilers: Preliminary notes. New York University, 1969. Google Scholar
  19. Don Coppersmith and Shmuel Winograd. Matrix multiplication via arithmetic progressions. J. Symb. Comput., 9(3):251-280, 1990. URL: https://doi.org/10.1016/S0747-7171(08)80013-2.
  20. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to Algorithms, 3rd Edition. MIT Press, 2009. URL: http://mitpress.mit.edu/books/introduction-algorithms.
  21. Sanjoy Dasgupta, Christos H. Papadimitriou, and Umesh V. Vazirani. Algorithms. McGraw-Hill, 2008. Google Scholar
  22. Christopher M. Dawson and Michael A. Nielsen. The solovay-kitaev algorithm. Quantum Inf. Comput., 6(1):81-95, 2006. URL: https://doi.org/10.26421/QIC6.1-6.
  23. Christoph Dürr and Peter Høyer. A quantum algorithm for finding the minimum. CoRR, quant-ph/9607014, 1996. URL: https://arxiv.org/abs/quant-ph/9607014.
  24. Jeff Erickson. Algorithms. Independently published, 2019. URL: http://jeffe.cs.illinois.edu/teaching/algorithms/.
  25. Geeks for Geeks. Largest divisible subset in array. https://www.geeksforgeeks.org/largest-divisible-subset-array/, 2024. Accessed: (21/02/2025).
  26. L. R. Ford. Network Flow Theory, pages 253-313. Springer New York, New York, NY, 1997. URL: https://doi.org/10.1007/0-387-22633-8_9.
  27. Shion Fukuzawa, Michael T. Goodrich, and Sandy Irani. Quantum Tutte embeddings. CoRR, abs/2307.08851, 2023. URL: https://doi.org/10.48550/arXiv.2307.08851.
  28. Shion Fukuzawa, Michael T. Goodrich, and Sandy Irani. Quantum Tutte embeddings. In Michael A. Bekos and Markus Chimani, editors, 31st International Symposium on Graph Drawing and Network Visualization, GD, volume 14466 of LNCS, pages 241-243. Springer, 2023. Google Scholar
  29. Shion Fukuzawa, Michael T. Goodrich, and Sandy Irani. Quantum combine and conquer and its applications to sublinear quantum convex hull and maxima set construction. In Oswin Aichholzer and Haitao Wang, editors, 41st International Symposium on Computational Geometry, SoCG 2025, volume 332 of LIPIcs, pages 51:1-51:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. URL: https://doi.org/10.4230/LIPICS.SOCG.2025.51.
  30. Bartholomew Furrow. A panoply of quantum algorithms. Quantum Inf. Comput., 8(8):834-859, 2008. URL: https://doi.org/10.26421/QIC8.8-9-11.
  31. Harold N. Gabow. Scaling algorithms for network problems. J. Comput. Syst. Sci., 31(2):148-168, 1985. URL: https://doi.org/10.1016/0022-0000(85)90039-X.
  32. Harold N. Gabow and Robert Endre Tarjan. Faster scaling algorithms for network problems. SIAM J. Comput., 18(5):1013-1036, 1989. URL: https://doi.org/10.1137/0218069.
  33. Andreas Gemsa, Benjamin Niedermann, and Martin Nöllenburg. Trajectory-based dynamic map labeling. In Leizhen Cai, Siu-Wing Cheng, and Tak Wah Lam, editors, ISAAC 2013, volume 8283 of LNCS, pages 413-423. Springer, 2013. URL: https://doi.org/10.1007/978-3-642-45030-3_39.
  34. I. M. Georgescu, S. Ashhab, and Franco Nori. Quantum simulation. Rev. Mod. Phys., 86:153-185, March 2014. URL: https://doi.org/10.1103/RevModPhys.86.153.
  35. Vittorio Giovannetti, Seth Lloyd, and Lorenzo Maccone. Quantum random access memory. Phys. Rev. Lett., 100:160501, April 2008. URL: https://doi.org/10.1103/PhysRevLett.100.160501.
  36. Adam Glos, Martins Kokainis, Ryuhei Mori, and Jevgenijs Vihrovs. Quantum speedups for dynamic programming on n-dimensional lattice graphs. In Filippo Bonchi and Simon J. Puglisi, editors, MFCS 2021, volume 202 of LIPIcs, pages 50:1-50:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. URL: https://doi.org/10.4230/LIPICS.MFCS.2021.50.
  37. Andrew V. Goldberg. Scaling algorithms for the shortest paths problem. SIAM J. Comput., 24(3):494-504, 1995. URL: https://doi.org/10.1137/S0097539792231179.
  38. Raymond Greenlaw and James H. Hoover. Fundamentals of the Theory of Computation: Principles and Practice. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 1998. Google Scholar
  39. Lov K. Grover. A fast quantum mechanical algorithm for database search. In Gary L. Miller, editor, STOC 1996, pages 212-219. ACM, 1996. URL: https://doi.org/10.1145/237814.237866.
  40. Yijie Han and Tadao Takaoka. An O(n³ log log n /log² n) time algorithm for all pairs shortest paths. J. Discrete Algorithms, 38-41:9-19, 2016. URL: https://doi.org/10.1016/J.JDA.2016.09.001.
  41. John E. Hopcroft, Rajeev Motwani, and Jeffrey D. Ullman. Introduction to automata theory, languages, and computation, 3rd Edition. Pearson international edition. Addison-Wesley, 2007. Google Scholar
  42. Yufan Huang, Peter Jin, and Kent Quanrud. Faster single-source shortest paths with negative real weights via proper hop distance. In Yossi Azar and Debmalya Panigrahi, editors, SODA 2025, pages 5239-5244. SIAM, 2025. URL: https://doi.org/10.1137/1.9781611978322.178.
  43. Daniel Jurafsky and James H. Martin. Speech and language processing - an introduction to natural language processing, computational linguistics, and speech recognition. Prentice Hall series in artificial intelligence. Prentice Hall, 2000. Google Scholar
  44. Tadao Kasami. An efficient recognition and syntax-analysis algorithm for context-free languages. Coordinated Science Laboratory Report no. R-257, 1966. Google Scholar
  45. Kamil Khadiev and Liliya Safina. Quantum algorithm for dynamic programming approach for dags. applications for zhegalkin polynomial evaluation and some problems on dags. In Ian McQuillan and Shinnosuke Seki, editors, UCNC 2019, volume 11493 of LNCS, pages 150-163. Springer, 2019. URL: https://doi.org/10.1007/978-3-030-19311-9_13.
  46. Alexei Y. Kitaev, A. H. Shen, and Mikhail N. Vyalyi. Classical and Quantum Computation, volume 47 of Graduate studies in mathematics. American Mathematical Society, 2002. URL: https://bookstore.ams.org/gsm-47/.
  47. Jon M. Kleinberg and Éva Tardos. Algorithm design. Addison-Wesley, 2006. Google Scholar
  48. Vladislavs Klevickis, Krisjanis Prusis, and Jevgenijs Vihrovs. Quantum speedups for treewidth. In François Le Gall and Tomoyuki Morimae, editors, TQC 2022, volume 232 of LIPIcs, pages 11:1-11:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. URL: https://doi.org/10.4230/LIPICS.TQC.2022.11.
  49. G.T. Klincsek. Minimal triangulations of polygonal domains. In Peter L. Hammer, editor, Combinatorics 79, volume 9 of Annals of Discrete Mathematics, pages 121-123. Elsevier, 1980. URL: https://doi.org/10.1016/S0167-5060(08)70044-X.
  50. Michael A. Nielsen and Isaac L. Chuang. Quantum Computation and Quantum Information (10th Anniversary edition). Cambridge University Press, 2016. URL: https://www.cambridge.org/de/academic/subjects/physics/quantum-physics-quantum-information-and-quantum-computation/quantum-computation-and-quantum-information-10th-anniversary-edition?format=HB.
  51. Koustubh Phalak, Avimita Chatterjee, and Swaroop Ghosh. Quantum random access memory for dummies. Sensors, 23(17):7462, 2023. URL: https://doi.org/10.3390/S23177462.
  52. Walter L. Ruzzo. On the complexity of general context-free language parsing and recognition (extended abstract). In Hermann A. Maurer, editor, Automata, Languages and Programming, 6th Colloquium, volume 71 of LNCS, pages 489-497. Springer, 1979. URL: https://doi.org/10.1007/3-540-09510-1_39.
  53. Kazuya Shimizu and Ryuhei Mori. Exponential-time quantum algorithms for graph coloring problems. Algorithmica, 84(12):3603-3621, 2022. URL: https://doi.org/10.1007/S00453-022-00976-2.
  54. Peter W. Shor. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Rev., 41(2):303-332, 1999. URL: https://doi.org/10.1137/S0036144598347011.
  55. Volker Strassen. Gaussian elimination is not optimal. Matematika, 14(3):127-128, 1970. Google Scholar
  56. Vincent T'kindt, Federico Della Croce, and Mathieu Liedloff. Moderate exponential-time algorithms for scheduling problems. Ann. Oper. Res., 343(2):753-783, 2024. URL: https://doi.org/10.1007/S10479-024-06289-7.
  57. Leslie G. Valiant. General context-free recognition in less than cubic time. J. Comput. Syst. Sci., 10(2):308-315, 1975. URL: https://doi.org/10.1016/S0022-0000(75)80046-8.
  58. Virginia Vassilevska Williams, Yinzhan Xu, Zixuan Xu, and Renfei Zhou. New bounds for matrix multiplication: from alpha to omega. In David P. Woodruff, editor, SODA 2024, pages 3792-3835. SIAM, 2024. URL: https://doi.org/10.1137/1.9781611977912.134.
  59. Gerhard J. Woeginger. Open problems around exact algorithms. Discret. Appl. Math., 156(3):397-405, 2008. URL: https://doi.org/10.1016/J.DAM.2007.03.023.
  60. Shifan Xu, Connor T. Hann, Ben Foxman, Steven M. Girvin, and Yongshan Ding. Systems architecture for quantum random access memory. In MICRO 2023, pages 526-538. ACM, 2023. URL: https://doi.org/10.1145/3613424.3614270.
  61. Daniel H. Younger. Recognition and parsing of context-free languages in time n^3. Inf. Control., 10(2):189-208, 1967. URL: https://doi.org/10.1016/S0019-9958(67)80007-X.
  62. Mohammed Zidan, Abdel-Haleem Abdel-Aty, Ashraf Khalil, Mahmoud A. Abdel-Aty, and Hichem Eleuch. A novel efficient quantum random access memory. IEEE Access, 9:151775-151780, 2021. URL: https://doi.org/10.1109/ACCESS.2021.3119588.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact