Pith. sign in

REVIEW

Lower and upper probabilities in the distributive lattice of subsystems

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1410.2040 v1 pith:2RLRADIE submitted 2014-10-08 quant-ph

Lower and upper probabilities in the distributive lattice of subsystems

classification quant-ph
keywords latticelowerdempster-shaferdistributivefiniteprobabilitiesprobabilityquantum
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
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.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.