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:1810.10423 · Soft Computing

Faithful orthogonal representations of graphs from partition logics

Karl Svozil

Published Nov 4, 2019• 16 citations
arXivHTMLPDF

Abstract

Abstract Partition logics often allow a dual probabilistic interpretation: a classical one for which probabilities lie on the convex hull of the dispersion-free weights and another one, suggested independently from the quantum Born rule, in which probabilities are formed by the (absolute) square of the inner product of state vectors with the faithful orthogonal representations of the respective graph. Two immediate consequences are the demonstration that the logico-empirical structure of observables does not determine the type of probabilities alone and that complementarity does not imply contextuality.

DOI
10.1007/s00500-019-04425-1

Related papers

Complementarity in Social Measurement: A Partition-Logic Approach

Karl Svozil

Partition logics -- non-Boolean event structures obtained by pasting Boolean algebras -- provide a natural language for situations in which a system has a definite latent state but can be accessed and resolved only through mutually incompatible coarse-grained modes of observation. We show that this structure arises in a range of social-science settings by constructing six explicit examples from personnel assessment, survey framing, clinical diagnosis, espionage coordination, legal pluralism, and organizational auditing. For each case we identify the latent state space, the observational contexts as partitions, and the shared atoms that intertwine contexts, yielding instances of the $L_{12}$ bowtie, triangle, pentagon, and automaton partition logics. These examples make precise a notion of social complementarity: different modes of inquiry can be incompatible even though the underlying system remains fully value-definite. Complementarity in this sense does not entail contextuality or ontic indeterminacy. We further compare the classical probabilities generated by convex mixtures of dispersion-free states with the quantum-like Born probabilities available when the same exclusivity graph admits a faithful orthogonal representation. The framework thus separates logical structure from probabilistic realization and suggests empirically testable benchmarks for quantum-cognition models.

arXiv:2603.28818•Mar 28, 2026•0 citations

Varieties of contextuality emphasizing (non)embeddability

Karl Svozil

The notion of in terms of nonclassical (paradoxical) properties of probability distributions is refined by concentrating on the nonclassical logico-algebraic structures of the observables supporting such probabilities. These structures often, but not always, induce and are reflected by nonclassical properties of the probability distributions. Two types of contextuality are introduced, originating either in nonclassical probabilities on classical logics, or in genuine nonclassical logics of observables which cannot be faithfully (homomorphically) embedded into (extended) Boolean algebras. It is suggested to substitute the term contextual by indeterminate or value indefinite in the spirit of partial functions of theoretical computer sciences.

•Mar 10, 2021•2 citations

Varieties of contextuality based on probability and structural nonembeddability

Karl Svozil

Different analytic notions of contextuality fall into two major groups: probabilistic and strong notions of contextuality. Kochen and Specker's Theorem 0 [1] presents a demarcation criterion for differentiating between those groups. Whereas probabilistic contextuality still allows classical models, albeit with nonclassical probabilities, the logico-algebraic “strong” form of contextuality characterizes collections of quantum observables that have no faithfully embedding into (extended) Boolean algebras. Both forms indicate a classical in- or under-determination that can be termed “value indefinite” and formalized by partial functions of theoretical computer sciences.

arXiv:2103.06110•Theoretical Computer Science•Apr 28, 2022•6 citations

The Symmetrical Foundation of Measure, Probability, and Quantum Theories

John Skilling, Kevin H. Knuth

Abstract Quantification starts with sum and product rules that express combination and partition. These rules rest on elementary symmetries that have wide applicability, which explains why arithmetical adding up and splitting into proportions are ubiquitous. Specifically, measure theory formalizes addition, and probability theory formalizes inference in terms of proportions. Quantum theory rests on the same simple symmetries, but is formalized in two dimensions, not just one, in order to track an object through its binary interactions with other objects. The symmetries still require sum and product rules (here known as the Feynman rules), but they apply to complex numbers instead of real scalars, with observable probabilities being modulus squared (known as the Born rule). The standard quantum formalism follows. There is no mystery or weirdness, just ordinary probabilistic inference.

arXiv:1712.09725•Annalen der Physik•Jun 13, 2018•15 citations

Boolean embeddings of orthomodular sets and quantum logic

Neal Zierler, Michael Schlessinger

By a “quantum logic” we mean a pair F, P where P is a set and F is a set of functions from P to the closed real unit interval satisfying three postulates which we describe in intuitive terms here. Cf. [2], [4], [7]. P may be interpreted as the set of events and F the set of states of a “physical system”, and f(x) then becomes the probability of occurrence of the event x in the state f. Since the outcome of an experiment is an estimate for some f(x), or a collection of such estimates, it is natural to identify events which cannot be distinguished by experiment.

Duke Mathematical Journal•Jun 1, 1965•73 citations

Quantum logics representable as kernels of measures

Mirko Navara

Tlic classical Kohnogorov's model of probability assumes that every pair of ev(Tits is siinult.aneouslyobservable.This principle is violated in several applications including quantum mechanics, artificial intelligence, psychology, sociology etc.In these areas iioneoinpatible events are encountered.These are events which can be observed separately, but not simultaneously, so they are not contained in a Boolean subalgebra i = classical subsystem) of the event structure describing the system in question.Various attempts have been made to generalize the probability theory to a more general structure admitting noneonipatibility.Among them, classes of subsets (more generally, concrete logics) wore studied for many years (see e.g.[15, 18]).Although some results were successfully generalized (see e.g.[4. 10, 19]).the theory proceeded slowly and with serious difficulties.Hero we introduce a more special-but still reasonably general-structure, a kernel logic.As it is described in terms of Boolean algebras using measure-theoretic notions, we believe that there is a greater chance to generalize classical results for Boolean algebras to kernel logics.Kernel logics seem to be interesting also from the algebraic point of view as a new const ruction technique for concrete logics.Its usefulness was proved by solutions of several quite nontrivial problems.Besides this, it scorns desirable to describe kernels of measures on Boolean algebras.

Czechoslovak Mathematical Journal•Jan 1, 1996•6 citations
Abstract Partition logics often allow a dual probabilistic interpretation: a classical one for which probabilities lie on the convex hull of the dispersion-free weights and another one, suggested independently from the quantum Born rule, in which probabilities are formed by the (absolute) square of the inner product of state vectors with the faithful orthogonal representations of the respective graph. Two immediate consequences are the demonstration that the logico-empirical structure of observables does not determine the type of probabilities alone and that complementarity does not imply contextuality.
Partition logics -- non-Boolean event structures obtained by pasting Boolean algebras -- provide a natural language for situations in which a system has a definite latent state but can be accessed and resolved only through mutually incompatible coarse-grained modes of observation. We show that this structure arises in a range of social-science settings by constructing six explicit examples from personnel assessment, survey framing, clinical diagnosis, espionage coordination, legal pluralism, and organizational auditing. For each case we identify the latent state space, the observational contexts as partitions, and the shared atoms that intertwine contexts, yielding instances of the L12L_{12}L12​ bowtie, triangle, pentagon, and automaton partition logics. These examples make precise a notion of social complementarity: different modes of inquiry can be incompatible even though the underlying system remains fully value-definite. Complementarity in this sense does not entail contextuality or ontic indeterminacy. We further compare the classical probabilities generated by convex mixtures of dispersion-free states with the quantum-like Born probabilities available when the same exclusivity graph admits a faithful orthogonal representation. The framework thus separates logical structure from probabilistic realization and suggests empirically testable benchmarks for quantum-cognition models.
The notion of in terms of nonclassical (paradoxical) properties of probability distributions is refined by concentrating on the nonclassical logico-algebraic structures of the observables supporting such probabilities. These structures often, but not always, induce and are reflected by nonclassical properties of the probability distributions. Two types of contextuality are introduced, originating either in nonclassical probabilities on classical logics, or in genuine nonclassical logics of observables which cannot be faithfully (homomorphically) embedded into (extended) Boolean algebras. It is suggested to substitute the term contextual by indeterminate or value indefinite in the spirit of partial functions of theoretical computer sciences.
Different analytic notions of contextuality fall into two major groups: probabilistic and strong notions of contextuality. Kochen and Specker's Theorem 0 [1] presents a demarcation criterion for differentiating between those groups. Whereas probabilistic contextuality still allows classical models, albeit with nonclassical probabilities, the logico-algebraic “strong” form of contextuality characterizes collections of quantum observables that have no faithfully embedding into (extended) Boolean algebras. Both forms indicate a classical in- or under-determination that can be termed “value indefinite” and formalized by partial functions of theoretical computer sciences.
Abstract Quantification starts with sum and product rules that express combination and partition. These rules rest on elementary symmetries that have wide applicability, which explains why arithmetical adding up and splitting into proportions are ubiquitous. Specifically, measure theory formalizes addition, and probability theory formalizes inference in terms of proportions. Quantum theory rests on the same simple symmetries, but is formalized in two dimensions, not just one, in order to track an object through its binary interactions with other objects. The symmetries still require sum and product rules (here known as the Feynman rules), but they apply to complex numbers instead of real scalars, with observable probabilities being modulus squared (known as the Born rule). The standard quantum formalism follows. There is no mystery or weirdness, just ordinary probabilistic inference.
By a “quantum logic” we mean a pair F, P where P is a set and F is a set of functions from P to the closed real unit interval satisfying three postulates which we describe in intuitive terms here. Cf. [2], [4], [7]. P may be interpreted as the set of events and F the set of states of a “physical system”, and f(x) then becomes the probability of occurrence of the event x in the state f. Since the outcome of an experiment is an estimate for some f(x), or a collection of such estimates, it is natural to identify events which cannot be distinguished by experiment.
Tlic classical Kohnogorov's model of probability assumes that every pair of ev(Tits is siinult.aneouslyobservable.This principle is violated in several applications including quantum mechanics, artificial intelligence, psychology, sociology etc.In these areas iioneoinpatible events are encountered.These are events which can be observed separately, but not simultaneously, so they are not contained in a Boolean subalgebra i = classical subsystem) of the event structure describing the system in question.Various attempts have been made to generalize the probability theory to a more general structure admitting noneonipatibility.Among them, classes of subsets (more generally, concrete logics) wore studied for many years (see e.g.[15, 18]).Although some results were successfully generalized (see e.g.[4. 10, 19]).the theory proceeded slowly and with serious difficulties.Hero we introduce a more special-but still reasonably general-structure, a kernel logic.As it is described in terms of Boolean algebras using measure-theoretic notions, we believe that there is a greater chance to generalize classical results for Boolean algebras to kernel logics.Kernel logics seem to be interesting also from the algebraic point of view as a new const ruction technique for concrete logics.Its usefulness was proved by solutions of several quite nontrivial problems.Besides this, it scorns desirable to describe kernels of measures on Boolean algebras.