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

Scientific Reports

Variational quantum recommendation system with embedded latent vectors

Shlomi Debi, Adi Makmal

Published Sep 25, 2025• 1 citation
Publisher

Abstract

As digital content expands, the need to deliver recommendations quickly becomes increasingly important. In traditional recommendation methods the online recommendation time scales linearly with the number of items, making such approaches less effective as datasets grow. Quantum computing offers novel techniques for parallel computation and sampling, yet current hardware remains constrained by noise and limited scalability. Variational quantum algorithms (VQAs), which rely on shallow circuits, are better suited for noisy quantum machines. In this work, we explore a scheme for variational quantum recommendation system (VQRS), which combines classical matrix factorization (MF) and data re-uploading in the offline phase with quantum sampling in the online phase, aiming to accelerate inference. Using noiseless simulations on small-size standard datasets, we assess the method's performance and analyze its computational resource requirements. Our findings indicate that the scheme is capable of learning accurate recommendations on small datasets, but faces scalability challenges and may requires long offline training. Nonetheless, the results show that the proposed quantum circuit design supports the inference of user preferences, and that a relatively small number of online circuit executions suffices to yield moderately accurate predictions. This highlights a trade-off between inference time and accuracy, which may be of interest in applications where online speed is prioritized over precision.

DOI
10.1038/s41598-025-15869-x

Related papers

Quantum Nearest Neighbor Collaborative Filtering Algorithm for Recommendation System

Jiaye Li, Jinjing Shi, Jian Zhang +4 more

Recommendation has become especially crucial during the COVID-19 pandemic as a significant number of people rely on online shopping from home. Existing recommendation algorithms, designed to address issues like cold start and data sparsity, often overlook the time constraints of users. Specifically, users expect to receive recommendations for products of interest in the shortest possible time. To address this challenge, we propose a novel collaborative filtering recommendation algorithm that leverages the advantages of quantum computing circuits based on data reconstruction. This approach allows for the rapid identification of users similar to the target user, thereby improving recommendation speed. In our method, we utilize the information of known users to linearly reconstruct that of the target users, forming a relational matrix. Subsequently, we employ \(l_{2,1}-\) norm and \(l_{1}-\) norm to sparsely constrain the relationship matrix, deducing the weight of each known user. The final step involves providing similar recommendations to target users based on these weights. Furthermore, we implement the proposed algorithm using a quantum circuit, enabling exponential acceleration. The final weight matrix is derived from the quantum state outputted by the circuit. The speed of this process is theoretically demonstrated in detail. Experimental results indicate that our algorithm outperforms state-of-the-art methods in terms of root mean squared error (RMSE), mean absolute error (MAE) and normalized discounted cumulative gain (NDCG). Compared to state-of-the-art comparison algorithms, the proposed algorithm achieves the fastest recommendation speed across eight public datasets.

ACM Transactions on Knowledge Discovery from Data•Jun 29, 2024•6 citations

Accelerating Variational Quantum Algorithms Using Circuit Concurrency

Salonik Resch, Anthony Gutierrez, Joon Suk Huh +5 more

Variational quantum algorithms (VQAs) provide a promising approach to achieve quantum advantage in the noisy intermediate-scale quantum era. In this era, quantum computers experience high error rates and quantum error detection and correction is not feasible. VQAs can utilize noisy qubits in tandem with classical optimization algorithms to solve hard problems. However, VQAs are still slow relative to their classical counterparts. Hence, improving the performance of VQAs will be necessary to make them competitive. While VQAs are expected perform better as the problem sizes increase, increasing their performance will make them a viable option sooner. In this work we show that circuit-level concurrency provides a means to increase the performance of variational quantum algorithms on noisy quantum computers. This involves mapping multiple instances of the same circuit (program) onto the quantum computer at the same time, which allows multiple samples in a variational quantum algorithm to be gathered in parallel for each training iteration. We demonstrate that this technique provides a linear increase in training speed when increasing the number of concurrently running quantum circuits. Furthermore, even with pessimistic error rates concurrent quantum circuit sampling can speed up the quantum approximate optimization algorithm by up to 20x with low mapping and run time overhead.

arXiv:2109.01714•Sep 3, 2021•11 citations

Offline Quantum Reinforcement Learning in a Conservative Manner

Zhihao Cheng, Kaining Zhang, Li Shen +1 more

Recently, to reap the quantum advantage, empowering reinforcement learning (RL) with quantum computing has attracted much attention, which is dubbed as quantum RL (QRL). However, current QRL algorithms employ an online learning scheme, i.e., the policy that is run on a quantum computer needs to interact with the environment to collect experiences, which could be expensive and dangerous for practical applications. In this paper, we aim to solve this problem in an offline learning manner. To be more specific, we develop the first offline quantum RL (offline QRL) algorithm named CQ2L (Conservative Quantum Q-learning), which learns from offline samples and does not require any interaction with the environment. CQ2L utilizes variational quantum circuits (VQCs), which are improved with data re-uploading and scaling parameters, to represent Q-value functions of agents. To suppress the overestimation of Q-values resulting from offline data, we first employ a double Q-learning framework to reduce the overestimation bias; then a penalty term that encourages generating conservative Q-values is designed. We conduct abundant experiments to demonstrate that the proposed method CQ2L can successfully solve offline QRL tasks that the online counterpart could not.

Proceedings of the AAAI Conference on Artificial Intelligence•Jun 26, 2023•7 citations

Smart-Grid Load Forecasting with Variational Quantum Algorithms

Asif Iqbal, Muhammad Naveed Aman, Biplab Sikdar

Accurate load forecasting is critical for effective energy management, infrastructure planning, and ensuring the stability of modern power systems. With growing interest in Quantum Computing (QC), recent efforts have demonstrated the applicability of Quantum Machine Learning (QML) across various domains, including supervised and unsupervised learning. However, the use of QML models for Time Series Forecasting (TSF) remains relatively underexplored. In this work, we present a complete framework for TSF based on Variational Quantum Algorithms (VQAs), capable of both single-step and multi-step ahead forecasting. We use tensor product encoding to encode the classical input samples into quantum states, and use the data re-uploading strategy to introduce temporal dependencies across each layer of the quantum circuit. Within this framework, we systematically evaluate multiple Variational Quantum Circuit (VQC) architectures to assess their suitability for forecasting problem. Among the tested configurations, thenLocaland its modified variantQuReUpconsistently outperformed other quantum ansatz designs. Notably, in recursive multi-step forecasting scenarios, these models not only matched but surpassed the performance of a classical Artificial Neural Network (ANN). For example, thenLocalmodel achieved a 8% reduction in mean absolute error (MAE) over ANN for a 24-hour horizon. These results underscore the potential of VQAs for efficient and accurate TSF, particularly in scenarios requiring short to medium-term predictions. The proposed framework offers a promising foundation for future research, including extensions to diverse datasets and deployment on real quantum hardware to study the impact of quantum noise and scalability.

IEEE Transactions on Consumer Electronics•Jan 1, 2026•0 citations

A Study on Optimization Techniques for Variational Quantum Circuits in Reinforcement Learning

Michael Kölle, Timo Witter, Tobias Rohe +3 more

Quantum Computing aims to streamline machine learning, making it more effective with fewer trainable parameters. This reduction of parameters can speed up the learning process and reduce the use of computational resources. However, in the current phase of quantum computing development, known as the noisy intermediate-scale quantum era (NISQ), learning is difficult due to a limited number of qubits and widespread quantum noise. To overcome these challenges, researchers are focusing on variational quantum circuits (VQCs). VQCs are hybrid algorithms that merge a quantum circuit, which can be adjusted through parameters, with traditional classical optimization techniques. These circuits require only few qubits for effective learning. Recent studies have presented new ways of applying VQCs to reinforcement learning, showing promising results that warrant further exploration. This study investigates the effects of various techniques — data re-uploading, input scaling, output scaling — and introduces exponential learning rate decay in the quantum proximal policy optimization algorithm’s actor-VQC. We assess these methods in the popular Frozen Lake and Cart Pole environments. Our focus is on their ability to reduce the number of parameters in the VQC without losing effectiveness. Our findings indicate that data re-uploading and an exponential learning rate decay significantly enhance hyperparameter stability and overall performance. While input scaling does not improve parameter efficiency, output scaling effectively manages greediness, leading to increased learning speed and robustness.

arXiv:2405.12354•IEEE International Conference on Quantum Software (QSW)•Jul 7, 2024•9 citations

A Quantum Machine Learning Approach to Content-Based Media Recommendation

Mina Abbaszadeh, Ouissal Moumou, Anna Pearson +4 more

We use quantum machine learning techniques to develop a content-based media recommender system and evaluate its performance on TV programmes using textual descriptions from one week of BBC iPlayer data. Grounded in the Quantum Natural Language Processing framework (QNLP), programme synopses are mapped to variational quantum circuits using their semantic structure. The parameters of these circuits are trained via a supervised pairwise similarity learning task. We benchmark the quantum recommender against a classical BiLSTM baseline trained on the same dataset and objective. While both models achieve comparable performance on the similarity learning task, the quantum model requires significantly fewer parameters (47k vs. 17.8M). When the BiLSTM is constrained to a matching parameter budget, its performance degrades substantially (by 3.63 percentage points in Mean Average Precision (MAP)), indicating that the structured quantum representation provides a highly parameter-efficient alternative in this setting. We demonstrate the feasibility of executing the trained models on quantum hardware by deploying the circuits on Quantinuum's System Model H2 (and accompanying emulator) using a SWAP-test-based protocol. The results confirm that the similarity signal is preserved under realistic, noisy conditions. Taken together, these findings highlight the potential of variational quantum circuits for recommendation tasks and represent a practical step toward their real-world deployment.

arXiv:2610.21562•Oct 15, 2026•0 citations
As digital content expands, the need to deliver recommendations quickly becomes increasingly important. In traditional recommendation methods the online recommendation time scales linearly with the number of items, making such approaches less effective as datasets grow. Quantum computing offers novel techniques for parallel computation and sampling, yet current hardware remains constrained by noise and limited scalability. Variational quantum algorithms (VQAs), which rely on shallow circuits, are better suited for noisy quantum machines. In this work, we explore a scheme for variational quantum recommendation system (VQRS), which combines classical matrix factorization (MF) and data re-uploading in the offline phase with quantum sampling in the online phase, aiming to accelerate inference. Using noiseless simulations on small-size standard datasets, we assess the method's performance and analyze its computational resource requirements. Our findings indicate that the scheme is capable of learning accurate recommendations on small datasets, but faces scalability challenges and may requires long offline training. Nonetheless, the results show that the proposed quantum circuit design supports the inference of user preferences, and that a relatively small number of online circuit executions suffices to yield moderately accurate predictions. This highlights a trade-off between inference time and accuracy, which may be of interest in applications where online speed is prioritized over precision.
Recommendation has become especially crucial during the COVID-19 pandemic as a significant number of people rely on online shopping from home. Existing recommendation algorithms, designed to address issues like cold start and data sparsity, often overlook the time constraints of users. Specifically, users expect to receive recommendations for products of interest in the shortest possible time. To address this challenge, we propose a novel collaborative filtering recommendation algorithm that leverages the advantages of quantum computing circuits based on data reconstruction. This approach allows for the rapid identification of users similar to the target user, thereby improving recommendation speed. In our method, we utilize the information of known users to linearly reconstruct that of the target users, forming a relational matrix. Subsequently, we employ l2,1−l_{2,1}-l2,1​− norm and l1−l_{1}-l1​− norm to sparsely constrain the relationship matrix, deducing the weight of each known user. The final step involves providing similar recommendations to target users based on these weights. Furthermore, we implement the proposed algorithm using a quantum circuit, enabling exponential acceleration. The final weight matrix is derived from the quantum state outputted by the circuit. The speed of this process is theoretically demonstrated in detail. Experimental results indicate that our algorithm outperforms state-of-the-art methods in terms of root mean squared error (RMSE), mean absolute error (MAE) and normalized discounted cumulative gain (NDCG). Compared to state-of-the-art comparison algorithms, the proposed algorithm achieves the fastest recommendation speed across eight public datasets.
Variational quantum algorithms (VQAs) provide a promising approach to achieve quantum advantage in the noisy intermediate-scale quantum era. In this era, quantum computers experience high error rates and quantum error detection and correction is not feasible. VQAs can utilize noisy qubits in tandem with classical optimization algorithms to solve hard problems. However, VQAs are still slow relative to their classical counterparts. Hence, improving the performance of VQAs will be necessary to make them competitive. While VQAs are expected perform better as the problem sizes increase, increasing their performance will make them a viable option sooner. In this work we show that circuit-level concurrency provides a means to increase the performance of variational quantum algorithms on noisy quantum computers. This involves mapping multiple instances of the same circuit (program) onto the quantum computer at the same time, which allows multiple samples in a variational quantum algorithm to be gathered in parallel for each training iteration. We demonstrate that this technique provides a linear increase in training speed when increasing the number of concurrently running quantum circuits. Furthermore, even with pessimistic error rates concurrent quantum circuit sampling can speed up the quantum approximate optimization algorithm by up to 20x with low mapping and run time overhead.
Recently, to reap the quantum advantage, empowering reinforcement learning (RL) with quantum computing has attracted much attention, which is dubbed as quantum RL (QRL). However, current QRL algorithms employ an online learning scheme, i.e., the policy that is run on a quantum computer needs to interact with the environment to collect experiences, which could be expensive and dangerous for practical applications. In this paper, we aim to solve this problem in an offline learning manner. To be more specific, we develop the first offline quantum RL (offline QRL) algorithm named CQ2L (Conservative Quantum Q-learning), which learns from offline samples and does not require any interaction with the environment. CQ2L utilizes variational quantum circuits (VQCs), which are improved with data re-uploading and scaling parameters, to represent Q-value functions of agents. To suppress the overestimation of Q-values resulting from offline data, we first employ a double Q-learning framework to reduce the overestimation bias; then a penalty term that encourages generating conservative Q-values is designed. We conduct abundant experiments to demonstrate that the proposed method CQ2L can successfully solve offline QRL tasks that the online counterpart could not.
Accurate load forecasting is critical for effective energy management, infrastructure planning, and ensuring the stability of modern power systems. With growing interest in Quantum Computing (QC), recent efforts have demonstrated the applicability of Quantum Machine Learning (QML) across various domains, including supervised and unsupervised learning. However, the use of QML models for Time Series Forecasting (TSF) remains relatively underexplored. In this work, we present a complete framework for TSF based on Variational Quantum Algorithms (VQAs), capable of both single-step and multi-step ahead forecasting. We use tensor product encoding to encode the classical input samples into quantum states, and use the data re-uploading strategy to introduce temporal dependencies across each layer of the quantum circuit. Within this framework, we systematically evaluate multiple Variational Quantum Circuit (VQC) architectures to assess their suitability for forecasting problem. Among the tested configurations, thenLocaland its modified variantQuReUpconsistently outperformed other quantum ansatz designs. Notably, in recursive multi-step forecasting scenarios, these models not only matched but surpassed the performance of a classical Artificial Neural Network (ANN). For example, thenLocalmodel achieved a 8% reduction in mean absolute error (MAE) over ANN for a 24-hour horizon. These results underscore the potential of VQAs for efficient and accurate TSF, particularly in scenarios requiring short to medium-term predictions. The proposed framework offers a promising foundation for future research, including extensions to diverse datasets and deployment on real quantum hardware to study the impact of quantum noise and scalability.
Quantum Computing aims to streamline machine learning, making it more effective with fewer trainable parameters. This reduction of parameters can speed up the learning process and reduce the use of computational resources. However, in the current phase of quantum computing development, known as the noisy intermediate-scale quantum era (NISQ), learning is difficult due to a limited number of qubits and widespread quantum noise. To overcome these challenges, researchers are focusing on variational quantum circuits (VQCs). VQCs are hybrid algorithms that merge a quantum circuit, which can be adjusted through parameters, with traditional classical optimization techniques. These circuits require only few qubits for effective learning. Recent studies have presented new ways of applying VQCs to reinforcement learning, showing promising results that warrant further exploration. This study investigates the effects of various techniques — data re-uploading, input scaling, output scaling — and introduces exponential learning rate decay in the quantum proximal policy optimization algorithm’s actor-VQC. We assess these methods in the popular Frozen Lake and Cart Pole environments. Our focus is on their ability to reduce the number of parameters in the VQC without losing effectiveness. Our findings indicate that data re-uploading and an exponential learning rate decay significantly enhance hyperparameter stability and overall performance. While input scaling does not improve parameter efficiency, output scaling effectively manages greediness, leading to increased learning speed and robustness.
We use quantum machine learning techniques to develop a content-based media recommender system and evaluate its performance on TV programmes using textual descriptions from one week of BBC iPlayer data. Grounded in the Quantum Natural Language Processing framework (QNLP), programme synopses are mapped to variational quantum circuits using their semantic structure. The parameters of these circuits are trained via a supervised pairwise similarity learning task. We benchmark the quantum recommender against a classical BiLSTM baseline trained on the same dataset and objective. While both models achieve comparable performance on the similarity learning task, the quantum model requires significantly fewer parameters (47k vs. 17.8M). When the BiLSTM is constrained to a matching parameter budget, its performance degrades substantially (by 3.63 percentage points in Mean Average Precision (MAP)), indicating that the structured quantum representation provides a highly parameter-efficient alternative in this setting. We demonstrate the feasibility of executing the trained models on quantum hardware by deploying the circuits on Quantinuum's System Model H2 (and accompanying emulator) using a SWAP-test-based protocol. The results confirm that the similarity signal is preserved under realistic, noisy conditions. Taken together, these findings highlight the potential of variational quantum circuits for recommendation tasks and represent a practical step toward their real-world deployment.