Component Based Quantum Machine Learning Explainability

• URL: http://arxiv.org/abs/2506.12378v1
• Date: Sat, 14 Jun 2025 07:21:09 GMT
• Title: Component Based Quantum Machine Learning Explainability
• Authors: Barra White, Krishnendu Guha,
• Abstract summary: Explainable ML algorithms are designed to provide transparency and insight into their decision-making process.<n>This paper will explore the idea of creating modular, explainable QML framework that splits QML algorithms into their core components.<n>Each component will be analyzed using explainability techniques, such as ALE and SHAP, which have been adapted to analyse the different components of these QML algorithms.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Explainable ML algorithms are designed to provide transparency and insight into their decision-making process. Explaining how ML models come to their prediction is critical in fields such as healthcare and finance, as it provides insight into how models can help detect bias in predictions and help comply with GDPR compliance in these fields. QML leverages quantum phenomena such as entanglement and superposition, offering the potential for computational speedup and greater insights compared to classical ML. However, QML models also inherit the black-box nature of their classical counterparts, requiring the development of explainability techniques to be applied to these QML models to help understand why and how a particular output was generated. This paper will explore the idea of creating a modular, explainable QML framework that splits QML algorithms into their core components, such as feature maps, variational circuits (ansatz), optimizers, kernels, and quantum-classical loops. Each component will be analyzed using explainability techniques, such as ALE and SHAP, which have been adapted to analyse the different components of these QML algorithms. By combining insights from these parts, the paper aims to infer explainability to the overall QML model.

Related papers

• Discrete Tokenization for Multimodal LLMs: A Comprehensive Survey [69.45421620616486]
  This work presents the first structured taxonomy and analysis of discrete tokenization methods designed for large language models (LLMs)<n>We categorize 8 representative VQ variants that span classical and modern paradigms and analyze their algorithmic principles, training dynamics, and integration challenges with LLM pipelines.<n>We identify key challenges including codebook collapse, unstable gradient estimation, and modality-specific encoding constraints.
  arXiv  Detail & Related papers  (2025-07-21T10:52:14Z)
• MAPS: Advancing Multi-Modal Reasoning in Expert-Level Physical Science [62.96434290874878]
  Current Multi-Modal Large Language Models (MLLM) have shown strong capabilities in general visual reasoning tasks.<n>We develop a new framework, named Multi-Modal Scientific Reasoning with Physics Perception and Simulation (MAPS) based on an MLLM.<n>MAPS decomposes expert-level multi-modal reasoning task into physical diagram understanding via a Physical Perception Model (PPM) and reasoning with physical knowledge via a simulator.
  arXiv  Detail & Related papers  (2025-01-18T13:54:00Z)
• Quantum Machine Learning in Log-based Anomaly Detection: Challenges and Opportunities [36.437593835024394]
  We introduce a unified framework, ourframework, for evaluating QML models in the context of LogAD.<n>State-of-the-art methods such as DeepLog, LogAnomaly, and LogRobust are included in our framework.<n>Our evaluation extends to factors critical to QML performance, such as specificity, the number of circuits, circuit design, and quantum state encoding.
  arXiv  Detail & Related papers  (2024-12-18T06:13:49Z)
• Problem-informed Graphical Quantum Generative Learning [0.3914676152740143]
  We propose a problem-informed quantum circuit Born machine Ansatz for learning the joint probability distribution of random variables.<n>We compare our model's performance to previous designs, showing that it outperforms problem-agnostic circuits.
  arXiv  Detail & Related papers  (2024-05-23T00:29:35Z)
• Feature Importance and Explainability in Quantum Machine Learning [0.0]
  Many Machine Learning (ML) models are referred to as black box models, providing no real insights into why a prediction is made. This article explores feature importance and explainability in Quantum Machine Learning (QML) compared to Classical ML models.
  arXiv  Detail & Related papers  (2024-05-14T19:12:32Z)
• A Mechanistic Interpretation of Arithmetic Reasoning in Language Models using Causal Mediation Analysis [128.0532113800092]
  We present a mechanistic interpretation of Transformer-based LMs on arithmetic questions. This provides insights into how information related to arithmetic is processed by LMs.
  arXiv  Detail & Related papers  (2023-05-24T11:43:47Z)
• Pre-training Tensor-Train Networks Facilitates Machine Learning with Variational Quantum Circuits [70.97518416003358]
  Variational quantum circuits (VQCs) hold promise for quantum machine learning on noisy intermediate-scale quantum (NISQ) devices. While tensor-train networks (TTNs) can enhance VQC representation and generalization, the resulting hybrid model, TTN-VQC, faces optimization challenges due to the Polyak-Lojasiewicz (PL) condition. To mitigate this challenge, we introduce Pre+TTN-VQC, a pre-trained TTN model combined with a VQC.
  arXiv  Detail & Related papers  (2023-05-18T03:08:18Z)
• Reflection Equivariant Quantum Neural Networks for Enhanced Image Classification [0.7232471205719458]
  We build new machine learning models which explicitly respect the symmetries inherent in their data, so-called geometric quantum machine learning (GQML) We find that these networks are capable of consistently and significantly outperforming generic ansatze on complicated real-world image datasets.
  arXiv  Detail & Related papers  (2022-12-01T04:10:26Z)
• A didactic approach to quantum machine learning with a single qubit [68.8204255655161]
  We focus on the case of learning with a single qubit, using data re-uploading techniques. We implement the different proposed formulations in toy and real-world datasets using the qiskit quantum computing SDK.
  arXiv  Detail & Related papers  (2022-11-23T18:25:32Z)
• Theory of Quantum Generative Learning Models with Maximum Mean Discrepancy [67.02951777522547]
  We study learnability of quantum circuit Born machines (QCBMs) and quantum generative adversarial networks (QGANs) We first analyze the generalization ability of QCBMs and identify their superiorities when the quantum devices can directly access the target distribution. Next, we prove how the generalization error bound of QGANs depends on the employed Ansatz, the number of qudits, and input states.
  arXiv  Detail & Related papers  (2022-05-10T08:05:59Z)
• Quantum Approximate Optimization Algorithm Based Maximum Likelihood Detection [80.28858481461418]
  Recent advances in quantum technologies pave the way for noisy intermediate-scale quantum (NISQ) devices. Recent advances in quantum technologies pave the way for noisy intermediate-scale quantum (NISQ) devices.
  arXiv  Detail & Related papers  (2021-07-11T10:56:24Z)
• Structural risk minimization for quantum linear classifiers [0.0]
  Quantum machine learning (QML) stands out as one of the typically highlighted candidates for quantum computing's near-term "killer application" We investigate capacity measures of two closely related QML models called explicit and implicit quantum linear classifiers. We identify that the rank and Frobenius norm of the observables used in the QML model closely control the model's capacity.
  arXiv  Detail & Related papers  (2021-05-12T10:39:55Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.