Results 1  10
of
10
Automatic Proofs and Counterexamples for Some Ortholattice Identities
 Information Processing Letters
, 1998
"... This note answers questions on whether three identities known to hold for orthomodular lattices are true also for ortholattices. One identity is shown to fail by MACE, a program that searches for counterexamples, an the other two are proved to hold by EQP, an equational theorem prover. The problems, ..."
Abstract

Cited by 22 (2 self)
 Add to MetaCart
This note answers questions on whether three identities known to hold for orthomodular lattices are true also for ortholattices. One identity is shown to fail by MACE, a program that searches for counterexamples, an the other two are proved to hold by EQP, an equational theorem prover. The problems, from work in quantum logic, were given to us by Norman Megill. Keywords: Automatic theorem proving, ortholattice, quantum logic, theory of computation. 1 Introduction An ortholattice is an algebra with a binary operation (join) and a unary operation 0 (complement) satisfying the following (independent) set of identities. x y = (x 0 y 0 ) 0 (definition of meet) x y = y x (x y) z = x (y z) x (x y) = x x 00 = x x (y y 0 ) = y y 0 Supported by the Mathematical, Information, and Computational Sciences Division subprogram of the Office of Computational and Technology Research, U.S. Department of Energy, under Contract W31109Eng38. From these identities one can...
NonOrthomodular Models for Both Standard Quantum Logic and Standard Classical Logic: Repercussions for Quantum Computers
 Helv. Phys. Acta
, 1999
"... Abstract. It is shown that propositional calculuses of both quantum and classical logics are noncategorical. We find that quantum logic is in addition to an orthomodular lattice also modeled by a weakly orthomodular lattice and that classical logic is in addition to a Boolean algebra also modeled by ..."
Abstract

Cited by 17 (12 self)
 Add to MetaCart
Abstract. It is shown that propositional calculuses of both quantum and classical logics are noncategorical. We find that quantum logic is in addition to an orthomodular lattice also modeled by a weakly orthomodular lattice and that classical logic is in addition to a Boolean algebra also modeled by a weakly distributive lattice. Both new models turn out to be nonorthomodular. We prove the soundness and completeness of the calculuses for the models. We also prove that all the operations in an orthomodular lattice are fivefold defined. In the end we discuss possible repercussions of our results to quantum computations and quantum computers.
Algorithms for Greechie Diagrams
 Int. J. Theor. Phys
, 2000
"... Abstract. We give a new algorithm for generating Greechie diagrams with arbitrary chosen number of atoms or blocks (with 2,3,4,... atoms) and provide a computer program for generating the diagrams. The results show that the previous algorithm does not produce every diagram and that it is at least 10 ..."
Abstract

Cited by 7 (6 self)
 Add to MetaCart
Abstract. We give a new algorithm for generating Greechie diagrams with arbitrary chosen number of atoms or blocks (with 2,3,4,... atoms) and provide a computer program for generating the diagrams. The results show that the previous algorithm does not produce every diagram and that it is at least 10 5 times slower. We also provide an algorithm and programs for checking of Greechie diagram passage by equations defining varieties of orthomodular lattices and give examples from Hilbert lattices. At the end we discuss some additional characteristics of Greechie diagrams. PACS numbers: 03.65.Bz, 02.10.By, 02.10.Gd
Orthomodular Lattices and a Quantum Algebra
 Int. J. Theor. Phys
, 2001
"... Abstract. We show that one can formulate an algebra with lattice ordering so as to contain one quantum and five classical operations as opposed to the standard formulation of the Hilbert space subspace algebra. The standard orthomodular lattice is embeddable into the algebra. To obtain this result w ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
Abstract. We show that one can formulate an algebra with lattice ordering so as to contain one quantum and five classical operations as opposed to the standard formulation of the Hilbert space subspace algebra. The standard orthomodular lattice is embeddable into the algebra. To obtain this result we devised algorithms and computer programs for obtaining expressions of all quantum and classical operations within an orthomodular lattice in terms of each other, many of which are presented in the paper. For quantum disjunction and conjunction we prove their associativity in an orthomodular lattice for any triple in which one of the elements commutes with the other two and their distributivity for any triple in which a particular one of the elements commutes with the other two. We also prove that the distributivity of symmetric identity holds in Hilbert space, although it remains an open problem whether it holds in all orthomodular lattices, as it does not fail in any of over 50 million Greechie diagrams we tested.
Equations, states, and lattices of infinitedimensional Hilbert space
 Int. J. Theor. Phys
, 2000
"... Abstract. We provide several new results on quantum state space, on lattice of subspaces of an infinite dimensional Hilbert space, and on infinite dimensional Hilbert space equations as well as on connections between them. In particular we obtain an nvariable generalized orthoarguesian equation whi ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Abstract. We provide several new results on quantum state space, on lattice of subspaces of an infinite dimensional Hilbert space, and on infinite dimensional Hilbert space equations as well as on connections between them. In particular we obtain an nvariable generalized orthoarguesian equation which holds in any infinite dimensional Hilbert space. Then we strengthen Godowski’s result by showing that in an ortholattice on which strong states are defined Godowski’s equations as well as the orthomodularity hold. We also prove that all 6 and 4variable orthoarguesian equations presented in the literature can be reduced to new 4 and 3variable ones, respectively and that Mayet’s examples follow from Godowski’s equations. To make a breakthrough in testing these massive equations we designed several novel algorithms for generating Greechie diagrams with an arbitrary number of blocks and atoms (currently testing with up to 50) and for automated checking of equations on them. A way of obtaining complex infinite dimensional Hilbert space from the Hilbert lattice equipped with several additional conditions and without invoking the notion of state is presented. Possible repercussions of the results to quantum computing problems are discussed.
Is Quantum Logic a Logic
 Handbook of Quantum Logic and Quantum Structures, volume Quantum Logic
, 2008
"... Is a Quantum Logic a Logic? [1] in which they strengthen a previous negative ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Is a Quantum Logic a Logic? [1] in which they strengthen a previous negative
IsomorphFree Exhaustive Generation of Greechie Diagrams and Automated Checking of Their Passage by Orthomodular Lattice Equations
 Int. J. Theor. Phys
, 2000
"... Abstract. We give a new algorithm for generating Greechie diagrams with arbitrary chosen number of atoms or blocks (with 2,3,4,... atoms) and provide a computer program for generating the diagrams. The results show that the previous algorithm does not produce every diagram and that it is at least 10 ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. We give a new algorithm for generating Greechie diagrams with arbitrary chosen number of atoms or blocks (with 2,3,4,... atoms) and provide a computer program for generating the diagrams. The results show that the previous algorithm does not produce every diagram and that it is at least 10 5 times slower. We also provide an algorithm and programs for checking of Greechie diagram passage by equations defining varieties of orthomodular lattices and give examples from Hilbert lattices. At the end we discuss some additional characteristics of Greechie diagrams. PACS numbers: 03.65.Bz, 02.10.By, 02.10.Gd
By
, 2001
"... Abstract. We show that one can formulate an algebra with lattice ordering so as to contain one quantum and five classical operations as opposed to the standard formulation of the Hilbert space subspace algebra. The standard orthomodular lattice is embeddable into the algebra. To obtain this result w ..."
Abstract
 Add to MetaCart
Abstract. We show that one can formulate an algebra with lattice ordering so as to contain one quantum and five classical operations as opposed to the standard formulation of the Hilbert space subspace algebra. The standard orthomodular lattice is embeddable into the algebra. To obtain this result we devised algorithms and computer programs for obtaining expressions of all quantum and classical operations within an orthomodular lattice in terms of each other, many of which are presented in the paper. For quantum disjunction and conjunction we prove their associativity in an orthomodular lattice for any triple in which one of the elements commutes with the other two and their distributivity for any triple in which a particular one of the elements commutes with the other two. We also prove that the distributivity of symmetric identity holds in Hilbert space, although it remains an open problem whether it holds in all orthomodular lattices, as it does not fail in any of over 50 million Greechie diagrams we tested. PACS numbers: 03.65, 02.10, 05.50
Equivalences, Identities, Symmetric Differences, and Congruences in Orthomodular Lattices
, 2003
"... It is shown that operations of equivalence cannot serve for building algebras which would induce orthomodular lattices as the operations of implication can. Several properties of equivalence operations have been investigated. Distributivity of equivalence terms and several other 3 variable expressio ..."
Abstract
 Add to MetaCart
It is shown that operations of equivalence cannot serve for building algebras which would induce orthomodular lattices as the operations of implication can. Several properties of equivalence operations have been investigated. Distributivity of equivalence terms and several other 3 variable expressions involving equivalence terms have been proved to hold in any orthomodular lattice. Symmetric differences have been shown to reduce to complements of equivalence terms. Some congruence relations related to equivalence operations and symmetric differences have been considered. PACS number: 03.65.Bz, 02.10.By, 02.10.Gd