Quantum Semi-Random Forests for Qubit-Efficient Recommender Systems
By: Azadeh Alavi , Fatemeh Kouchmeshki , Abdolrahman Alavi and more
Potential Business Impact:
Recommends items using just five qubits.
Modern recommenders describe each item with hundreds of sparse semantic tags, yet most quantum pipelines still map one qubit per tag, demanding well beyond one hundred qubits, far out of reach for current noisy-intermediate-scale quantum (NISQ) devices and prone to deep, error-amplifying circuits. We close this gap with a three-stage hybrid machine learning algorithm that compresses tag profiles, optimizes feature selection under a fixed qubit budget via QAOA, and scores recommendations with a Quantum semi-Random Forest (QsRF) built on just five qubits, while performing similarly to the state-of-the-art methods. Leveraging SVD sketching and k-means, we learn a 1000-atom dictionary ($>$97 \% variance), then solve a 2020 QUBO via depth-3 QAOA to select 5 atoms. A 100-tree QsRF trained on these codes matches full-feature baselines on ICM-150/500.
Similar Papers
Collaborative Filtering using Variational Quantum Hopfield Associative Memory
Information Retrieval
Helps movies know what you'll like better.
Hybrid Quantum-Classical Neural Networks for Few-Shot Credit Risk Assessment
Machine Learning (CS)
Helps banks decide who to lend money to.
Representation Quantization for Collaborative Filtering Augmentation
Information Retrieval
Finds better movie and product matches for you.