Papers
Topics
Authors
Recent
AI Research Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 77 tok/s
Gemini 2.5 Pro 52 tok/s Pro
GPT-5 Medium 30 tok/s Pro
GPT-5 High 31 tok/s Pro
GPT-4o 91 tok/s Pro
Kimi K2 178 tok/s Pro
GPT OSS 120B 385 tok/s Pro
Claude Sonnet 4 38 tok/s Pro
2000 character limit reached

On the quantum time complexity of divide and conquer (2311.16401v1)

Published 28 Nov 2023 in quant-ph and cs.DS

Abstract: We initiate a systematic study of the time complexity of quantum divide and conquer algorithms for classical problems. We establish generic conditions under which search and minimization problems with classical divide and conquer algorithms are amenable to quantum speedup and apply these theorems to an array of problems involving strings, integers, and geometric objects. They include LONGEST DISTINCT SUBSTRING, KLEE'S COVERAGE, several optimization problems on stock transactions, and k-INCREASING SUBSEQUENCE. For most of these results, our quantum time upper bound matches the quantum query lower bound for the problem, up to polylogarithmic factors.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (49)
  1. Quantum speedups for exponential-time dynamic programming algorithms. In Proceedings of the 30th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1783–1793, 2019.
  2. Matching triangles and triangle collection: Hardness based on a weak quantum conjecture. arXiv preprint arXiv:2207.11068, 2022.
  3. On the quantum complexity of closest pair and related problems. In Proceedings of the 35th Computational Complexity Conference (CCC), pages 16:1–16:43, 2020.
  4. On the robustness of bucket brigade quantum RAM. In Proceedings of the 10th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC), pages 226–244, 2015.
  5. A quantum query complexity trichotomy for regular languages. In 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), pages 942–965. IEEE, 2019.
  6. Classical and quantum algorithms for variants of subset-sum via dynamic programming. In 30th Annual European Symposium on Algorithms (ESA), pages 6:1–6:18, 2022.
  7. Shyan Akmal and Ce Jin. Near-optimal quantum algorithms for string problems. In Joseph (Seffi) Naor and Niv Buchbinder, editors, Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022, pages 2791–2832. SIAM, 2022.
  8. Andris Ambainis. Quantum walk algorithm for element distinctness. SIAM Journal on Computing, 37(1):210–239, 2007.
  9. Quantum lower bounds for the collision and the element distinctness problems. Journal of the ACM (JACM), 51(4):595–605, 2004.
  10. Quantum lower bounds by polynomials. J. ACM, 48(4):778–797, 2001.
  11. Tight bounds on quantum searching. Fortschritte der Physik: Progress of Physics, 46(4-5):493–505, 1998.
  12. Maximum-weight planar boxes in o(n22{}^{\mbox{2}}start_FLOATSUPERSCRIPT 2 end_FLOATSUPERSCRIPT) time (and better). Information Processing Letters, 114(8):437–445, 2014.
  13. Tight hardness results for maximum weight rectangles. In Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming (ICALP), pages 81:1–81:13, 2016.
  14. Aleksandrs Belovs. Span programs for functions with constant-sized 1-certificates: extended abstract. In Proceedings of the 44th Symposium on Theory of Computing Conference (STOC), pages 77–84, 2012.
  15. Quantum algorithms for the subset-sum problem. In Proceedings of the 5th International workshop on Post-Quantum Cryptography (PQCrypto), pages 16–33, 2013.
  16. Limits of quantum speed-ups for computational geometry and other problems: Fine-grained complexity via quantum walks. In Proceedings of the 13th Innovations in Theoretical Computer Science Conference (ITCS), pages 31:1–31:12, 2022.
  17. A framework of quantum strong exponential-time hypotheses. In Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science (STACS), pages 19:1–19:19, 2021.
  18. Timothy M. Chan. Klee’s measure problem made easy. In Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 410–419, 2013.
  19. Quantum divide and conquer. CoRR, abs/2210.06419, 2022.
  20. Computing a longest increasing subsequence of length k in time o(n log log k). In Erol Gelenbe, Samson Abramsky, and Vladimiro Sassone, editors, Visions of Computer Science - BCS International Academic Conference, Imperial College, London, UK, 22-24 September 2008, pages 69–74. British Computer Society, 2008.
  21. An algorithm for the machine calculation of complex fourier series. Mathematics of Computation, 19(90):297–301, 1965.
  22. Computing the maximum bichromatic discrepancy with applications to computer graphics and machine learning. Journal of Computer and System Sciences, 52(3):453–470, 1996.
  23. A quantum algorithm for finding the minimum. arXiv preprint quant-ph/9607014, 1996.
  24. Boolean matrix multiplication and transitive closure. In 12th Annual Symposium on Switching and Automata Theory, East Lansing, Michigan, USA, October 13-15, 1971, pages 129–131. IEEE Computer Society, 1971.
  25. Computing with noisy information. SIAM J. Comput., 23(5):1001–1018, 1994.
  26. François Le Gall. Improved quantum algorithm for triangle finding via combinatorial arguments. In Proceedings of the 55th IEEE Annual Symposium on Foundations of Computer Science (FOCS), pages 216–225, 2014.
  27. Carl Friedrich Gauss. Theoria interpolationis methodo nova tractata. Carl Friedrich Gauss Werke, Königlichen Gesellschaft der Wissenschaften: Göttingen, 3:265–327, 1876.
  28. Architectures for a quantum random access memory. Physical Review A, 78(5), 2008.
  29. Lov K Grover. A fast quantum mechanical algorithm for database search. In Proceedings of the 28th annual ACM symposium on Theory of computing (STOC), pages 212–219, 1996.
  30. Herman Goldstone and John von Neumann. Planning and coding of problems for an electronic computing instrument. IAS Princeton, 2(2):49—68, 1947.
  31. Gauss and the history of the fast fourier transform. IEEE ASSP Magazine, 1(4):14–21, 1984.
  32. Quantum search on bounded-error inputs. In Proceedings of the 30th International Colloquium on Automata, Languages and Programming (ICALP), pages 291–299, 2003.
  33. Tony Hoare. Quicksort. Comput. J., 5(1):10–15, 1962.
  34. Stacey Jeffery. Quantum subroutine composition. CoRR, abs/2209.14146, 2022.
  35. Personal communication, 2023.
  36. Greedoids - a structural framework for the greedy algorithm. In WILLIAM R. PULLEYBLANK, editor, Progress in Combinatorial Optimization, pages 221–243. Academic Press, 1984.
  37. Victor Klee. Can the measure of ⋃1n[ai,bi]subscriptsuperscript𝑛1subscript𝑎𝑖subscript𝑏𝑖\bigcup^{n}_{1}[a_{i},b_{i}]⋃ start_POSTSUPERSCRIPT italic_n end_POSTSUPERSCRIPT start_POSTSUBSCRIPT 1 end_POSTSUBSCRIPT [ italic_a start_POSTSUBSCRIPT italic_i end_POSTSUBSCRIPT , italic_b start_POSTSUBSCRIPT italic_i end_POSTSUBSCRIPT ] be computed in less than O⁢(n⁢log⁡n)𝑂𝑛𝑛{O}(n\log n)italic_O ( italic_n roman_log italic_n ) steps? American Mathematical Monthly, 84(4):284–285, 1977.
  38. Multiplication of many-digital numbers by automatic computers (in russian). Doklady Akademii Nauk SSSR, 145(2):293–294, 1962.
  39. Improved quantum query algorithms for triangle detection and associativity testing. Algorithmica, 77(2):459–486, 2017.
  40. Quantum algorithms for the triangle problem. SIAM Journal on Computing, 37(2):413–424, 2007.
  41. J. Ian Munro. Efficient determination of the transitive closure of a directed graph. Inf. Process. Lett., 1(2):56–58, 1971.
  42. Volker Strassen. Gaussian elimination is not optimal. Numerische Mathematik, 13(4):354–356, 1969.
  43. Tadao Takaoka. Efficient algorithms for the maximum subarray problem by distance matrix multiplication. In Electronic Notes in Theoretical Computer Science, pages 191–200, 2002.
  44. The power of recursion in graph neural networks for counting substructures. In International Conference on Artificial Intelligence and Statistics, pages 11023–11042. PMLR, 2023.
  45. Algorithms for the maxium subarray problem based on matrix multiplication. In Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 446–452, 1998.
  46. Qisheng Wang. A note on quantum divide and conquer for minimal string rotation. CoRR, abs/2210.09149, 2022.
  47. Virginia Vassilevska Williams. On some fine-grained questions in algorithms and complexity. In Proceedings of the International Congress of Mathematicians (ICM), pages 3447–3487, 2019.
  48. Subcubic equivalences between path, matrix, and triangle problems. J. ACM, 65(5):27:1–27:38, 2018.
  49. Quantum algorithm for lexicographically minimal string rotation. arXiv preprint arXiv:2012.09376, 2020.
Citations (4)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
Lightbulb On Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Generate Now
List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

User Circle Single Streamline Icon: https://streamlinehq.com Sign Up