Quantum probabilities as Dempster-Shafer probabilities in the lattice of subspaces.
KeywordQuantum probabilities; Dempster-Shafer probabilities; Hilbert space; Probability theory; Inequalities; Noncommutative field theory
Rights© 2014 AIP Publishing. This article may be downloaded for personal use only. Any other use requires prior permission of the author and AIP Publishing. The following article appeared in the Journal of Mathematical Physics and may be found at http://dx.doi.org/10.1063/1.4891972.
MetadataShow full item record
AbstractThe orthocomplemented modular lattice of subspaces L[H(d)] , of a quantum system with d-dimensional Hilbert space H(d), is considered. A generalized additivity relation which holds for Kolmogorov probabilities is violated by quantum probabilities in the full lattice L[H(d)] (it is only valid within the Boolean subalgebras of L[H(d)] ). This suggests the use of more general (than Kolmogorov) probability theories, and here the Dempster-Shafer probability theory is adopted. An operator D(H1,H2) , which quantifies deviations from Kolmogorov probability theory is introduced, and it is shown to be intimately related to the commutator of the projectors P(H1),P(H2) , to the subspaces H 1, H 2. As an application, it is shown that the proof of the inequalities of Clauser, Horne, Shimony, and Holt for a system of two spin 1/2 particles is valid for Kolmogorov probabilities, but it is not valid for Dempster-Shafer probabilities. The violation of these inequalities in experiments supports the interpretation of quantum probabilities as Dempster-Shafer probabilities.
CitationVourdas A (2015) Quantum probabilities as Dempster-Shafer probabilities in the lattice of subspaces. Journal of Mathematical Physics, 55(8): 082107.
Link to publisher’s versionhttp://dx.doi.org/10.1063/1.4891972
Showing items related by title, author, creator and subject.
Lower and upper probabilities in the distributive lattice of subsystemsVourdas, Apostolos (2014-08-12)The set of subsystems ∑ (m) of a finite quantum system ∑(n) (with variables in Ζ(n)) together with logical connectives, is a distributive lattice. With regard to this lattice, the ℓ(m | ρn) = Tr (𝔓(m) ρn ) (where 𝔓(m) is the projector to ∑(m)) 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.
Analytical Modelling and Optimization of Congestion Control for Prioritized Multi-Class Self-Similar TrafficMin, Geyong; Jin, X. (2013)Traffic congestion in communication networks can dramatically deteriorate user-perceived Quality-of-Service (QoS). The integration of the Random Early Detection (RED) and priority scheduling mechanisms is a promising scheme for congestion control and provisioning of differentiated QoS required by multimedia applications. Although analytical modelling of RED congestion control has received significant research efforts, the performance models reported in the current literature were primarily restricted to the RED algorithm only without consideration of traffic scheduling scheme for QoS differentiation. Moreover, for analytical tractability, these models were developed under the simplified assumption that the traffic follows Short-Range-Dependent (SRD) arrival processes (e.g., Poisson or Markov processes), which are unable to capture the self-similar nature (i.e., scale-invariant burstiness) of multimedia traffic in modern communication networks. To fill these gaps, this paper presents a new analytical model of RED congestion control for prioritized multi-class self-similar traffic. The closed-form expressions for the loss probability of individual traffic classes are derived. The effectiveness and accuracy of the model are validated through extensive comparison between analytical and simulation results. To illustrate its application, the model is adopted as a cost-effective tool to investigate the optimal threshold configuration and minimize the required buffer space with congestion control.
A differential equation for a class of discrete lifetime distributions with an application in reliability: A demonstration of the utility of computer algebraCsenki, Attila (2015-09)It is shown that the probability generating function of a lifetime random variable T on a finite lattice with polynomial failure rate satisfies a certain differential equation. The interrelationship with Markov chain theory is highlighted. The differential equation gives rise to a system of differential equations which, when inverted, can be used in the limit to express the polynomial coefficients in terms of the factorial moments of T. This then can be used to estimate the polynomial coefficients. Some special cases are worked through symbolically using Computer Algebra. A simulation study is used to validate the approach and to explore its potential in the reliability context.