A quantum-inspired classical algorithm for recommendation systems

DOI10.1145/3313276.3316310zbMath1433.68436arXiv1807.04271OpenAlexW3101135395WikidataQ130917125 ScholiaQ130917125MaRDI QIDQ5212763

Ewin Tang

Publication date: 30 January 2020

Published in: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1807.04271

zbMATH Keywords

samplinglow-rank approximationrecommender systemsquantum machine learningexponential speedup

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Learning and adaptive systems in artificial intelligence (68T05) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35) Data structures (68P05) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (13)

Quantum-inspired canonical correlation analysis for exponentially large dimensional data ⋮ Dequantizing the Quantum singular value transformation: hardness and applications to Quantum chemistry and the Quantum PCP conjecture ⋮ Sample-size-reduction of quantum states for the noisy linear problem ⋮ The quantum detection of projectors in finite-dimensional algebras and holography ⋮ Quantum context-aware recommendation systems based on tensor singular value decomposition ⋮ Unnamed Item ⋮ A survey on HHL algorithm: from theory to application in quantum machine learning ⋮ Quantum-enhanced least-square support vector machine: simplified quantum algorithm and sparse solutions ⋮ The Road to Quantum Computational Supremacy ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Quantum learning of concentrated Boolean functions

This page was built for publication: A quantum-inspired classical algorithm for recommendation systems