Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Lower bounds for quantum-inspired classical algorithms via communication complexity (2402.15686v2)

Published 24 Feb 2024 in quant-ph and cs.CC

Abstract: Quantum-inspired classical algorithms provide us with a new way to understand the computational power of quantum computers for practically-relevant problems, especially in machine learning. In the past several years, numerous efficient algorithms for various tasks have been found, while an analysis of lower bounds is still missing. Using communication complexity, in this work we propose the first method to study lower bounds for these tasks. We mainly focus on lower bounds for solving linear regressions, supervised clustering, principal component analysis, recommendation systems, and Hamiltonian simulations. For those problems, we prove a quadratic lower bound in terms of the Frobenius norm of the underlying matrix. As quantum algorithms are linear in the Frobenius norm for those problems, our results mean that the quantum-classical separation is at least quadratic. As a generalisation, we extend our method to study lower bounds analysis of quantum query algorithms for matrix-related problems using quantum communication complexity. Some applications are given.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (32)
  1. A theory of quantum differential equation solvers: limitations and fast-forwarding. arXiv:2211.05246, 2022.
  2. An improved classical singular value transformation for quantum machine learning. In Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 2398–2453. SIAM, 2024. arXiv:2303.01492.
  3. Black-box Hamiltonian simulation and unitary implementation. Quantum Information and Computation, 12(1-2):29–62, 2012.
  4. An optimal lower bound on the communication complexity of gap-hamming-distance. In Proceedings of the forty-third annual ACM symposium on Theory of computing, pages 51–60, 2011.
  5. The Power of Block-Encoded Matrix Powers: Improved Regression Techniques via Faster Hamiltonian Simulation. In 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019), volume 132, pages 33:1–33:14, 2019. arXiv:1804.01973.
  6. Sampling-based sublinear low-rank matrix arithmetic framework for dequantizing quantum machine learning. Journal of the ACM, 69(5):1–72, 2022. arXiv:1910.06151.
  7. Dequantizing the quantum singular value transformation: hardness and applications to quantum chemistry and the quantum pcp conjecture. In Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, pages 19–32, 2022.
  8. Quantum-inspired low-rank stochastic regression with logarithmic dependence on the dimension. arXiv:1811.04909, 2018.
  9. An improved quantum-inspired algorithm for linear regression. Quantum, 6:754, 2022. arXiv:2009.07268.
  10. Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics. In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, pages 193–204, 2019.
  11. Lov K Grover. A fast quantum mechanical algorithm for database search. In Proceedings of the twenty-eighth annual ACM Symposium on Theory of computing, pages 212–219, 1996.
  12. Quantum algorithm for linear systems of equations. Physical Review Letters, 103(15):150502, 2009.
  13. The probabilistic communication complexity of set intersection. SIAM Journal on Discrete Mathematics, 5(4):545–557, 1992.
  14. Quantum recommendation systems. In 8th Innovations in Theoretical Computer Science Conference (ITCS 2017), page 49:1–49:21, 2017. arXiv:1603.08675.
  15. Quantum Recommendation Systems. In Christos H. Papadimitriou, editor, 8th Innovations in Theoretical Computer Science Conference (ITCS 2017), volume 67 of Leibniz International Proceedings in Informatics (LIPIcs), pages 49:1–49:21, Dagstuhl, Germany, 2017. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik.
  16. ℓpsubscriptℓ𝑝\ell_{p}roman_ℓ start_POSTSUBSCRIPT italic_p end_POSTSUBSCRIPT-Regression in the Arbitrary Partition Model of Communication. In The Thirty Sixth Annual Conference on Learning Theory, pages 4902–4928. PMLR, 2023.
  17. Quantum algorithms for supervised and unsupervised machine learning. arXiv:1307.0411, 2013.
  18. Quantum principal component analysis. Nature Physics, 10(9):631–633, 2014.
  19. Ashley Montanaro. Quantum states cannot be transmitted efficiently classically. Quantum, 3:154, 2019.
  20. Quantum and classical query complexities of functions of matrices. arXiv:2311.06999, 2023.
  21. Quantum communication complexity of linear regression. ACM Transactions on Computation Theory, 16(1):1–30, 2024. arXiv:2210.01601.
  22. Quantum Computation and Quantum Information. Cambridge university press, 2010.
  23. Lower bounds for number-in-hand multiparty communication complexity, made easy. In Proceedings of the twenty-third annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 486–501. SIAM, 2012. arXiv:1107.2559.
  24. Communication Complexity: and Applications. Cambridge University Press, 2020.
  25. Alexander A Razborov. On the distributional complexity of disjointness. In Automata, Languages and Programming: 17th International Colloquium Warwick University, England, July 16–20, 1990 Proceedings 17, pages 249–253. Springer, 1990.
  26. Faster quantum-inspired algorithms for solving linear systems. ACM Transactions on Quantum Computing, 3(4):1–23, 2022. arXiv:2103.10309.
  27. Ewin Tang. A quantum-inspired classical algorithm for recommendation systems. In Proceedings of the 51st annual ACM SIGACT Symposium on Theory of Computing, pages 217–228, 2019. arXiv:1807.04271.
  28. Ewin Tang. Quantum principal component analysis only achieves an exponential speedup because of its state preparation assumptions. Physical Review Letters, 127(6):060503, 2021.
  29. Ronald de Wolf. Quantum communication and complexity. Theoretical Computer Science, 287(1):337–353, 2002.
  30. When distributed computation is communication expensive. Distributed Computing, 30(5):309–323, 2017. arXiv:1304.4636.
  31. Andrew Chi-Chih Yao. Some complexity questions related to distributive computing (preliminary report). In Proceedings of the 11th annual ACM Symposium on Theory of Computing, pages 209–213, 1979.
  32. Fast and practical quantum-inspired classical algorithms for solving linear systems. arXiv:2307.06627, 2023.
User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (2)
  1. Nikhil S. Mande (22 papers)
  2. Changpeng Shao (34 papers)
Citations (1)
View on Semantic Scholar

Summary

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

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