Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Isomorph-Free Exhaustive Generation of Greechie Diagrams and Automated Checking of Their Passage by Orthomodular Lattice Equations

Brendan D. McKay, Norman D. Megill, Mladen Paviÿcic

Published Sep 9, 2000• 3 citations
OpenAlex

Abstract

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

Related papers

Equations and State and Lattice Properties That Hold in Infinite Dimensional Hilbert Space

Norman D. Megill, Mladen Pavičić

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 n-variable 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 4-variable orthoarguesian equations presented in the literature can be reduced to new 4- and 3-variable 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.

•Jan 1, 2000•2 citations

Greechie diagrams, nonexistence of measures in quantum logics, and Kochen–Specker-type constructions

Karl Svozil, Josef Tkadlec

We use Greechie diagrams to construct finite orthomodular lattices ‘‘realizable’’ in the orthomodular lattice of subspaces in a three-dimensional Hilbert space such that the set of two-valued states is not ‘‘large’’ (i.e., full, separating, unital, nonempty, resp.). We discuss the number of elements of such orthomodular lattices, of their sets of (ortho)generators and of their subsets that do not admit a ‘‘large’’ set of two-valued states. We show connections with other results of this type.

Journal of Mathematical Physics•Nov 1, 1996•66 citations

Graph approach to quantum systems

Mladen Pavičić, Brendan D. McKay, Norman D. Megill +1 more

Using a graph approach to quantum systems, we show that descriptions of 3-dim Kochen–Specker (KS) setups as well as descriptions of 3-dim spin systems by means of Greechie diagrams (a kind of lattice) that we find in the literature are wrong. Correct lattices generated by McKay-Megill-Pavicic (MMP) hypergraphs and Hilbert subspace equations are given. To enable future exhaustive generation of 3-dim KS setups by means of our recently found stripping technique, bipartite graph generation is used to provide us with lattices with equal numbers of elements and blocks (orthogonal triples of elements)—up to 41 of them. We obtain several new results on such lattices and hypergraphs, in particular, on properties such as superposition and orthoraguesian equations.

arXiv:1004.0776•Journal of Mathematical Physics•Oct 1, 2010•23 citations

Quantum Logic and Quantum Computation

Mladen Pavičić, Norman D. Megill

We use classes of Hilbert lattice equations for an alternative representation of Hilbert lattices and Hilbert spaces of arbitrary quantum systems that might enable a direct introduction of the states of the systems into quantum computers. More specifically, we look for a way to feed a quantum computer with algebraic equations of n-th order underlying an infinite dimensional Hilbert space description of quantum systems. A number of new results on states defined on Hilbert lattices are presented and discussed and a number of recently obtained results in the field of Hilbert space equations are reviewed.

arXiv:0812.3072•Dec 16, 2008•0 citations

On (3,3)-Homogeneous Greechie Orthomodular Posets

Foat Sultanbekov

arXiv:math/0211311•International Journal of Theoretical Physics•Jul 1, 2005•4 citations

Subalgebras of orthomodular lattices

John Harding, Mirko Navara

Sachs showed that a Boolean algebra is determined by its lattice of subalgebras. We establish the corresponding result for orthomodular lattices. We show that an orthomodular lattice L is determined by its lattice of subalgebras Sub(L), as well as by its poset of Boolean subalgebras BSub(L). The domain BSub(L) has recently found use in an approach to the foundations of quantum mechanics initiated by Butterfield and Isham, at least in the case where L is the orthomodular lattice of projections of a Hilbert space, or von Neumann algebra. The results here may add some additional perspective to this line of work.

arXiv:1009.4433•Sep 22, 2010•1 citation
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
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 n-variable 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 4-variable orthoarguesian equations presented in the literature can be reduced to new 4- and 3-variable 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.
We use Greechie diagrams to construct finite orthomodular lattices ‘‘realizable’’ in the orthomodular lattice of subspaces in a three-dimensional Hilbert space such that the set of two-valued states is not ‘‘large’’ (i.e., full, separating, unital, nonempty, resp.). We discuss the number of elements of such orthomodular lattices, of their sets of (ortho)generators and of their subsets that do not admit a ‘‘large’’ set of two-valued states. We show connections with other results of this type.
Using a graph approach to quantum systems, we show that descriptions of 3-dim Kochen–Specker (KS) setups as well as descriptions of 3-dim spin systems by means of Greechie diagrams (a kind of lattice) that we find in the literature are wrong. Correct lattices generated by McKay-Megill-Pavicic (MMP) hypergraphs and Hilbert subspace equations are given. To enable future exhaustive generation of 3-dim KS setups by means of our recently found stripping technique, bipartite graph generation is used to provide us with lattices with equal numbers of elements and blocks (orthogonal triples of elements)—up to 41 of them. We obtain several new results on such lattices and hypergraphs, in particular, on properties such as superposition and orthoraguesian equations.
We use classes of Hilbert lattice equations for an alternative representation of Hilbert lattices and Hilbert spaces of arbitrary quantum systems that might enable a direct introduction of the states of the systems into quantum computers. More specifically, we look for a way to feed a quantum computer with algebraic equations of n-th order underlying an infinite dimensional Hilbert space description of quantum systems. A number of new results on states defined on Hilbert lattices are presented and discussed and a number of recently obtained results in the field of Hilbert space equations are reviewed.
Sachs showed that a Boolean algebra is determined by its lattice of subalgebras. We establish the corresponding result for orthomodular lattices. We show that an orthomodular lattice L is determined by its lattice of subalgebras Sub(L), as well as by its poset of Boolean subalgebras BSub(L). The domain BSub(L) has recently found use in an approach to the foundations of quantum mechanics initiated by Butterfield and Isham, at least in the case where L is the orthomodular lattice of projections of a Hilbert space, or von Neumann algebra. The results here may add some additional perspective to this line of work.