Related papers: Lower Bounds of Concurrence for Tripartite Quantum…
For a given pure state of multipartite system, the concurrence vector is defined by employing the defining representation of generators of the corresponding rotation groups. The norm of concurrence vector is considered as a measure of…
Quantum coherence is the most fundamental of all quantum quantifiers, underlying other well-known quantities such as entanglement, quantum discord, and Bell correlations. It can be distributed in a multipartite system in various ways -- for…
The possibility to explain quantum correlations via (possibly) unknown causal influences propagating gradually and continuously at a finite speed v > c has attracted a lot of attention recently. In particular, it could be shown that this…
We present a classification of three-qubit states based in their three-qubit and reduced two-qubit entanglements. For pure states these criteria can be easily implemented, and the different types can be related with sets of equivalence…
The bounds of concurrence in [F. Mintert and A. Buchleitner, Phys. Rev. Lett. 98 (2007) 140505] and [C. Zhang \textit{et. al.}, Phys. Rev. A 78 (2008) 042308] are proved by using two properties of the fidelity. In two-qubit systems, for a…
The quantum marginal problem asks, given a set of reduced quantum states of a multipartite system, whether there exists a joint quantum state consistent with these reduced states. The quantum marginal problem is known to be hard to solve in…
We study the role of average concurrence in entanglement swapping in quantum networks. We begin with qubit pure states, and there is a very simple rule governing the propagation of average concurrence in multiple swaps. We look at examples…
We provide an analytical tripartite-study from the generalized $R$-matrix. It provides the upper bound of the maximum violation of Mermin's inequality. For a generic 2-qubit pure state, the concurrence or $R$-matrix characterizes the…
We consider an arbitrary d_{1}\otimes d_{2}\otimes ... \otimes d_{N} composite quantum system and find necessary conditions for general m-party subsystem states to be the reduced states of a common N-party state. These conditions will lead…
We prove a powerful theorem for tripartite remote entanglement distribution protocols that establishes an upper bound on the amount of entanglement of formation that can be created between two single-qubit nodes of a quantum network. Our…
In this paper, an intuitive approach is employed to generalize the full separability criterion of tripartite quantum states of qubits to the higher-dimensional systems (Phys. Rev. A \textbf{72}, 022333 (2005)). A distinct characteristic of…
Entanglement monotones, such as the concurrence, are useful tools to characterize quantum correlations in various physical systems. The computation of the concurrence involves, however, difficult optimizations and only for the simplest case…
We introduce the notion of quantum dissension for a three-qubit system as a measure of quantum correlations. We use three equivalent expressions of three-variable mutual information. Their differences can be zero classically but not so in…
Entanglement is one of important resources for quantum communication tasks. Most of results are focused on qubit entanglement. Our goal in this work is to characterize the multipartite high-dimensional entanglement. We firstly derive an…
A simplified expression of concurrence for two-qubit mixed state having no more than three non-vanishing eigenvalues is obtained. Basing on SU(2) coherent states, the amount of entanglement of two-qubit pure states is studied and conditions…
We propose a new method for proving lower bounds on quantum query algorithms. Instead of a classical adversary that runs the algorithm with one input and then modifies the input, we use a quantum adversary that runs the algorithm with a…
We consider the unambiguous discrimination of multipartite quantum states and provide an upper bound for the maximum success probability of optimal local discrimination. We also provide a necessary and sufficient condition to realize the…
For a system randomly prepared in a number of quantum states, we present a lower bound for the distinguishability of the quantum states, that is, the success probability of determining the states in the form of entropy. When the states are…
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…
By considering quantum computation as a communication process, we relate its efficiency to a communication capacity. This formalism allows us to rederive lower bounds on the complexity of search algorithms. It also enables us to link the…