Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

ACM Conference on Recommender Systems (RecSys)

A Hands-on Dive Into Quantum Computing for Recommender Systems

Maurizio Ferrari Dacrema, Paolo Cremonesi

Published Sep 6, 2025• 0 citations
Publisher
DOI
10.1145/3705328.3748006

Related papers

Quantum Computing for Information Retrieval and Recommender Systems

Maurizio Ferrari Dacrema, Andrea Pasin, Paolo Cremonesi +1 more

Lecture notes in computer science•Jan 1, 2024•10 citations

Deep Dive into Generative, Federative and Explainable Models for Integrating Artificial General Intelligence into Quantum Computing

Binju Saju, C. Chaithanya, Remya Raveendran +1 more

Springer eBooks•Jan 1, 2025•1 citation

Artificial intelligence and quantum computing for solving industrial logistics problems

Amanda G. Valério

The warehouse management problem discussed in this dissertation consists of optimizing the allocation of items in a storage system ordered similarly to a queue and minimizing reallocations of these items. For this purpose, this research proposes three strategies: Quantum Annealing, Simulated Annealing and a Recommendation System, the latter also responsible for generating parameters for the other methods. The results showed that the Recommendation System stood out in terms of processing time and significantly reduced reinsertions. On the other hand, Simulated Annealing achieved even better results, with a significant reduction in the number of reinsertions compared to the company's current method. Both methods revealed practical potential and viable integration into industrial systems. In the quantum approach, despite restrictions on the instances executed, the evolution of the system's energy indicates competitive potential in relation to Simulated Annealing, especially considering the expected advances in fault-tolerant computers. Although currently quantum computers are limited and susceptible to a considerable level of noise, the results obtained already point to practical and promising applications. In addition, a connection was identified between the Lift metric for association rule and the g^(2)(τ) correlation function of quantum optics. On this basis, a study was started to verify the feasibility of developing a quantum recommendation algorithm, whose initial discussions are presented at the end of the dissertation.

•Feb 24, 2025•0 citations

Quantum-inspired algorithms in practice

Juan Miguel Arrazola, Alain Delgado, Bhaskar Roy Bardhan +1 more

We study the practical performance of quantum-inspired algorithms for recommendation systems and linear systems of equations. These algorithms were shown to have an exponential asymptotic speedup compared to previously known classical methods for problems involving low-rank matrices, but with complexity bounds that exhibit a hefty polynomial overhead compared to quantum algorithms. This raised the question of whether these methods were actually useful in practice. We conduct a theoretical analysis aimed at identifying their computational bottlenecks, then implement and benchmark the algorithms on a variety of problems, including applications to portfolio optimization and movie recommendations. On the one hand, our analysis reveals that the performance of these algorithms is better than the theoretical complexity bounds would suggest. On the other hand, their performance as seen in our implementation degrades noticeably as the rank and condition number of the input matrix are increased. Overall, our results indicate that quantum-inspired algorithms can perform well in practice provided that stringent conditions are met: low rank, low condition number, and very large dimension of the input matrix. By contrast, practical datasets are often sparse and high-rank, precisely the type that can be handled by quantum algorithms.

arXiv:1905.10415•Quantum•Aug 13, 2020•182 citations

Exploring the Fusion of Quantum Computing and Machine Learning

Advances in computational intelligence and robotics book series•Apr 17, 2025•0 citations

A Survey on Quantum Computing for Recommendation Systems

Giovanni Pilato, Filippo Vella

Recommendation systems play a key role in everyday life; they are used to suggest items that are selected among many candidates that usually belong to huge datasets. The recommendations require a good performance both in terms of speed and the effectiveness of the provided suggestions. At the same time, one of the most challenging approaches in computer science is quantum computing. This computational paradigm can provide significant acceleration for resource-demanding and time-consuming algorithms. It has become very popular in recent years, thanks to the different tools available to the scientific and technical communities. Since performance has great relevance in recommendation systems, many researchers in the scientific community have recently proposed different improvements that exploit quantum approaches to provide better performance in recommendation systems. This paper gives an overview of the current state of the art in the literature, outlining the different proposed methodologies and techniques and highlighting the challenges that arise from this new approach to the recommendation systems domain.

Information•Dec 29, 2022•26 citations
The warehouse management problem discussed in this dissertation consists of optimizing the allocation of items in a storage system ordered similarly to a queue and minimizing reallocations of these items. For this purpose, this research proposes three strategies: Quantum Annealing, Simulated Annealing and a Recommendation System, the latter also responsible for generating parameters for the other methods. The results showed that the Recommendation System stood out in terms of processing time and significantly reduced reinsertions. On the other hand, Simulated Annealing achieved even better results, with a significant reduction in the number of reinsertions compared to the company's current method. Both methods revealed practical potential and viable integration into industrial systems. In the quantum approach, despite restrictions on the instances executed, the evolution of the system's energy indicates competitive potential in relation to Simulated Annealing, especially considering the expected advances in fault-tolerant computers. Although currently quantum computers are limited and susceptible to a considerable level of noise, the results obtained already point to practical and promising applications. In addition, a connection was identified between the Lift metric for association rule and the g^(2)(τ) correlation function of quantum optics. On this basis, a study was started to verify the feasibility of developing a quantum recommendation algorithm, whose initial discussions are presented at the end of the dissertation.
We study the practical performance of quantum-inspired algorithms for recommendation systems and linear systems of equations. These algorithms were shown to have an exponential asymptotic speedup compared to previously known classical methods for problems involving low-rank matrices, but with complexity bounds that exhibit a hefty polynomial overhead compared to quantum algorithms. This raised the question of whether these methods were actually useful in practice. We conduct a theoretical analysis aimed at identifying their computational bottlenecks, then implement and benchmark the algorithms on a variety of problems, including applications to portfolio optimization and movie recommendations. On the one hand, our analysis reveals that the performance of these algorithms is better than the theoretical complexity bounds would suggest. On the other hand, their performance as seen in our implementation degrades noticeably as the rank and condition number of the input matrix are increased. Overall, our results indicate that quantum-inspired algorithms can perform well in practice provided that stringent conditions are met: low rank, low condition number, and very large dimension of the input matrix. By contrast, practical datasets are often sparse and high-rank, precisely the type that can be handled by quantum algorithms.
Recommendation systems play a key role in everyday life; they are used to suggest items that are selected among many candidates that usually belong to huge datasets. The recommendations require a good performance both in terms of speed and the effectiveness of the provided suggestions. At the same time, one of the most challenging approaches in computer science is quantum computing. This computational paradigm can provide significant acceleration for resource-demanding and time-consuming algorithms. It has become very popular in recent years, thanks to the different tools available to the scientific and technical communities. Since performance has great relevance in recommendation systems, many researchers in the scientific community have recently proposed different improvements that exploit quantum approaches to provide better performance in recommendation systems. This paper gives an overview of the current state of the art in the literature, outlining the different proposed methodologies and techniques and highlighting the challenges that arise from this new approach to the recommendation systems domain.