A quantum algorithm for uniform sampling of models of propositional logic based on quantum probability. (January 2019)

• Record Type: Journal Article
• Authors: Balu, Radhakrishnan; Shires, Dale; Namburu, Raju
• Other Names: Grimaila Michael R guest-editor.
• Is Part Of: Journal of defense modeling and simulation. Volume 16:Number 1(2019:Jan.)
• Page Start: 57
• Page End: 65
• Publication Date: 2019-01
• Subjects: Military art and science -- Computer simulation -- Periodicals; 355.0011305
• DOI: 10.1177/1548512916648232
• Languages: English
• ISSNs: 1548-5129

Abstract

We describe a class of quantum algorithms to generate models of propositional logic with equal probability. We consider quantum stochastic flows that are the quantum analogues of classical Markov chains and establish a relation between fixed points on the two flows. We construct chains inspired by von Neumann algorithms using uniform measures as fixed points to construct the corresponding irreversible quantum stochastic flows. We formulate sampling models of propositions in the framework of adiabatic quantum computing and solve the underlying satisfiability instances. Satisfiability formulation is an important and successful technique in modeling the decision theoretic problems in a classical context. We discuss some features of the proposed algorithms tested on an existing quantum annealer D-Wave II extending the simulation of decision theoretic problems to a quantum context.