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

arXiv:2508.00027 · IEEE International Conference on Quantum Artificial Intelligence (QAI)

Quantum Semi-Random Forests for Qubit-Efficient Recommender Systems

Azadeh Alavi, Fatemeh Kouchmeshki, Abdolrahman Alavi, Yongli Ren, Jiayang Niu

Published Nov 2, 2025• 0 citations
arXivHTMLPDF

Abstract

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$20 \times 20$QUBO via depth-3 QAOA to select 5 atoms. A 100-tree QsRF trained on these codes achieves superior nDCG@10 with competitive AUC and Log-Loss on ICM-150/50.

DOI
10.1109/qai63978.2025.00068

Related papers

Hybrid Quantum-Classical Machine Learning Models: Design, Implementation, And Performance Evaluation On NISQ Devices

P. Sunil, G. Swapna

Quantum machine learning has emerged as a promising approach to enhance computational efficiency by leveraging the principles of quantum computing. However, the limitations of current Noisy Intermediate-Scale Quantum (NISQ) devices, such as noise, limited qubit availability, and circuit depth constraints, restrict the implementation of fully quantum models. To address these challenges, this study focuses on the design, implementation, and performance evaluation of hybrid quantum-classical machine learning (HQML) models. The proposed approach integrates parameterized quantum circuits with classical optimization techniques to enable efficient learning within NISQ environments. The study employs standard benchmark datasets, including Iris, Breast Cancer, and MNIST, to evaluate the performance of the hybrid model. The results indicate that the HQML model achieves competitive accuracy on small and medium-sized datasets while maintaining balanced precision, recall, and F1-score. However, performance declines for complex datasets due to hardware limitations and noise effects. Additionally, the hybrid model demonstrates a lower number of parameters compared to classical deep learning models but requires higher training time due to iterative quantum-classical optimization. The findings highlight that hybrid quantum-classical models provide a practical and scalable approach for utilizing quantum computing in the current technological landscape. Although challenges related to noise, scalability, and computational overhead persist, advancements in quantum hardware and algorithm design are expected to improve performance. This study contributes to the growing field of quantum machine learning by providing a systematic framework for evaluating hybrid models on NISQ devices and identifying key areas for future research.

•Jan 1, 2026•0 citations

A Near Optimal Quantum Resource Allocation Using Hybrid Quantum Machine Learning Classifiers

P Vimal Suresh, M. Kowsigan

Hybrid Quantum-Classical Machine Learning (HQML) is an emerging technology that can be used for solving problems with higher computational intensity. This paradigm is designed to solve problems that remain challenging to classical machine learning approaches. Noisy Intermediate-Scale Quantum (NISQ) devices (which are today’s quantum computers) are prone to frequent errors and cannot perform fault-tolerant quantum computation. NISQ devices have a limited number of qubits, and as the number of qubits increases, circuit depth also increases, leading to increase in noise. Therefore, selecting the optimal number of qubits remains a challenge. The goal is to develop a framework that tests a Variational Quantum Classifier (VQC) with a different numbers of qubits. For each configuration, the model’s prediction accuracy and the hardware resources it consumes (gate count and circuit depth) are evaluated. Using this data, the best qubit configuration that provides the optimal balance between accuracy and resource utilization can be identified. Experiments were conducted using the Wisconsin Breast Cancer dataset, where benign and malignant tumors are classified. The dataset was preprocessed by applying Principal Component Analysis (PCA) to reduce the feature space to a maximum of six principal components. A ZZFeatureMap was used to encode the reduced features, which were then processed by a VQC with a RealAmplitudes ansatz. The COBYLA optimizer was used to train the VQC, and the experiment was repeated using different numbers of qubits from 2 to 6. Quantum circuits were transpiled into realistic IBM fake backends (FakeManilaV2 and FakeJakartaV2) for hardware-aware analysis, obtaining two key metrics: CNOT gate count and circuit depth. An AerSimulator configured with the FakeManilaV2 noise model was used to carry out the noise-aware simulation. The framework was evaluated using classification accuracy, training time, circuit depth, CNOT gate count, and noise-aware accuracy. Based on these criteria, the optimal qubit configuration that balances predictive performance with quantum hardware resource utilization was identified. The results identify 2 qubits as the optimal “sweet spot,” achieving 83.21% accuracy under ideal simulation and 81.75% under noise-aware simulation while maintaining lower resource requirements. These findings provide practical guidelines for resource-efficient hybrid quantum machine learning on NISQ hardware.

International Conference on Next-Gen Intelligent Computing and Applications (ICONICA)•Aug 1, 2026•0 citations

Empirical Study of Quantum Machine Learning Algorithms for Accelerating Functional Materials Discovery

Doris Ngozi Nwachuku, Ericdavid E. Ugochukwu

Quantum machine learning (QML) represents a convergence of quantum computing and statistical learning theory with transformative potential for high-throughput computational materials discovery. This empirical study systematically benchmarks six QML architectures — quantum kernel support vector machines, variational quantum eigensolvers augmented by graph neural networks, quantum approximate optimization algorithm hybrids, quantum random forests, quantum Boltzmann machines, and parameterized quantum circuit-based neural networks — against their classical analogues across five material classes comprising perovskite oxides, battery cathode materials, two-dimensional semiconductor alloys, metal-organic frameworks, and high-entropy alloys. Using 14,720 DFT-computed property records drawn from the Materials Project and AFLOW databases as the common evaluation corpus, the QML methods achieved mean absolute error reductions of 38–61% and training time compressions of 29–61% relative to equivalent classical estimators at equivalent dataset sizes. The quantum random forest architecture exhibited the strongest overall performance (MAE = 0.026 eV; R² = 0.978), while hardware-native implementations on IBM Quantum Eagle and IonQ Forte achieved practical speed-ups of 28x–41x over CPU-based baselines. Barren plateau pathology and noise-induced gradient suppression remained the principal barriers to scaling beyond 50 qubits on current NISQ hardware. The empirical results of this study established principal conclusions that advance the theoretical and practical understanding of QML in materials discovery contexts. These findings provide grounding for deploying QML in production materials informatics pipelines.

Nigerian Journal of Physics•Jun 19, 2026•0 citations

Feature Encoding in Quantum Machine Learning: A Survey and Practical Guidelines

Vincenzo Sammartino

The encoding of classical data into quantum states constitutes the primary performance bottleneck in Quantum Machine Learning (qml) on Noisy Intermediate-Scale Quantum (nisq) devices. No existing framework jointly characterises resource cost, expressivity, and noise robustness, nor provides actionable selection guidelines for practitioners. This survey addresses that gap through a systematic review of 66 primary works (2017-2026) assembled via a PRISMA-adapted protocol across five academic databases. Four principal contributions are made. First, a three-axis cost-expressivity-robustness taxonomy classifies all major encoding families - basis, angle, dense-angle, amplitude, data re-uploading, and IQP - along independently measurable axes. Second, closed-form depth-fidelity bounds under nisq decoherence channels identify the critical gate-error rate p* ~ 10^-3 below which amplitude encoding is viable. Third, a unified treatment of Fourier expressivity, barren-plateau onset, and quantum kernel concentration as functions of the encoding circuit provides the first joint trainability analysis. Fourth, a five-regime decision framework maps (D, n, p, tau) - feature dimension, qubit budget, error rate, and task type - to a hardware-grounded encoding recommendation. The central finding is that for p >= 10^-3, shallow angle-based encodings consistently outperform amplitude encoding in practice, despite the latter's exponential qubit advantage.

quant-pharXiv:2606.05387•Jun 5, 2026•3 citations

qc-kmeans: A Quantum Compressive K-Means Algorithm for NISQ Devices

Pedro Chumpitaz-Flores, My Duong, Ying Mao +1 more

Clustering on NISQ hardware is constrained by data loading and limited qubits. We present \textbf{qc-kmeans}, a hybrid compressive $k$-means that summarizes a dataset with a constant-size Fourier-feature sketch and selects centroids by solving small per-group QUBOs with shallow QAOA circuits. The QFF sketch estimator is unbiased with mean-squared error $O(\varepsilon^2)$ for $B,S=Θ(\varepsilon^{-2})$, and the peak-qubit requirement $q_{\text{peak}}=\max\{D,\lceil \log_2 B\rceil + 1\}$ does not scale with the number of samples. A refinement step with elitist retention ensures non-increasing surrogate cost. In Qiskit Aer simulations (depth $p{=}1$), the method ran with $\le 9$ qubits on low-dimensional synthetic benchmarks and achieved competitive sum-of-squared errors relative to quantum baselines; runtimes are not directly comparable. On nine real datasets (up to $4.3\times 10^5$ points), the pipeline maintained constant peak-qubit usage in simulation. Under IBM noise models, accuracy was similar to the idealized setting. Overall, qc-kmeans offers a NISQ-oriented formulation with shallow, bounded-width circuits and competitive clustering quality in simulation.

arXiv:2510.22540•IEEE International Conference on Big Data (BigData)•Dec 8, 2025•3 citations

A Review of Molecular Representations in Quantum Machine Learning

Glauco Endrigo, Clovis Caface, Raphael Yokoingawa +3 more

This review synthesizes state-of-the-art quantum machine learning (QML) techniques for molecular modeling, focusing on strategies designed to overcome the limitations of Noisy Intermediate-Scale Quantum (NISQ) hardware. A central challenge is the encoding of high-dimensional chemical data, including fingerprints, graphs, and 3D geometries, onto low-qubit devices. The survey covers several key approaches, including the radical compression of molecular fingerprints for discriminative classifiers; hybrid generative models that embed quantum circuits within classical graph-based frameworks; iterative encoding of local atomic neighborhoods to process molecules of any size with fixed-size circuits; and the use of quantum annealers to sample from energy-based models by reformulating them as quadratic unconstrained binary optimization (QUBO) problems. This review categorizes these distinct methods, illuminates the common principles of hybrid design, and identifies key bottlenecks.

•Oct 4, 2026•0 citations
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 a20×2020 \times 2020×20QUBO via depth-3 QAOA to select 5 atoms. A 100-tree QsRF trained on these codes achieves superior nDCG@10 with competitive AUC and Log-Loss on ICM-150/50.
Quantum machine learning has emerged as a promising approach to enhance computational efficiency by leveraging the principles of quantum computing. However, the limitations of current Noisy Intermediate-Scale Quantum (NISQ) devices, such as noise, limited qubit availability, and circuit depth constraints, restrict the implementation of fully quantum models. To address these challenges, this study focuses on the design, implementation, and performance evaluation of hybrid quantum-classical machine learning (HQML) models. The proposed approach integrates parameterized quantum circuits with classical optimization techniques to enable efficient learning within NISQ environments. The study employs standard benchmark datasets, including Iris, Breast Cancer, and MNIST, to evaluate the performance of the hybrid model. The results indicate that the HQML model achieves competitive accuracy on small and medium-sized datasets while maintaining balanced precision, recall, and F1-score. However, performance declines for complex datasets due to hardware limitations and noise effects. Additionally, the hybrid model demonstrates a lower number of parameters compared to classical deep learning models but requires higher training time due to iterative quantum-classical optimization. The findings highlight that hybrid quantum-classical models provide a practical and scalable approach for utilizing quantum computing in the current technological landscape. Although challenges related to noise, scalability, and computational overhead persist, advancements in quantum hardware and algorithm design are expected to improve performance. This study contributes to the growing field of quantum machine learning by providing a systematic framework for evaluating hybrid models on NISQ devices and identifying key areas for future research.
Hybrid Quantum-Classical Machine Learning (HQML) is an emerging technology that can be used for solving problems with higher computational intensity. This paradigm is designed to solve problems that remain challenging to classical machine learning approaches. Noisy Intermediate-Scale Quantum (NISQ) devices (which are today’s quantum computers) are prone to frequent errors and cannot perform fault-tolerant quantum computation. NISQ devices have a limited number of qubits, and as the number of qubits increases, circuit depth also increases, leading to increase in noise. Therefore, selecting the optimal number of qubits remains a challenge. The goal is to develop a framework that tests a Variational Quantum Classifier (VQC) with a different numbers of qubits. For each configuration, the model’s prediction accuracy and the hardware resources it consumes (gate count and circuit depth) are evaluated. Using this data, the best qubit configuration that provides the optimal balance between accuracy and resource utilization can be identified. Experiments were conducted using the Wisconsin Breast Cancer dataset, where benign and malignant tumors are classified. The dataset was preprocessed by applying Principal Component Analysis (PCA) to reduce the feature space to a maximum of six principal components. A ZZFeatureMap was used to encode the reduced features, which were then processed by a VQC with a RealAmplitudes ansatz. The COBYLA optimizer was used to train the VQC, and the experiment was repeated using different numbers of qubits from 2 to 6. Quantum circuits were transpiled into realistic IBM fake backends (FakeManilaV2 and FakeJakartaV2) for hardware-aware analysis, obtaining two key metrics: CNOT gate count and circuit depth. An AerSimulator configured with the FakeManilaV2 noise model was used to carry out the noise-aware simulation. The framework was evaluated using classification accuracy, training time, circuit depth, CNOT gate count, and noise-aware accuracy. Based on these criteria, the optimal qubit configuration that balances predictive performance with quantum hardware resource utilization was identified. The results identify 2 qubits as the optimal “sweet spot,” achieving 83.21% accuracy under ideal simulation and 81.75% under noise-aware simulation while maintaining lower resource requirements. These findings provide practical guidelines for resource-efficient hybrid quantum machine learning on NISQ hardware.
Quantum machine learning (QML) represents a convergence of quantum computing and statistical learning theory with transformative potential for high-throughput computational materials discovery. This empirical study systematically benchmarks six QML architectures — quantum kernel support vector machines, variational quantum eigensolvers augmented by graph neural networks, quantum approximate optimization algorithm hybrids, quantum random forests, quantum Boltzmann machines, and parameterized quantum circuit-based neural networks — against their classical analogues across five material classes comprising perovskite oxides, battery cathode materials, two-dimensional semiconductor alloys, metal-organic frameworks, and high-entropy alloys. Using 14,720 DFT-computed property records drawn from the Materials Project and AFLOW databases as the common evaluation corpus, the QML methods achieved mean absolute error reductions of 38–61% and training time compressions of 29–61% relative to equivalent classical estimators at equivalent dataset sizes. The quantum random forest architecture exhibited the strongest overall performance (MAE = 0.026 eV; R² = 0.978), while hardware-native implementations on IBM Quantum Eagle and IonQ Forte achieved practical speed-ups of 28x–41x over CPU-based baselines. Barren plateau pathology and noise-induced gradient suppression remained the principal barriers to scaling beyond 50 qubits on current NISQ hardware. The empirical results of this study established principal conclusions that advance the theoretical and practical understanding of QML in materials discovery contexts. These findings provide grounding for deploying QML in production materials informatics pipelines.
The encoding of classical data into quantum states constitutes the primary performance bottleneck in Quantum Machine Learning (qml) on Noisy Intermediate-Scale Quantum (nisq) devices. No existing framework jointly characterises resource cost, expressivity, and noise robustness, nor provides actionable selection guidelines for practitioners. This survey addresses that gap through a systematic review of 66 primary works (2017-2026) assembled via a PRISMA-adapted protocol across five academic databases. Four principal contributions are made. First, a three-axis cost-expressivity-robustness taxonomy classifies all major encoding families - basis, angle, dense-angle, amplitude, data re-uploading, and IQP - along independently measurable axes. Second, closed-form depth-fidelity bounds under nisq decoherence channels identify the critical gate-error rate p* ~ 10^-3 below which amplitude encoding is viable. Third, a unified treatment of Fourier expressivity, barren-plateau onset, and quantum kernel concentration as functions of the encoding circuit provides the first joint trainability analysis. Fourth, a five-regime decision framework maps (D, n, p, tau) - feature dimension, qubit budget, error rate, and task type - to a hardware-grounded encoding recommendation. The central finding is that for p >= 10^-3, shallow angle-based encodings consistently outperform amplitude encoding in practice, despite the latter's exponential qubit advantage.
Clustering on NISQ hardware is constrained by data loading and limited qubits. We present \textbf{qc-kmeans}, a hybrid compressive kkk-means that summarizes a dataset with a constant-size Fourier-feature sketch and selects centroids by solving small per-group QUBOs with shallow QAOA circuits. The QFF sketch estimator is unbiased with mean-squared error O(ε2)O(\varepsilon^2)O(ε2) for B,S=Θ(ε−2)B,S=Θ(\varepsilon^{-2})B,S=Θ(ε−2), and the peak-qubit requirement qpeak=max⁡{D,⌈log⁡2B⌉+1}q_{\text{peak}}=\max\{D,\lceil \log_2 B\rceil + 1\}qpeak​=max{D,⌈log2​B⌉+1} does not scale with the number of samples. A refinement step with elitist retention ensures non-increasing surrogate cost. In Qiskit Aer simulations (depth p=1p{=}1p=1), the method ran with ≤9\le 9≤9 qubits on low-dimensional synthetic benchmarks and achieved competitive sum-of-squared errors relative to quantum baselines; runtimes are not directly comparable. On nine real datasets (up to 4.3×1054.3\times 10^54.3×105 points), the pipeline maintained constant peak-qubit usage in simulation. Under IBM noise models, accuracy was similar to the idealized setting. Overall, qc-kmeans offers a NISQ-oriented formulation with shallow, bounded-width circuits and competitive clustering quality in simulation.
This review synthesizes state-of-the-art quantum machine learning (QML) techniques for molecular modeling, focusing on strategies designed to overcome the limitations of Noisy Intermediate-Scale Quantum (NISQ) hardware. A central challenge is the encoding of high-dimensional chemical data, including fingerprints, graphs, and 3D geometries, onto low-qubit devices. The survey covers several key approaches, including the radical compression of molecular fingerprints for discriminative classifiers; hybrid generative models that embed quantum circuits within classical graph-based frameworks; iterative encoding of local atomic neighborhoods to process molecules of any size with fixed-size circuits; and the use of quantum annealers to sample from energy-based models by reformulating them as quadratic unconstrained binary optimization (QUBO) problems. This review categorizes these distinct methods, illuminates the common principles of hybrid design, and identifies key bottlenecks.