Sampling-based Sublinear Low-rank Matrix Arithmetic Framework for Dequantizing Quantum Machine Learning

DOI10.1145/3549524MaRDI QIDQ5889778zbMATH OpenOpenAlexWikidataFDO

Authors Nai-Hui Chia, András Pal Gilyén, Tongyang Li, Han-Hsuan Lin, Ewin Tang, Chun-Hao Wang

Publication date 27 April 2023

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3549524

zbMATH Keywords

quantum computingquantum-inspired classical algorithmssublinear algorithmstheoretical machine learning

Mathematics Subject Classification ID

Computer science (68-XX)

Recommendations

• Sampling-based sublinear low-rank matrix arithmetic framework for dequantizing quantum machine learning
• A quantum-inspired classical algorithm for recommendation systems

Cited in

(7)

• Quantum-inspired algorithm for truncated total least squares solution
• Quantum speedups for linear programming via interior point methods
• A survey of quantum machine learning: understanding the current landscape and future opportunities
• Robust dequantization of the quantum singular value transformation and quantum machine learning algorithms
• Clustering-based low rank approximation method
• Classical algorithms for constant approximation of the ground state energy of local Hamiltonians
• Nearly optimal circuit size for sparse quantum state preparation

This page was built for publication: Sampling-based Sublinear Low-rank Matrix Arithmetic Framework for Dequantizing Quantum Machine Learning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5889778)