Dakic, Vedral and Brukner [Physical Review Letters \tf{105},190502 (2010)] gave a geometric measure of quantum discord in a bipartite quantum state as the distance of the state from the closest classical quantum (or zero discord) state and derived an explicit formula for a two qubit state. Further, S.Luo and S.Fu [Physical Review A \tf{82}, 034302 (2010)] obtained a generic form of this geometric measure for a general bipartite state and established a lower bound. In this brief report we obtain a rigorous lower bound to the geometric measure of quantum discord in a general bipartite state which dominates that obtained by S.Luo and S.Fu.Comment: 10 pages,2 figures. In the previous versions, a constraint was ignored while optimizing the second term in Eq.(5), in which case, only a lower bound on the geometric discord can be obtained. The title is also consequently changed. Accepted in Phys.Rev.

We give a new separability criterion, a necessary condition for separability of N-partite quantum states. The criterion is based on the Bloch representation of a N-partite quantum state and makes use of multilinear algebra, in particular, the matrization of tensors. Our criterion applies to arbitrary N-partite quantum states in $\mathcal{H}=\mathcal{H}^{d_1}\otimes \mathcal{H}^{d_2} \otimes \cdots \otimes \mathcal{H}^{d_N}.$ The criterion can test whether a N-partite state is entangled and can be applied to different partitions of the $N$-partite system. We provide examples that show the ability of this criterion to detect entanglement. We show that this criterion can detect bound entangled states. We prove a sufficiency condition for separability of a 3-partite state, straightforwardly generalizable to the case N > 3, under certain condition. We also give a necessary and sufficient condition for separability of a class of N-qubit states which includes N-qubit PPT states.

Recently, the principle of non-violation of Information Causality [Nature 461, 1101[Nature 461, (2009], has been proposed as one of the foundational properties of nature. We explore the Hardy's non-locality theorem for two qubit systems, in the context of generalized probability theory, restricted by the principle of non-violation of Information Causality. Applying, a sufficient condition for Information causality violation, we derive an upper bound on the maximum success probability of Hardy's nonlocality argument. We find that the bound achieved here is higher than that allowed by quantum mechanics, but still much less than what the no-signalling condition permits. We also study the Cabello type non-locality argument (a generalization of Hardy's argument) in this context.

No abstract

Here we deal with a nonlocality argument proposed by Cabello, which is more general than Hardy's nonlocality argument, but still maximally entangled states do not respond. However, for most of the other entangled states, maximum probability of success of this argument is more than that of the Hardy's argument.