Lower and upper probabilities in the distributive lattice of subsystems
classification
🪐 quant-ph
keywords
latticelowerdempster-shaferdistributivefiniteprobabilitiesprobabilityquantum
read the original abstract
The set of subsystems of a finite quantum system (with variables in Z(n)) together with logical connectives, is a distributive lattice. With regard to this lattice, the (where P(m) is the projector to) obeys a supermodularity inequality, and it is interpreted as a lower probability in the sense of the Dempster-Shafer theory, and not as a Kolmogorov probability. It is shown that the basic concepts of the Dempster-Shafer theory (lower and upper probabilities and the Dempster multivaluedness) are pertinent to the quantum formalism of finite systems.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.