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

Q-SHAP: Explainable AI for Quantum Circuits via Quantum-Native and Hybrid Classical Approaches

Abraham Itzhak Weinberg

Published Jan 1, 2026• 0 citations
Publisher
DOI
10.2139/ssrn.6204319

Related papers

Towards Explainable Quantum Machine Learning: A Hybrid Quantum SHAP-based Framework

M. Ramu, Donapati Deepika, Nikhila Baddula +3 more

Quantum machine learning is becoming popular as a method to enhance computational intelligence using concepts of quantum mechanics. However, quantum models tend to be complex and probabilistic, making them difficult to interpret and limiting their application in real-world scenarios where transparent decision-making is important. This work introduces a quantum-aware feature attribution framework that combines hybrid quantum-classical models with Quantum SHAP-based explainability. The proposed methodology enables prediction interpretation by analyzing the sensitivity of classical input features within quantum circuits. Experiments conducted on benchmark datasets demonstrate that the proposed method achieves competitive predictive performance while improving the stability and consistency of explanations. The framework also provides better understanding of feature contributions even in the presence of quantum noise. Overall, the findings indicate that explainability methods can improve transparency and trust in quantum machine learning models. This work contributes toward the development of more reliable and interpretable quantum-based learning systems by bridging quantum computing and explainable artificial intelligence.

International Conference on Computing Methodologies and Communication (ICCMC)•Jul 1, 2026•0 citations

Novel Quantum-Classical Hybrid Circuits for Adaptive Hardware-Based Machine Learning

Shyam R. Sihare, Aswani Kumar Cherukuri

SN Computer Science•Jul 14, 2026•1 citation

A Novel Approach to Explainable AI with Quantized Active Ingredients in Decision Making

A. M. A. S. D. Alagiyawanna, Asoka Karunananda, Thushari Silva +1 more

Artificial Intelligence (AI) systems have shown good success at classifying. However, the lack of explainability is a true and significant challenge, especially in high-stakes domains, such as health and finance, where understanding is paramount. We propose a new solution to this challenge: an explainable AI framework based on our comparative study with Quantum Boltzmann Machines (QBMs) and Classical Boltzmann Machines (CBMs). We leverage principles of quantum computing within classical machine learning to provide substantive transparency around decision-making. The design involves training both models on a binarised and dimensionally reduced MNIST dataset, where Principal Component Analysis (PCA) is applied for preprocessing. For interpretability, we employ gradient-based saliency maps in QBMs and SHAP (SHapley Additive exPlanations) in CBMs to evaluate feature attributions.QBMs deploy hybrid quantum-classical circuits with strongly entangling layers, allowing for richer latent representations, whereas CBMs serve as a classical baseline that utilises contrastive divergence. Along the way, we found that QBMs outperformed CBMs on classification accuracy (83.5% vs. 54%) and had more concentrated distributions in feature attributions as quantified by entropy (1.27 vs. 1.39). In other words, QBMs not only produced better predictive performance than CBMs, but they also provided clearer identification of "active ingredient" or the most important features behind model predictions. To conclude, our results illustrate that quantum-classical hybrid models can display improvements in both accuracy and interpretability, which leads us toward more trustworthy and explainable AI systems.

cs.LGCross-listedarXiv:2601.08733•SLAAI International Conference on Artificial Intelligence (SLAAI-ICAI)•Jan 14, 2026•0 citations

Hybrid Quantum–Classical Algorithms to Accelerate AI

Bhavya M. Patel

•Jan 1, 2025•0 citations

eXplainable AI for Quantum Machine Learning

Patrick Steinmüller, Schulz, Tobias, Ferdinand Graf +1 more

Parametrized Quantum Circuits (PQCs) enable a novel method for machine learning (ML). However, from a computational point of view they present a challenge to existing eXplainable AI (xAI) methods. On the one hand, measurements on quantum circuits introduce probabilistic errors which impact the convergence of these methods. On the other hand, the phase space of a quantum circuit expands exponentially with the number of qubits, complicating efforts to execute xAI methods in polynomial time. In this paper we will discuss the performance of established xAI methods, such as Baseline SHAP and Integrated Gradients. Using the internal mechanics of PQCs we study ways to speed up their computation.

arXiv:2211.01441•Nov 2, 2022•29 citations

Q-XAI: Towards Explainable Quantum Neural Networks for Human-Centered Intelligence

Richard Jiang, Yijie Zhu, Plamen Parvanov Angelov +2 more

Communications in computer and information science•Jan 1, 2026•0 citations
Quantum machine learning is becoming popular as a method to enhance computational intelligence using concepts of quantum mechanics. However, quantum models tend to be complex and probabilistic, making them difficult to interpret and limiting their application in real-world scenarios where transparent decision-making is important. This work introduces a quantum-aware feature attribution framework that combines hybrid quantum-classical models with Quantum SHAP-based explainability. The proposed methodology enables prediction interpretation by analyzing the sensitivity of classical input features within quantum circuits. Experiments conducted on benchmark datasets demonstrate that the proposed method achieves competitive predictive performance while improving the stability and consistency of explanations. The framework also provides better understanding of feature contributions even in the presence of quantum noise. Overall, the findings indicate that explainability methods can improve transparency and trust in quantum machine learning models. This work contributes toward the development of more reliable and interpretable quantum-based learning systems by bridging quantum computing and explainable artificial intelligence.
Artificial Intelligence (AI) systems have shown good success at classifying. However, the lack of explainability is a true and significant challenge, especially in high-stakes domains, such as health and finance, where understanding is paramount. We propose a new solution to this challenge: an explainable AI framework based on our comparative study with Quantum Boltzmann Machines (QBMs) and Classical Boltzmann Machines (CBMs). We leverage principles of quantum computing within classical machine learning to provide substantive transparency around decision-making. The design involves training both models on a binarised and dimensionally reduced MNIST dataset, where Principal Component Analysis (PCA) is applied for preprocessing. For interpretability, we employ gradient-based saliency maps in QBMs and SHAP (SHapley Additive exPlanations) in CBMs to evaluate feature attributions.QBMs deploy hybrid quantum-classical circuits with strongly entangling layers, allowing for richer latent representations, whereas CBMs serve as a classical baseline that utilises contrastive divergence. Along the way, we found that QBMs outperformed CBMs on classification accuracy (83.5% vs. 54%) and had more concentrated distributions in feature attributions as quantified by entropy (1.27 vs. 1.39). In other words, QBMs not only produced better predictive performance than CBMs, but they also provided clearer identification of "active ingredient" or the most important features behind model predictions. To conclude, our results illustrate that quantum-classical hybrid models can display improvements in both accuracy and interpretability, which leads us toward more trustworthy and explainable AI systems.
Parametrized Quantum Circuits (PQCs) enable a novel method for machine learning (ML). However, from a computational point of view they present a challenge to existing eXplainable AI (xAI) methods. On the one hand, measurements on quantum circuits introduce probabilistic errors which impact the convergence of these methods. On the other hand, the phase space of a quantum circuit expands exponentially with the number of qubits, complicating efforts to execute xAI methods in polynomial time. In this paper we will discuss the performance of established xAI methods, such as Baseline SHAP and Integrated Gradients. Using the internal mechanics of PQCs we study ways to speed up their computation.