We describe a quantum mechanics based logic programming language that supports Horn clauses, random variables, and covariance matrices to express and solve problems in probabilistic logic. The Horn clauses of the language wrap random variables, including infinite valued, to express probability distributions and statistical correlations, a powerful feature to capture relationship between distributions that are not independent. The expressive power of the language is based on a mechanism to implement statistical ensembles and to solve the underlying SAT instances using quantum mechanical machinery. We exploit the fact that classical random variables have quantum decompositions to build the Horn clauses. We establish the semantics of the language in a rigorous fashion by considering an existing probabilistic logic language called PRISM with classical probability measures defined on the Herbrand base and extending it to the quantum context. In the classical case H-interpretations form the sample space and probability measures defined on them lead to consistent definition of probabilities for well formed formulae. In the quantum counterpart, we define probability amplitudes on Hinterpretations facilitating the model generations and verifications via quantum mechanical superpositions and entanglements. We cast the well formed formulae of the language as quantum mechanical observables thus providing an elegant interpretation for their probabilities. We discuss several examples to combine statistical ensembles and predicates of first order logic to reason with situations involving uncertainty.
We describe a quantum mechanics based logic programming language that supports Horn clauses, random variables, and covariance matrices to express and solve problems in probabilistic logic. The Horn clauses of the language wrap random variables, including infinite valued, to express probability distributions and statistical correlations, a powerful feature to capture relationship between distributions that are not independent. The expressive power of the language is based on a mechanism to implement statistical ensembles and to solve the underlying SAT instances using quantum mechanical machinery. We exploit the fact that classical random variables have quantum decompositions to build the Horn clauses. We establish the semantics of the language in a rigorous fashion by considering an existing probabilistic logic language called PRISM with classical probability measures defined on the Herbrand base and extending it to the quantum context. In the classical case H-interpretations form the sample space and probability measures defined on them lead to consistent definition of probabilities for well formed formulae. In the quantum counterpart, we define probability amplitudes on Hinterpretations facilitating the model generations and verifications via quantum mechanical superpositions and entanglements. We cast the well formed formulae of the language as quantum mechanical observables thus providing an elegant interpretation for their probabilities. We discuss several examples to combine statistical ensembles and predicates of first order logic to reason with situations involving uncertainty.
In our previous work we described quantized computation using Horn clauses and based the semantics, dubbed as entanglement semantics as a generalization of denotational and distribution semantics, and founded it on quantum probability by exploiting the key insight classical random variables have quantum decompositions. Towards this end we built a Hilbert space of H-interpretations and a corresponding non commutative von Neumann algebra of bounded linear operators. In this work we extend the formalism using second-quantized Horn clauses that describe processes such as Heisenberg evolutions in optical circuits, quantum walks, and quantum filters in a formally verifiable way. Our goal is to build a model of computation based on logic via Currry-Howard correspondence. Towards this end we can think of completely positive *-unital maps of Horn clauses as function types representing modus ponens (equation (19)). Recursions that result from inductive reasoning has a quantum analogue in terms of sequence of *-homomorphisms induced by completely positive *-unital maps (equation (18)). We base our system on a measure theoretic approach to handle infinite dimensional systems and demonstrate the expressive power of the formalism by casting an algebra used to describe interconnected quantum systems (QNET) in this language. The variables of a Horn clause bounded by universal or existential quantifiers can be used to describe parameters of optical components such as beam splitter scattering paths, cavity detuning from resonance, strength of a laser beam, or input and output ports of these components. Prominent clauses in this non commutative framework are Weyl predicates, that are operators on a Boson Fock space in the language of quantum stochastic calculus, martingales and conjugate Brownian motions compactly representing statistics of quantum field fluctuations. We formulate theorem proving as a quantum stochastic process in Heisenberg picture of quantum mechanics, a sequence of goals to be proved, using backward chaining.
The aim of this paper is to present and discuss a probabilistic framework that is adequate for the formulation of quantum theory and faithful to its applications. Contrary to claims, which are examined and rebutted, that quantum theory employs a nonclassical probability theory based on a nonclassical “logic,” the probabilistic framework set out here is entirely classical and the “logic” used is Boolean. The framework consists of a set of states and a set of quantities that are interrelated in a specified manner. Each state induces a classical probability space on the values of each quantity. The quantities, so considered, become statistical variables (not random variables). Such variables need not have a “joint distribution.” For the quantum theoretic application, there is a uniform procedure that defines and determines the existence of such “joint distributions” for statistical variables. A general rule is provided and it is shown to lead to the usual compatibility-commutivity requirements of quantum theory. The paper concludes with a brief discussion of interference and the misunderstandings that are involved in the false move from interference to nonclassical probability.
The main contribution of the present paper is the introduction of a simple yet expressive hybrid-dynamic logic for describing quantum programs. This version of quantum logic can express quantum measurements and unitary evolutions of states in a natural way based on concepts advanced in (hybrid and dynamic) modal logics. We then study Horn clauses in the hybrid-dynamic quantum logic proposed, and develop a series of results that lead to an initial semantics theorem for sets of clauses that are satisfiable. This shows that a significant fragment of hybrid-dynamic quantum logic has good computational properties, and can serve as a basis for defining executable languages for specifying quantum programs. We set the foundations of logic programming in this fragment by proving a variant of Herbrand's theorem, which reduces the semantic entailment of a logic-programming query by a program to the search of a suitable substitution.
Quantum mechanics is basically a mathematical recipe on how to construct physical models. Historically its origin and main domain of application has been in the microscopic regime, although it strictly seen constitutes a general mathematical framework not limited to this regime. Since it is a statistical theory, the meaning and role of probabilities in it need to be defined and understood in order to gain an understanding of the predictions and validity of quantum mechanics. The interpretational problems of quantum mechanics are also connected with the interpretation of the concept of probability. In this thesis the use of probability theory as extended logic, in particular in the way it was presented by E. T. Jaynes, will be central. With this interpretation of probabilities they become a subjective notion, always dependent on one's state of knowledge or the context in which they are assigned, which has consequences on how things are to be viewed, understood and tackled in quantum mechanics. For instance, the statistical operator or density operator, is usually defined in terms of probabilities and therefore also needs to be updated when the probabilities are updated by acquisition of additional data. Furthermore, it is a context dependent notion, meaning, e.g., that two observers will in general assign different statistical operators to the same phenomenon, which is demonstrated in the papers of the thesis. It is also presented an alternative and conceptually clear approach to the problematic notion of "probabilities of probabilities", which is related to such things as probability distributions on statistical operators. In connection to this, we consider concrete numerical applications of Bayesian quantum state assignment methods to a three-level quantum system, where prior knowledge and various kinds of measurement data are encoded into a statistical operator, which can then be used for deriving probabilities of other measurements. The thesis also offers examples of an alternative quantum state assignment technique, using maximum entropy methods, which in some cases are compared with the Bayesian quantum state assignment methods. Finally, the interesting and important problem whether the statistical operator, or more generally quantum mechanics, gives a complete description of "objective physical reality" is considered. A related concern is here the possibility of finding a "local hidden-variable theory" underlying the quantum mechanical description. There have been attempts to prove that such a theory cannot be constructed, where the most well-known impossibility proof claiming to show this was given by J. S. Bell. In connection to this, the thesis presents an idea for an interpretation or alternative approach to quantum mechanics based on the concept of space-time.
This paper introduces a novel approach to uncertainty quantification (UQ) by drawing inspiration from quantum mechanics. Traditional UQ methods, particularly Monte Carlo simulations, often struggle with the curse of dimensionality, exhibiting diminishing returns as the number of variables increases. We propose a framework utilizing simulated quantum measurement processes to efficiently explore probability spaces, aiming for significant improvements in both speed and accuracy. The core concept involves translating probabilistic programming logic into a sequence of simulated quantum measurements, mimicking the principles of superposition and entanglement. This approach moves beyond the limitations of classical sampling techniques and potentially unlocks exponential speedups in complex system modeling. The presented methodology focuses on a new programming language and runtime designed specifically for this quantum-inspired probabilistic programming paradigm. We explore the theoretical underpinnings and outline the key components of this system, highlighting the advantages it offers over conventional UQ methods. The design prioritizes computational efficiency and scalability, crucial aspects for tackling real-world problems characterized by high-dimensional uncertainty. The ultimate goal is to develop a robust and practical tool for accurately assessing risk and making informed decisions in complex, uncertain environments.
Hoare logic provides a syntax-oriented method to reason about program correctness and has been proven effective in the verification of classical and probabilistic programs. Existing proposals for quantum Hoare logic either lack completeness or support only quantum variables, thus limiting their capability in practical use. In this article, we propose a quantum Hoare logic for a simple while language that involves both classical and quantum variables. Its soundness and relative completeness are proven for both partial and total correctness of quantum programs written in the language. Remarkably, with novel definitions of classical-quantum states and corresponding assertions, the logic system is quite simple and similar to the traditional Hoare logic for classical programs. Furthermore, to simplify reasoning in real applications, auxiliary proof rules are provided that support standard logical operation in the classical part of assertions and super-operator application in the quantum part. Finally, a series of practical quantum algorithms, in particular the whole algorithm of Shor’s factorisation, are formally verified to show the effectiveness of the logic.