Quantum probabilities as Dempster-Shafer probabilities in the lattice of subspaces.
| dc.contributor.author | Vourdas, Apostolos | * |
| dc.date.accessioned | 2016-01-08T15:35:03Z | |
| dc.date.available | 2016-01-08T15:35:03Z | |
| dc.date.issued | 2014-08 | |
| dc.identifier.citation | Vourdas A (2015) Quantum probabilities as Dempster-Shafer probabilities in the lattice of subspaces. Journal of Mathematical Physics, 55(8): 082107. | en_US |
| dc.identifier.uri | http://hdl.handle.net/10454/7647 | |
| dc.description | yes | en_US |
| dc.description.abstract | The 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. | en_US |
| dc.language.iso | en | en_US |
| dc.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. | en_US |
| dc.subject | Quantum probabilities; Dempster-Shafer probabilities; Hilbert space; Probability theory; Inequalities; Noncommutative field theory | en_US |
| dc.title | Quantum probabilities as Dempster-Shafer probabilities in the lattice of subspaces. | en_US |
| dc.status.refereed | yes | en_US |
| dc.type | Article | en_US |
| dc.type.version | Accepted Manuscript | en_US |
| dc.identifier.doi | https://doi.org/10.1063/1.4891972 | |
| refterms.dateFOA | 2018-07-25T13:53:40Z | |
| dc.date.accepted | 2014-07-21 |
Item file(s)
This item appears in the following Collection(s)
Related items
Showing items related by title, author, creator and subject.
-
Lower and upper probabilities in the distributive lattice of subsystemsThe 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 detectionThe 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.
-
Two-dimensional Markov chain model for performance analysis of call admission control algorithm in heterogeneous wireless networksThis paper proposes a novel call admission control (CAC) algorithm and develops a two-dimensional markov chain processes (MCP) analytical model to evaluate its performance for heterogeneous wireless network. Within the context of this paper, a hybrid UMTS-WLAN network is investigated. The designed threshold-based CAC algorithm is launched basing on the user’s classification and channel allocation policy. In this approach, channels are assigned dynamically in accordance with user class differentiation. The two-dimensional MCP mathematical analytic method reflects the system performance by appraising the dropping likelihood of handover traffics. The results show that the new CAC algorithm increases the admission probability of handover traffics, while guarantees the system quality of service (QoS) requirement.
