The fundamental algebraic concepts of quantum mechanics, as expressed by many authors, are reviewed and translated into the framework of the relatively new non-distributive system of Boolean fractions (also called conditional events or conditional propositions). This system of ordered pairs (A|B) of events A, B, can express all of the non-Boolean aspects of quantum logic without having to resort to a more abstract formulation like Hilbert space. Such notions as orthogonality, superposition, simultaneous verifiability, compatibility, orthoalgebras, orthocomplementation, modularity, and the Sasaki projection mapping are translated into this conditional event framework and their forms exhibited. These concepts turn out to be quite adequately expressed in this near-Boolean framework thereby allowing more natural, intuitive interpretations of quantum phenomena. Results include showing that two conditional propositions are simultaneously verifiable just in case the truth of one implies the applicability of the other. Another theorem shows that two conditional propositions (a|b) and (c|d) reside in a common Boolean sub-algebra of the non-distributive system of conditional propositions just in case b=d, that their conditions are equivalent. Some concepts equivalent in standard formulations of quantum logic are distinguishable in the conditional event algebra, indicating the greater richness of expression possible with Boolean fractions. Logical operations and deductions in the linear subspace logic of quantum mechanics are compared with their counterparts in the conditional event realm. Disjunctions and implications in the quantum realm seem to correspond in the domain of Boolean fractions to previously identified implications with respect to various naturally arising deductive relations.
The concept of complementarity in combination with a non-Boolean calculus of propositions refers to a pivotal feature of quantum systems which has long been regarded as a key to their distinction from classical systems. But a non-Boolean logic of complementary features may also apply to classical systems, if their states and observables are defined by partitions of a classical state space. If these partitions do not satisfy certain stability criteria, complementary observables and non-Boolean propositional lattices may be the consequence. This is especially the case for non-generating partitio…
We investigate dynamical properties of a quantum generalization of classical reversible Boolean networks. The state of each node is encoded as a single qubit, and classical Boolean logic operations are supplemented by controlled bit-flip and Hadamard operations. We consider synchronous updating schemes in which each qubit is updated at each step based on stored values of the qubits from the previous step. We investigate the periodic or quasiperiodic behavior of quantum networks, and we analyze the propagation of single site perturbations through the quantum networks with input degree one. A no…
The relationship between quantum physics and discrete mathematics is reviewed in this article. The Boolean functions unitary representation is considered. The relationship between Zhegalkin polynomial, which defines the algebraic normal form of Boolean function, and quantum logic circuits is described. It is shown that quantum information approach provides simple algorithm to construct Zhegalkin polynomial using truth table. Developed methods and algorithms have arbitrary Boolean function generalization with multibit input and multibit output. Such generalization allows us to use many-valued l…
We show that the established physics of spin valves together with the recently discovered giant spin-Hall effect could be used to construct Read and Write units that can be integrated into a single spin switch with input-output isolation, gain and fan-out similar to CMOS inverters, but with the information stored in nanomagnets making it non-volatile. Such spin switches could be interconnected, with no external amplification, just with passive circuit elements, to perform logic operations. Moreover, since the digitization and storage occurs naturally in the magnets, the voltages can be used to…
Quantum Hamiltonian Computing is a recent approach that uses quantum systems, in particular a single molecule, to perform computational tasks. Within this approach, we present explicit methods to construct logic gates using two different designs, where the logical outputs are encoded either at fixed energy and spatial positioning of the quantum states, or at different energies. We use these results to construct quantum Boolean adders involving a minimal number of quantum states with the two designs. We also establish a matrix algebra giving an analogy between classical Boolean logic gates and …
Tohoku University（东北大学）；Portland State University（波特兰州立大学）
It has been experimentally proven that realizing universal quantum gates using higher-radices logic is practically and technologically possible. We developed a Parallel Genetic Algorithm that synthesizes Boolean reversible circuits realized with a variety of quantum gates on qudits with various radices. In order to allow synthesizing circuits of medium sizes in the higher radix quantum space we performed the experiments using a GPU accelerated Genetic Algorithm. Using the accelerated GA we compare heuristic improvements to the mutation process based on cost minimization, on the adaptive cost o…
Coherent spaces spanned by a finite number of coherent states, are introduced. Their coherence properties are studied, using the Dirac contour representation. It is shown that the corresponding projectors resolve the identity, and that they transform into projectors of the same type, under displacement transformations, and also under time evolution. The set of these spaces, with the logical OR and AND operations is a distributive lattice, and with the logical XOR and AND operations is a Boolean ring (Stone\rq{}s formalism). Applications of this Boolean ring into classical CNOT gates with $n$-a…
We consider orthomodular posets endowed with a symmetric difference. We call them ODPs. Expressed in the quantum logic language, we consider quantum logics with an XOR-type connective. We study three classes of "almost Boolean" ODPs, two of them defined by requiring rather specific behaviour of infima and the third by a Boolean-like behaviour of Frink ideals. We establish a (rather surprising) inclusion between the three classes, shadding thus light on their intrinsic properties. (More details can be found in the Introduction that follows.) Let us only note that the orthomodular posets pursued…
We describe a high-speed physical random number generator based on a hybrid Boolean network with autonomous and clocked logic gates, realized on a reconfigurable chip. The autonomous logic gates are arranged in a bidirectional ring topology and generate broadband chaos. The clocked logic gates receive input from the autonomous logic gates so that random numbers are generated physically that pass standard randomness tests without further post-processing. The large number of logic gates on reconfigurable chips allows for parallel generation of random numbers, as demonstrated by our implementatio…
This paper discusses the no-cloning theorem in a logico-algebraic approach. In this approach, an orthoalgebra is considered as a general structure for propositions in a physical theory. We proved that an orthoalgebra admits cloning operation if and only if it is a Boolean algebra. That is, only classical theory admits the cloning of states. If unsharp propositions are to be included in the theory, then a notion of effect algebra is considered. We proved that an atomic Archimedean effect algebra admitting cloning operation is a Boolean algebra. This paper also presents a partial result indicati…
Gaisi Takeuti introduced Boolean valued analysis around 1974 to provide systematic applications of Boolean valued models of set theory to analysis. Later, his methods were further developed by his followers, leading to solving several open problems in analysis and algebra. Using the methods of Boolean valued analysis, he further stepped forward to construct set theory based on quantum logic, as the first step to construct "quantum mathematics", a mathematics based on quantum logic. While it is known that the distributive law does not apply to quantum logic, and the equality axiom turns out not…
It is well-known that a Hilbert-style deduction system for first-order classical logic is sound and complete for a model theory built using all Boolean algebras as truth-value algebras if and only if it is sound and complete for a model theory utilizing only irreducible Boolean algebras (which are all isomorphic to the two-element Boolean algebra). In this paper, we prove an analogous result for any first-order logic with an algebraic semantics satisfying certain minimal assumptions, and we then apply our result to first-order quantum logic.
In Aristotelian logic, categorical propositions are divided in Universal Affirmative, Universal Negative, Particular Affirmative and Particular Negative. Possible relations between two of the mentioned type of propositions are encoded in the square of opposition. The square expresses the essential properties of monadic first order quantification which, in an algebraic approach, may be represented taking into account monadic Boolean algebras. More precisely, quantifiers are considered as modal operators acting on a Boolean algebra and the square of opposition is represented by relations between…
The present paper is devoted to modelling of a probability measure of logical connectives on a quantum logic (QL), via a $G$-map, which is a special map on it. We follow the work in which the probability of logical conjunction, disjunction and symmetric difference and their negations for non-compatible propositions are studied. We study such a $ G $-map on quantum logics, which is a probability measure of a projection and show, that unlike classical (Boolean) logic, probability measure of projections on a quantum logic are not necessarilly pure projections. We compare properties of a $G$-map o…
The common-sense view of reality is expressed logically in Boolean subset logic (each element is either definitely in or not in a subset, i.e., either definitely has or does not have a property). But quantum mechanics does not agree with this "properties all the way down" picture of micro-reality. Are there other coherent alternative views of reality? A logic of partitions, dual to the Boolean logic of subsets (partitions are dual to subsets), was recently developed along with a logical version of information theory. In view of the subset-partition duality, partition logic is the alternative t…
A rotation-based synthesis framework for reversible logic is proposed. We develop a canonical representation based on binary decision diagrams and introduce operators to manipulate the developed representation model. Furthermore, a recursive functional bi-decomposition approach is proposed to automatically synthesize a given function. While Boolean reversible logic is particularly addressed, our framework constructs intermediate quantum states that may be in superposition, hence we combine techniques from reversible Boolean logic and quantum computation. The proposed approach results in quadra…
Contextuality is a key signature of quantum non-classicality, which has been shown to play a central role in enabling quantum advantage for a wide range of information-processing and computational tasks. We study the logic of contextuality from a structural point of view, in the setting of partial Boolean algebras introduced by Kochen and Specker in their seminal work. These contrast with traditional quantum logic à la Birkhoff and von Neumann in that operations such as conjunction and disjunction are partial, only being defined in the domain where they are physically meaningful. We study how …
In R.D. Sorkin's framework for logic in physics a clear separation is made between the collection of unasserted propositions about the physical world and the affirmation or denial of these propositions by the physical world. The unasserted propositions form a Boolean algebra because they correspond to subsets of an underlying set of spacetime histories. Physical rules of inference, apply not to the propositions in themselves but to the affirmation and denial of these propositions by the actual world. This physical logic may or may not respect the propositions' underlying Boolean structure. We …
