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.
A basic probability assignment methodology for unsupervised wireless intrusion detectionGhafir, Ibrahim; Kyriakopoulos, K.G.; Aparicio-Navarro, F.J.; Lambotharan, S.; Assadhan, B.; Binsalleeh, A.H. (2018-07-11)The broadcast nature of wireless local area networks has made them prone to several types of wireless injection attacks, such as Man-in-the-Middle (MitM) at the physical layer, deauthentication, and rogue access point attacks. The implementation of novel intrusion detection systems (IDSs) is fundamental to provide stronger protection against these wireless injection attacks. Since most attacks manifest themselves through different metrics, current IDSs should leverage a cross-layer approach to help toward improving the detection accuracy. The data fusion technique based on the Dempster–Shafer (D-S) theory has been proven to be an efficient technique to implement the cross-layer metric approach. However, the dynamic generation of the basic probability assignment (BPA) values used by D-S is still an open research problem. In this paper, we propose a novel unsupervised methodology to dynamically generate the BPA values, based on both the Gaussian and exponential probability density functions, the categorical probability mass function, and the local reachability density. Then, D-S is used to fuse the BPA values to classify whether the Wi-Fi frame is normal (i.e., non-malicious) or malicious. The proposed methodology provides 100% true positive rate (TPR) and 4.23% false positive rate (FPR) for the MitM attack and 100% TPR and 2.44% FPR for the deauthentication attack, which confirm the efficiency of the dynamic BPA generation methodology.
Overruns in transportation infrastructure projectsLove, P.E.D.; Sing, C-P.; Wang, X.; Irani, Zahir; Thwala, D.W. (2014)Transportation infrastructure projects are prone to cost and schedule overruns. At the time of contract award, a construction contingency budget is often used to accommodate for unplanned events such as scope changes. Recent empirical research has shown that rework during construction as a result of design changes, errors and omission are the major contributors of overruns in projects. The statistical characteristics of rework, and cost and schedule overruns that are experienced from a project's contract award for 58 Australian transportation infrastructure projects are analysed. Theoretical probability distributions are fitted to the rework, cost and schedule overrun data. Goodness of fit tests are used in conjunction with probability-probability (P-P) plots to compare the sample distribution from the known theoretical distribution. A Generalised Logistic probability density function is found to describe the behaviour of cost-overruns and provides the best overall distribution fit. The best fitting distribution for schedule overruns and rework data were the Four Parameter Burr and a Johnson SB distribution, respectively. The distributions are used to calculate the probability of rework, cost and schedule overruns being experienced. A case illustration is presented and discussed to demonstrate how the derived probabilities may be utilised in practice.