Understanding whether quantum machine learning algorithms present a genuine computational advantage over classical approaches is challenging. Ewin Tang explains how dequantizing algorithms can uncover when there is no quantum speedup and perhaps help explore analogies between quantum and classical linear algebra.
This is a preview of subscription content, access via your institution
Access options
Access Nature and 54 other Nature Portfolio journals
Get Nature+, our best-value online-access subscription
$29.99 / 30 days
cancel any time
Subscribe to this journal
Receive 12 digital issues and online access to articles
$99.00 per year
only $8.25 per issue
Buy this article
- Purchase on Springer Link
- Instant access to full article PDF
Prices may be subject to local taxes which are calculated during checkout
References
Kerenidis, I. & Prakash, A. Quantum recommendation systems. In Proc. 8th Innovations Theor. Comput. Sci. Conf. (ITCS) 49:1–49:21 (Schloss Dagstuhl, 2017).
Lloyd, S., Garnerone, S. & Zanardi, P. Quantum algorithms for topological and geometric analysis of data. Nat. Commun. 7, 10138 (2016).
Aaronson, S. Read the fine print. Nat. Phys. 11, 291–293 (2015).
Harrow, A. W., Hassidim, A. & Lloyd, S. Quantum algorithm for linear systems of equations. Phys. Rev. Lett. 103, 150502 (2009).
Chia, N.-H. et al. Sampling-based sublinear low-rank matrix arithmetic framework for dequantizing quantum machine learning. In Proc. 52nd Ann. ACM SIGACT Symp. Theory of Comput. (STOC 2020) 387–400 (Association for Computing Machinery, 2020).
Gharibian, S. & Le Gall, F. Dequantizing the quantum singular value transformation: Hardness and applications to quantum chemistry and the quantum PCP conjecture. In Proc. 54th Ann. ACM SIGACT Symp. Theory of Comput. (STOC 2022) 19–32 (Association for Computing Machinery, 2022).
Woodruff, D. P. Sketching as a tool for numerical linear algebra. Found. Trends Theor. Comput. Sci. 10, 1–157 (2014).
Drineas, P., Kannan, R. & Mahoney, M. W. Fast Monte Carlo algorithms for matrices II: Computing a low-rank approximation to a matrix. SIAM J. Comput. 36, 158–183 (2006).
Cotler, J., Huang, H.-Y. & McClean, J. R. Revisiting dequantization and quantum advantage in learning tasks. Preprint at https://arxiv.org/abs/2112.00811 (2021).
Huang, H.-Y. et al. Quantum advantage in learning from experiments. Science 376, 1182–1186 (2022).
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Competing interests
The author declares no competing interests.
Rights and permissions
About this article
Cite this article
Tang, E. Dequantizing algorithms to understand quantum advantage in machine learning. Nat Rev Phys 4, 692–693 (2022). https://doi.org/10.1038/s42254-022-00511-w
Published:
Issue Date:
DOI: https://doi.org/10.1038/s42254-022-00511-w
This article is cited by
-
Drug design on quantum computers
Nature Physics (2024)
-
Quantum computing for finance
Nature Reviews Physics (2023)
