2010
DOI: 10.1007/s00023-009-0019-6
|View full text |Cite
|
Sign up to set email alerts
|

Hilbert Lattice Equations

Abstract: Abstract. There are five known classes of lattice equations that hold in every infinite dimensional Hilbert space underlying quantum systems: generalised orthoarguesian, Mayet's EA, Godowski, Mayet-Godowski, and Mayet's E equations. We obtain a result which opens a possibility that the first two classes coincide. We devise new algorithms to generate Mayet-Godowski equations that allow us to prove that the fourth class properly includes the third. An open problem related to the last class is answered. Finally, … Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
10
0

Year Published

2010
2010
2023
2023

Publication Types

Select...
4
1
1

Relationship

2
4

Authors

Journals

citations
Cited by 8 publications
(10 citation statements)
references
References 26 publications
0
10
0
Order By: Relevance
“…II.8) using lattices that do not admit strong sets of states. 19,21 Based on all that together with several previous results based on lattices admitting only one state, 32,33,71,72 in Sec. II we formulated the following theorem: Theorem II.13 [Semi-quantum lattice algorithms] There exist algorithms that generate finite sequences of OMLs that admit superposition, real-valued states, and a vector state given by Eq.…”
Section: Discussionmentioning
confidence: 75%
See 1 more Smart Citation
“…II.8) using lattices that do not admit strong sets of states. 19,21 Based on all that together with several previous results based on lattices admitting only one state, 32,33,71,72 in Sec. II we formulated the following theorem: Theorem II.13 [Semi-quantum lattice algorithms] There exist algorithms that generate finite sequences of OMLs that admit superposition, real-valued states, and a vector state given by Eq.…”
Section: Discussionmentioning
confidence: 75%
“…The cycles themselves will allow us to generate new lattice equations following the procedure developed in 19,21,67 , but they do not automatically follow possible geometrical symmetries of the hypergraphs. In the 36-36 case they do, but, e.g., they do not exhibit the left right symmetry of the 35-35 lattice shown in Fig.…”
Section: Properties Of Lattices With Equal Numbers Of Atoms and Bmentioning
confidence: 99%
“…The left figure shows the blocks we dropped from Fig. 2, and the right one is given in the representation we previously used to show violations of 3OA through 6OA at lattices presented in [2,6,20] with the maximal loop (tetrakaidecagon, 14-gon) it contains.…”
Section: Main Result: Lattices That Satisfy 6oa and Violate 7oamentioning
confidence: 99%
“…Since 1975, additional equations that it satisfies have been discovered. Among these, the only ones known that are directly related to the vector space of the underlying Hilbert space (i.e., excluding those that are related to states introduced on the lattice) are the generalized orthoarguesian equations (nOA, n ≥ 3) [2]. Thus, these equations are an essential tool for analyzing lattices conjectured to represent particular experimental setups.…”
Section: Introductionmentioning
confidence: 99%
“…He showed that this equation is valid in C(H) and not in oml. Many refinements of this ortho-Arguesian identity have been found [55,56] providing other equations valid in C(H) and not in oml. A further source of equations valid in C(H) and not in oml is provided by the fact that C(H) has an ample supply of well-behaved states [27,53,54].…”
Section: Problem 6 Is the Equational Theory Of The Oml C(h) Decidable?mentioning
confidence: 99%