Related papers: Measurable lower bounds on concurrence
Minimizing divergence measures under a constraint is an important problem. We derive a sufficient condition that binary divergence measures provide lower bounds for symmetric divergence measures under a given triangular discrimination or…
We prove lower bounds for the entanglement of formation and the squashed entanglement for any a bipartite density matrix in terms of the conditional entropy of the bipartite state with respect to either of its partial traces, and prove that…
In this paper we investigate two different entanglement measures in the case of mixed states of two qubits. We prove that the negativity of a state can never exceed its concurrence and is always larger then $\sqrt{(1-C)^2+C^2}-(1-C)$ where…
We present an extension of the Wootters concurrence for the case of two qutrits in mixed states. The reduction of our extension to the case of two levels shows complete agreement with Wootters concurrence for two qubits. As an explicit…
We propose and examine several candidates for universal multipartite entanglement measures. The most promising candidate for applications needing entanglement in the full Hilbert space is the ent-concurrence, which detects all entanglement…
The parameterized entanglement monotone, the $q$-concurrence, is also a reasonable parameterized entanglement measure. By exploring the properties of the $q$-concurrence with respect to the positive partial transposition and realignment of…
For the maximal violation of all Bell inequalities by an arbitrary pure two-qudit state of any dimension, we derive a new lower bound expressed via the concurrence of this pure state. This new lower bound and the upper bound on the maximal…
Given two orthornormal bases A and B, the basic form of the entropic uncertainty principle is stated in terms of the sum of the Shannon entropies of the probabilities of measuring A and B onto a given quantum state. State independent lower…
We propose an entanglement measure for two qudits based on the covariances of a set of generators of the su(N) algebra. In particular, we represent this measure in terms of the mutually unbiased projectors for N prime. For pure states this…
Computing entanglement of an arbitrary bipartite or multipartite mixed state is in general not an easy task as it usually involves complex optimization. Here we show that exploiting symmetries of certain mixed states, we can compute a…
Multipartite entanglement is the premier resource for quantum technologies. Yet, its exact quantification in the laboratory is notoriously challenging, typically requiring the full knowledge of high dimensional quantum states. Here, we…
In this paper, I will derive a measure of entanglement that coincides with the generalized concurrence for a general pure bi-and three-partite state based on wedge product. I will show that a further generalization of this idea to a general…
We derive two lower bounds on entanglement of formation for arbitrary mixed Gaussian states by two distinct methods. To achieve the first one we use a local measurement procedure derived by Giedke et al [Quantum Inf. and Comp. vol.1, 79…
We study the fully entangled fraction of a quantum state. An upper bound is obtained for arbitrary bipartite system. This upper bound only depends on the Frobenius norm of the state.
We give an explicitly computable lower bound for the arithmetic self-intersection number of the dualizing sheaf on a large class of arithmetic surfaces. If some technical conditions are satisfied, then this lower bound is positive. In…
We study monogamy relations for arbitrary dimensional multipartite systems. Monogamy relations based on concurrence and concurrence of assistance for any dimensional $m_1\otimes m_2\otimes...\otimes m_{N}$ quantum states are derived, which…
We give an explicit tight lower bound for the entanglement of formation for arbitrary bipartite mixed states by using the convex hull construction of a certain function. This is achieved by revealing a novel connection among the…
We study generalized concurrences as a tool to detect the entanglement of bipartite quantum systems. By considering the case of 2 X 4 states of rank 2, we prove that generalized concurrences do not, in general, give a necessary and…
In this paper, we study the multipartite entanglement properties of graph states up to seven qubits. Our analysis shows that the generalized concurrence measure is more efficient than geometric entanglement measure for measuring…
In recent years much effort has been concentrated towards achieving polynomial time lower bounds on algorithms for solving various well-known problems. A useful technique for showing such lower bounds is to prove them conditionally based on…