Mathematics

Quantum Computing for Dealing with Inaccurate Knowledge Related to the Certainty Factors Model

Vicente Moret‐Bonillo, Samuel Magaz-Romero, Eduardo Mosqueira-Rey

Published Jan 8, 2022• 4 citations

Abstract

In this paper, we illustrate that inaccurate knowledge can be efficiently implemented in a quantum environment. For this purpose, we analyse the correlation between certainty factors and quantum probability. We first explore the certainty factors approach for inexact reasoning from a classical point of view. Next, we introduce some basic aspects of quantum computing, and we pay special attention to quantum rule-based systems. In this context, a specific use case was built: an inferential network for testing the behaviour of the certainty factors approach in a quantum environment. After the design and execution of the experiments, the corresponding analysis of the obtained results was performed in three different scenarios: (1) inaccuracy in declarative knowledge, or imprecision, (2) inaccuracy in procedural knowledge, or uncertainty, and (3) inaccuracy in both declarative and procedural knowledge. This paper, as stated in the conclusions, is intended to pave the way for future quantum implementations of well-established methods for handling inaccurate knowledge.

DOI: 10.3390/math10020189

Related papers

Uncertainty in Quantum Rule-Based Systems

Vicente Moret-Bonillo, Isaac Fernández-Varela, Diego Álvarez-Estévez

This article deals with the problem of the uncertainty in rule-based systems (RBS), but from the perspective of quantum computing (QC). In this work we first remember the characteristics of Quantum Rule-Based Systems (QRBS), a concept defined in a previous article by one of the authors of this paper, and we introduce the problem of quantum uncertainty. We assume that the subjective uncertainty that affects the facts of classical RBSs can be treated as a direct consequence of the probabilistic nature of quantum mechanics (QM), and we also assume that the uncertainty associated with a given hypothesis is a consequence of the propagation of the imprecision through the inferential circuits of RBSs. This article does not intend to contribute anything new to the QM field: it is a work of artificial intelligence (AI) that uses QC techniques to solve the problem of uncertainty in RBSs. Bearing the above arguments in mind a quantum model is proposed. This model has been applied to a problem already defined by one of the authors of this work in a previous publication and which is briefly described in this article. Then the model is generalized, and it is thoroughly evaluated. The results obtained show that QC is a valid, effective and efficient method to deal with the inherent uncertainty of RBSs.

arXiv:1811.02782Archives of Clinical and Biomedical ResearchJan 1, 20215 citations

Classical Knowledge for Quantum Security

Ellie D’Hondt, Mehrnoosh Sadrzadeh

We propose a decision procedure for analysing security of quantum cryptographic protocols, combining a classical algebraic rewrite system for knowledge with an operational semantics for quantum distributed computing. As a test case, we use our procedure to reason about security properties of a recently developed quantum secret sharing protocol that uses graph states. We analyze three different scenarios based on the safety assumptions of the classical and quantum channels and discover the path of an attack in the presence of an adversary. The epistemic analysis that leads to this and similar types of attacks is purely based on our classical notion of knowledge.

Aug 26, 20081 citation

Exploring Imprecise Probabilities in Quantum Algorithms with Possibility Theory

Jan Schneider, Tom Könecke, Michael Hanss

ABSTRACT Quantum computing utilizes the underlying principles of quantum mechanics to perform computations with unmatched performance capabilities. Rather than using classical bits, it operates on qubits, which can exist in superposition and entangled states. This enables the solution of problems that are considered intractable for classical computers. However, since qubits are realized by physical systems such as the spins of electrons, they are highly sensitive to environmental disturbances and hardware imperfections. To achieve reliable scaling and practical application in the future, addressing these errors is of utmost importance. Different classes of errors exist, such as coherent and incoherent errors, caused by imperfections in quantum operations or the decoherence of quantum states. They are inherently different, as they arise from either a lack of precision or intrinsic randomness. Current literature struggles to provide a unified framework that models both types of errors simultaneously. In this paper, an approach based on possibility theory—a theory of imprecise probabilities—is presented to model quantum uncertainty. Possibility theory is particularly useful for systems affected by both epistemic and aleatoric uncertainty, that is, uncertainty due to limited knowledge and uncertainty due to inherent randomness, respectively. By exploring noisy quantum algorithms within a possibilistic framework, different statements about robustness can be derived without requiring prior assumptions about the underlying noise model. Moreover, a possibilistic model enables the derivation of sampling criteria for guaranteed statistical performance and provides insight into the number of measurements required—an important consideration, given that such resources are costly in practice.

PAMMJan 28, 20261 citation

Classical Knowledge for Quantum Security

D'Hondt, Ellie, Mehrnoosh Sadrzadeh

arXiv:0808.3574Aug 26, 20080 citations

Quantum computing and probability

David K. Ferry

Over the past two decades, quantum computing has become a popular and promising approach to trying to solve computationally difficult problems. Missing in many descriptions of quantum computing is just how probability enters into the process. Here, we discuss some simple examples of how uncertainty and probability enter, and how this and the ideas of quantum computing challenge our interpretations of quantum mechanics. It is found that this uncertainty can lead to intrinsic decoherence, and this raises challenges for error correction.

Journal of Physics Condensed MatterNov 5, 20098 citations

Quantum Computing Probabilistic Modeling Validation

Jincheng Zhang

Quantum computing promises revolutionary advancements across numerous fields, demanding rigorous validation of computational algorithms and models. This paper presents a novel probabilistic modeling framework for quantum computing, designed to provide a robust and verifiable approach to assessing the accuracy of quantum algorithms and their potential for practical applications. The core of this framework leverages the power of quantum simulation to dynamically explore parameter space, effectively validating the model's ability to faithfully replicate quantum system behavior. We argue that this approach overcomes limitations of traditional validation methods, offering a more precise and dependable method for confirming quantum system fidelity.

Sep 6, 20260 citations