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:2410.08949

Quantum Information Fusion and Correction under the Transferable Belief Model

Qianli Zhou, Hao Luo, Lipeng Pan, Yong Deng, Éloi Bossé

Published Oct 11, 2024• 2 citations
arXivHTMLPDF

Abstract

The transferable belief model (TBM), developed within Dempster-Shafer theory, represents ambiguity and partial ignorance through set-valued belief masses. Its classical operations, however, can grow combinatorially over the power set. We formulate TBM reasoning on quantum circuits using the mass function quantum state (MFQS). The resulting framework covers belief representation, credal-level fusion and correction, product-space operations, and the generalized Bayesian theorem. For prepared MFQS inputs, CCR and the entire $α$-junction use element-wise gate modules whose logical counts are linear in the number of frame elements. These circuits avoid explicit operation-stage updates over all $2^n$ focal-set coordinates. A noisy multi-domain classifier-fusion example further demonstrates interpretable source fusion and improved robustness to gate-control noise. The results establish Dempster-Shafer structures as a semantic layer for quantum information processing beyond singleton-probability representations.

DOI
10.48550/arxiv.2410.08949

Related papers

Uncertainty-aware quantum machine learning based on Dempster-Shafer theory

Marie Kempkes, Jakob Spiegelberg, Evert van Nieuwenburg +1 more

A large body of work in quantum machine learning has centered on characterizing the expressivity and performance of quantum models. In contrast, little attention has been paid to the reliability of predictions beyond average performance measures such as accuracy. In this work, we introduce an uncertainty-aware quantum classification framework based on Dempster-Shafer theory. This theory allows to express uncertainty through weights assigned not only to individual classification labels but to sets of labels. We introduce a training strategy that enables parameterized quantum circuits to learn such assignments directly from data. This provides an efficient way to prepare the corresponding quantum states and enables the application of different post-processing strategies. In particular, it offers a practical setting for quantum Dempster-Shafer fusion procedures with polynomial resource requirements, even when the corresponding mass functions are defined over exponentially many subsets. Overall, our work represents a step toward enabling quantum models to express uncertainty about their predictions, thereby extending the evaluation of quantum models beyond predictive performance alone.

arXiv:2611.16903•Nov 12, 2026•0 citations

Quantum belief function.

Qianli Zhou, Guojing Tian, Yong Deng

The belief function in Dempster Shafer evidence theory can express more information than the traditional Bayesian distribution. It is widely used in approximate reasoning, decision-making and information fusion. However, its power exponential explosion characteristics leads to the extremely high computational complexity when handling large amounts of elements in classic computers. In order to solve the problem, we encode the basic belief assignment (BBA) into quantum states, which makes each qubit correspond to control an element. Besides the high efficiency, this quantum expression is very conducive to measure the similarity between two BBAs, and the measuring quantum algorithm we come up with has exponential acceleration theoretically compared to the corresponding classical algorithm. In addition, we simulate our quantum version of BBA on Qiskit platform, which ensures the rationality of our algorithm experimentally. We believe our results will shed some light on utilizing the characteristic of quantum computation to handle belief function more conveniently.

•Jul 8, 2021•1 citation

Operator sum representation for Markov transition models of human inference processes

Jiwoong Lee, Shashi Phoha

The standard Bayesian framework does not account for the decision maker's errors, such as the conjunction and disjunction fallacies, in updating the belief state upon measuring the uncertain quantities. Moreover, the classical probability theory does not distinguish a mixed state (e.g., being of two minds) from a superposed state (e.g., being of neutral mind). The operator sum representation of completely positive linear maps can address these limitations in a unified manner, and allows for numerical determination of a general belief-state update rule. In particular, examples show that the operator sum approach yields an improvement over the existing quantum model of human inference, and that it can be used to explain the mixing and superposition effects of gossip interactions.

Proceedings of the ... American Control Conference/Proceedings of the American Control Conference•Jul 1, 2016•1 citation

FQXAI: A Semantic and Circuit-Level Explainability Framework for Hybrid Quantum-Classical Medical Learning

Ankit Raj, Pramod Parashar, Subramanian Ramalingam

Abstract Recent studies have reported competitive predictive performance from hybrid quantum--classical learning models across biomedical and healthcare tasks, motivating growing interest in Quantum Machine Learning (QML) for medical data. However, predictive performance does not explain how quantum models arrive at their decisions. The combination of learned representations, parameterized quantum circuits, entangling operations, and noise introduce immense challenge for obtaining human-interpretable and circuit-level explanations. We present \textbf{FQXAI}, a unified semantic and circuit level explainability framework for hybrid quantum--classical medical learning. FQXAI transforms heterogeneous biomedical inputs into an eight-dimensional proxy supervised semantic concept space, mapping these representations into differentiable Gaussian fuzzy linguistic states, and generates model-level IF--THEN rationales. Exact Shapley values are computed over all $2^8=256$ semantic coalitions, enabling exhaustive attribution without Monte Carlo sampling. At the circuit level, \textbf{SVQX} quantifies the contributions of CNOT operations under controlled depolarizing noise and identifies negatively contributing gates as pruning candidates. A Jacobian-based projection further transfers semantic attributions to the original ECG and imaging domains. Experiments on MIT-BIH Arrhythmia, PneumoniaMNIST, and PathMNIST demonstrate the framework across temporal, radiological, and histopathological modalities. The models achieved accuracies of 0.890, 0.768, and 0.726, while exact FQ-SHAP achieved AUDC values of 0.780, 0.786, and 0.423, respectively. Under 5\% simulated depolarizing noise, SVQX-guided pruning reduced CNOT counts from 14 to 11, 12, and 10, with corresponding accuracy increases of 2.20, 1.74, and 1.51 percentage points. These results demonstrate the feasibility and efficacy of coupling semantic explanations with noise-aware circuit analysis for auditable hybrid quantum medical learning.

•Nov 10, 2026•0 citations

Quantum circuits and parallelism

Pawan Kumar Verma, Mohit Kumar, Saurabh Singhal +1 more

This chapter develops the quantum circuit model as the operational core of gate-based quantum computation, framing circuits as structured compositions of unitary transformations acting on qubits and quantum registers. It begins by formalizing qubits as normalized state vectors in Hilbert space and extends to multi-qubit registers via tensor products, emphasizing the exponential growth of representable basis amplitudes and the resulting capacity for entanglement. Building on these foundations, this chapter details circuit design as an algorithm-engineering discipline that must balance mathematical correctness with resource efficiency under hardware and noise constraints, including circuit depth, gate count, qubit connectivity, control bandwidth, and crosstalk. Circuit construction is presented through sequential composition and parallel execution on disjoint qubit subsets, motivating scheduling methods such as dependency-graph analysis, critical-path identification, and time-slice (layer) formation under platform-imposed concurrency limits. This chapter then addresses quantum circuit decomposition as the bridge from abstract algorithmic operators to implementable gate sets, highlighting universal synthesis principles (including Solovay–Kitaev guarantees) and standard decompositions for single-qubit unitaries (Euler-angle forms) and controlled multi-qubit operations. Finally, quantum parallelism is treated as a distinctly quantum computational resource arising from superposition over 2.

CRC Press eBooks•Nov 6, 2026•0 citations

Efficient quantum circuit simulation.

John P. Hayes, Igor L. Markov, George F. Viamontes

Quantum-mechanical phenomena are playing an increasing role in information processing as transistor sizes approach the nanometer level, while the securest forms of communication rely on quantum data encoding. When they involve a finite number of basis states, these phenomena can be modeled as quantum circuits, the quantum analogue of conventional or classical logic circuits. Simulation of quantum circuits can therefore be used as a tool to evaluate issues in the design of quantum information processors. Unfortunately, simulating such phenomena efficiently is exceedingly difficult. The matrices representing quantum operators (gates) and vectors modeling quantum states grow exponentially with the number of quantum bits. The information represented by quantum states and operators often exhibits structure that can be exploited when simulating certain classes of quantum circuits. We study the development of simulation methods that run on classical computers and take advantage of such repetitions and redundancies. In particular, we define a new data structure for simulating quantum circuits called the quantum information decision diagram (QuIDD). A QuIDD is a compressed graph representation of a vector or matrix and permits computations to be performed directly on the compressed data. We develop a comprehensive set of algorithms for operating on QuIDDs in both the state-vector and density-matrix formats, and evaluate their complexity. These algorithms have been implemented in a general-purpose simulator program for quantum-mechanical applications called QuIDDPro. Through extensive experiments conducted on representative quantum simulation applications, including Grover's search algorithm, error characterization, and reversible circuits, we demonstrate that QuIDDPro is faster than other existing quantum-mechanical simulators such as the National Institute of Standards and Technology's QCSim program, and is far more memory-efficient. Using QuIDDPro, we explore the advantages of quantum computation over classical computation, simulate quantum errors and error correction, and study the impact of numerical precision on the fidelity of simulations. We also develop several novel algorithms for testing quantum circuit equivalence and compare them empirically. The QuIDDPro software is equipped with a user-friendly interface and is distributed with numerous example scripts. It has been used as a laboratory supplement for quantum computing courses at several universities.

•Jan 1, 2007•15 citations
The transferable belief model (TBM), developed within Dempster-Shafer theory, represents ambiguity and partial ignorance through set-valued belief masses. Its classical operations, however, can grow combinatorially over the power set. We formulate TBM reasoning on quantum circuits using the mass function quantum state (MFQS). The resulting framework covers belief representation, credal-level fusion and correction, product-space operations, and the generalized Bayesian theorem. For prepared MFQS inputs, CCR and the entire ααα-junction use element-wise gate modules whose logical counts are linear in the number of frame elements. These circuits avoid explicit operation-stage updates over all 2n2^n2n focal-set coordinates. A noisy multi-domain classifier-fusion example further demonstrates interpretable source fusion and improved robustness to gate-control noise. The results establish Dempster-Shafer structures as a semantic layer for quantum information processing beyond singleton-probability representations.
A large body of work in quantum machine learning has centered on characterizing the expressivity and performance of quantum models. In contrast, little attention has been paid to the reliability of predictions beyond average performance measures such as accuracy. In this work, we introduce an uncertainty-aware quantum classification framework based on Dempster-Shafer theory. This theory allows to express uncertainty through weights assigned not only to individual classification labels but to sets of labels. We introduce a training strategy that enables parameterized quantum circuits to learn such assignments directly from data. This provides an efficient way to prepare the corresponding quantum states and enables the application of different post-processing strategies. In particular, it offers a practical setting for quantum Dempster-Shafer fusion procedures with polynomial resource requirements, even when the corresponding mass functions are defined over exponentially many subsets. Overall, our work represents a step toward enabling quantum models to express uncertainty about their predictions, thereby extending the evaluation of quantum models beyond predictive performance alone.
The belief function in Dempster Shafer evidence theory can express more information than the traditional Bayesian distribution. It is widely used in approximate reasoning, decision-making and information fusion. However, its power exponential explosion characteristics leads to the extremely high computational complexity when handling large amounts of elements in classic computers. In order to solve the problem, we encode the basic belief assignment (BBA) into quantum states, which makes each qubit correspond to control an element. Besides the high efficiency, this quantum expression is very conducive to measure the similarity between two BBAs, and the measuring quantum algorithm we come up with has exponential acceleration theoretically compared to the corresponding classical algorithm. In addition, we simulate our quantum version of BBA on Qiskit platform, which ensures the rationality of our algorithm experimentally. We believe our results will shed some light on utilizing the characteristic of quantum computation to handle belief function more conveniently.
The standard Bayesian framework does not account for the decision maker's errors, such as the conjunction and disjunction fallacies, in updating the belief state upon measuring the uncertain quantities. Moreover, the classical probability theory does not distinguish a mixed state (e.g., being of two minds) from a superposed state (e.g., being of neutral mind). The operator sum representation of completely positive linear maps can address these limitations in a unified manner, and allows for numerical determination of a general belief-state update rule. In particular, examples show that the operator sum approach yields an improvement over the existing quantum model of human inference, and that it can be used to explain the mixing and superposition effects of gossip interactions.
Abstract Recent studies have reported competitive predictive performance from hybrid quantum--classical learning models across biomedical and healthcare tasks, motivating growing interest in Quantum Machine Learning (QML) for medical data. However, predictive performance does not explain how quantum models arrive at their decisions. The combination of learned representations, parameterized quantum circuits, entangling operations, and noise introduce immense challenge for obtaining human-interpretable and circuit-level explanations. We present \textbf{FQXAI}, a unified semantic and circuit level explainability framework for hybrid quantum--classical medical learning. FQXAI transforms heterogeneous biomedical inputs into an eight-dimensional proxy supervised semantic concept space, mapping these representations into differentiable Gaussian fuzzy linguistic states, and generates model-level IF--THEN rationales. Exact Shapley values are computed over all 28=2562^8=25628=256 semantic coalitions, enabling exhaustive attribution without Monte Carlo sampling. At the circuit level, \textbf{SVQX} quantifies the contributions of CNOT operations under controlled depolarizing noise and identifies negatively contributing gates as pruning candidates. A Jacobian-based projection further transfers semantic attributions to the original ECG and imaging domains. Experiments on MIT-BIH Arrhythmia, PneumoniaMNIST, and PathMNIST demonstrate the framework across temporal, radiological, and histopathological modalities. The models achieved accuracies of 0.890, 0.768, and 0.726, while exact FQ-SHAP achieved AUDC values of 0.780, 0.786, and 0.423, respectively. Under 5\% simulated depolarizing noise, SVQX-guided pruning reduced CNOT counts from 14 to 11, 12, and 10, with corresponding accuracy increases of 2.20, 1.74, and 1.51 percentage points. These results demonstrate the feasibility and efficacy of coupling semantic explanations with noise-aware circuit analysis for auditable hybrid quantum medical learning.
This chapter develops the quantum circuit model as the operational core of gate-based quantum computation, framing circuits as structured compositions of unitary transformations acting on qubits and quantum registers. It begins by formalizing qubits as normalized state vectors in Hilbert space and extends to multi-qubit registers via tensor products, emphasizing the exponential growth of representable basis amplitudes and the resulting capacity for entanglement. Building on these foundations, this chapter details circuit design as an algorithm-engineering discipline that must balance mathematical correctness with resource efficiency under hardware and noise constraints, including circuit depth, gate count, qubit connectivity, control bandwidth, and crosstalk. Circuit construction is presented through sequential composition and parallel execution on disjoint qubit subsets, motivating scheduling methods such as dependency-graph analysis, critical-path identification, and time-slice (layer) formation under platform-imposed concurrency limits. This chapter then addresses quantum circuit decomposition as the bridge from abstract algorithmic operators to implementable gate sets, highlighting universal synthesis principles (including Solovay–Kitaev guarantees) and standard decompositions for single-qubit unitaries (Euler-angle forms) and controlled multi-qubit operations. Finally, quantum parallelism is treated as a distinctly quantum computational resource arising from superposition over 2.
Quantum-mechanical phenomena are playing an increasing role in information processing as transistor sizes approach the nanometer level, while the securest forms of communication rely on quantum data encoding. When they involve a finite number of basis states, these phenomena can be modeled as quantum circuits, the quantum analogue of conventional or classical logic circuits. Simulation of quantum circuits can therefore be used as a tool to evaluate issues in the design of quantum information processors. Unfortunately, simulating such phenomena efficiently is exceedingly difficult. The matrices representing quantum operators (gates) and vectors modeling quantum states grow exponentially with the number of quantum bits. The information represented by quantum states and operators often exhibits structure that can be exploited when simulating certain classes of quantum circuits. We study the development of simulation methods that run on classical computers and take advantage of such repetitions and redundancies. In particular, we define a new data structure for simulating quantum circuits called the quantum information decision diagram (QuIDD). A QuIDD is a compressed graph representation of a vector or matrix and permits computations to be performed directly on the compressed data. We develop a comprehensive set of algorithms for operating on QuIDDs in both the state-vector and density-matrix formats, and evaluate their complexity. These algorithms have been implemented in a general-purpose simulator program for quantum-mechanical applications called QuIDDPro. Through extensive experiments conducted on representative quantum simulation applications, including Grover's search algorithm, error characterization, and reversible circuits, we demonstrate that QuIDDPro is faster than other existing quantum-mechanical simulators such as the National Institute of Standards and Technology's QCSim program, and is far more memory-efficient. Using QuIDDPro, we explore the advantages of quantum computation over classical computation, simulate quantum errors and error correction, and study the impact of numerical precision on the fidelity of simulations. We also develop several novel algorithms for testing quantum circuit equivalence and compare them empirically. The QuIDDPro software is equipped with a user-friendly interface and is distributed with numerous example scripts. It has been used as a laboratory supplement for quantum computing courses at several universities.