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

arXiv:2609.10770

Simultaneous extensions of states on quantum logics

Dominika Burešová, Pavel Pták, Jan Ševic

Published Sep 9, 2026• 0 citations
arXivHTMLPDF

Abstract

Suppose that L is a quantum logic (= an orthomodular poset) and A, B are Boolean subalgebras of L. Suppose further that s1(resp. s2) is a state on A (resp. on B). We ask when both s1 and s2 allow for a simultaneous extension over L. Under a natural necessity condition on A, B, s1, s2 we find a sufficient condition for the existence of the extension. This condition is the requirement of an abundance of two-valued states on L. We then show by the Greechie pasting technique that this condition is far from necessary even for state-space-rich logics.

DOI
10.48550/arxiv.2609.10770

Related papers

Relatively additive states on quantum logics

Pavel Pták, Hans Weber

summary:In this paper we carry on the investigation of partially additive states on quantum logics (see [2], [5], [7], [8], [11], [12], [15], [18], etc.). We study a variant of weak states — the states which are additive with respect to a given Boolean subalgebra. In the first result we show that there are many quantum logics which do not possess any 2-additive central states (any logic possesses an abundance of 1-additive central state — see [12]). In the second result we construct a finite 3-homogeneous quantum logic which does not possess any two-valued 1-additive state with respect to a given Boolean subalgebra. This result strengthens Theorem 2 of [5] and presents a rather advanced example in the orthomodular combinatorics (see also [9], [13], [4], [6], [16], etc.). In the rest we show that Greechie logics allow for $2$-additive three-valued states, and in case of Greechie lattices we show that one can even construct many $2$-additive two-valued states. Some open questions are posed, too.

Commentationes Mathematicae Universitatis Carolinae•Jan 1, 2005•1 citation

Some nearly Boolean orthomodular posets

Pavel Pták

Let L L be an orthomodular partially ordered set (“a quantum logic"). Let us say that L L is nearly Boolean if L L is set-representable and if every state on L L is subadditive. We first discuss conditions under which a nearly Boolean OMP must be Boolean. Then we show that in general a nearly Boolean OMP does not have to be Boolean. Moreover, we prove that an arbitrary Boolean algebra may serve as the centre of a (non-Boolean) nearly Boolean OMP.

Proceedings of the American Mathematical Society•Jul 1, 1998•16 citations

Quantum logics close to Boolean algebras

Mirko Navara, Pavel Pták

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 here, though close to Boolean algebras (i.e., close to standard quantum logics), still have a potential for an arbitrarily high degree of non-compatibility and hence they may enrich the studies of mathematical foundations of quantum mechanics.

arXiv:2101.05501•Jan 14, 2021•0 citations

Boolean embeddings and hidden variables

Václav Alda

In this paper, two known methods of embedding a quantum logic or more generally an orthocompbemented poset in a Boolean algebra are considered.Some simplifications in the proofs are introduced.It is also shown on an elementary example that the existence or non existence of hidden variables depends on the definition of hidden variables and on the space states which can be realized on the considered system.

Časopis pro pěstování matematiky•Jan 1, 1987•0 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

Quantum Logics with Lattice State Spaces

Jiří Binder, Mirko Navara

Let $L$ be a quantum logic and let $S(L)$ denote the set of all states on $L$. (By a state we mean a nonnegative bounded $\sigma$-additive measure, not necessarily normalized.) We ask whether every logic whose state space is a lattice has to be Boolean. We prove that this is so for finite logics and "projection logics." On the other hand, we show that there exist even concrete non-Boolean logics with a lattice state space (in fact, we prove that every countable concrete logic can be enlarged to a logic with a lattice state space). In the appendix we shortly consider the lattice properties of the set of observables and correct the paper [10].

Proceedings of the American Mathematical Society•Jan 1, 1987•5 citations
Suppose that L is a quantum logic (= an orthomodular poset) and A, B are Boolean subalgebras of L. Suppose further that s1(resp. s2) is a state on A (resp. on B). We ask when both s1 and s2 allow for a simultaneous extension over L. Under a natural necessity condition on A, B, s1, s2 we find a sufficient condition for the existence of the extension. This condition is the requirement of an abundance of two-valued states on L. We then show by the Greechie pasting technique that this condition is far from necessary even for state-space-rich logics.
summary:In this paper we carry on the investigation of partially additive states on quantum logics (see [2], [5], [7], [8], [11], [12], [15], [18], etc.). We study a variant of weak states — the states which are additive with respect to a given Boolean subalgebra. In the first result we show that there are many quantum logics which do not possess any 2-additive central states (any logic possesses an abundance of 1-additive central state — see [12]). In the second result we construct a finite 3-homogeneous quantum logic which does not possess any two-valued 1-additive state with respect to a given Boolean subalgebra. This result strengthens Theorem 2 of [5] and presents a rather advanced example in the orthomodular combinatorics (see also [9], [13], [4], [6], [16], etc.). In the rest we show that Greechie logics allow for 222-additive three-valued states, and in case of Greechie lattices we show that one can even construct many 222-additive two-valued states. Some open questions are posed, too.
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 here, though close to Boolean algebras (i.e., close to standard quantum logics), still have a potential for an arbitrarily high degree of non-compatibility and hence they may enrich the studies of mathematical foundations of quantum mechanics.
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.
Let LLL be a quantum logic and let S(L)S(L)S(L) denote the set of all states on LLL. (By a state we mean a nonnegative bounded σ\sigmaσ-additive measure, not necessarily normalized.) We ask whether every logic whose state space is a lattice has to be Boolean. We prove that this is so for finite logics and "projection logics." On the other hand, we show that there exist even concrete non-Boolean logics with a lattice state space (in fact, we prove that every countable concrete logic can be enlarged to a logic with a lattice state space). In the appendix we shortly consider the lattice properties of the set of observables and correct the paper [10].