Related papers: Separability criterion for three-qubit states with…
We consider the optimal discrimination of nonorthogonal qubit states with post-measurement information and provide an analytic structure of the optimal measurements. We also show that there is always a null optimal measurement when…
In tri-partite systems, there are three basic biseparability, $A$-$BC$, $B$-$CA$ and $C$-$AB$ biseparability according to bipartitions of local systems. We begin with three convex sets consisting of these basic biseparable states in the…
By combining a parameterized Hermitian matrix, the realignment matrix of the bipartite density matrix $\rho$ and the vectorization of its reduced density matrices, we present a family of separability criteria, which are stronger than the…
Using a recently introduced framework, we derive criteria for quantum k-separability, which are very easily computed. In the case k = 2, our criteria are equally strong to the best methods known so far, while in all other cases there are…
Mutually unbiased measurements (MUMs) are generalized from the concept of mutually unbiased bases (MUBs) and include the complete set of MUBs as a special case, but they are superior to MUBs as they do not need to be rank one projectors. We…
Quantum discord quantifies quantum correlations beyond entanglement and assumes nonzero values, which are notoriously hard to compute, for almost all quantum states. Here we provide computable tight bounds for the quantum discord for…
We reduce the question whether a given quantum mixed state is separable or entangled to the problem of existence of a certain full family of commuting normal matrices whose matrix elements are partially determined by components of the pure…
We construct one parameter families of three qubit separable states with length ten, which is strictly greater than the whole dimension eight. These states are located on the boundary of the convex set of all separable states, but they are…
Inspired by the realignment or computable cross norm criterion, we present a new result about the characterization of quantum entanglement. Precisely, an interesting class of inequalities satisfied by all separable states of a bipartite…
The separability detecting problem of mixed states is one of the fundamental problems in quantum information theory. In the last 20 years, almost all methods are based on the sufficient or necessary conditions for entanglement. However, in…
We discuss sequential unambiguous state-discrimination measurements performed on the same qubit. Alice prepares a qubit in one of two possible states. The qubit is first sent to Bob, who measures it, and then on to Charlie, who also…
Quantum entanglement has been regarded as one of the key physical resources in quantum information sciences. However, the determination of whether a mixed state is entangled or not is generally a hard issue, even for the bipartite system.…
We show a geometric formulation for minimum-error discrimination of qubit states, that can be applied to arbitrary sets of qubit states given with arbitrary a priori probabilities. In particular, when qubit states are given with equal…
In order to classify partial entanglement of multi-partite states, it is natural to consider the convex hulls, intersections and differences of basic convex cones obtained from partially separable states with respect to partitions of…
To decide whether a quantum channel is degradable is relatively easy: one has to find at least one example of a degrading quantum channel. But in general, no conclusive criterion exists to show the opposite. Using elementary methods we…
We present a criterion, based on three commutator relations, that allows to decide whether two self-adjoint matrices with non-overlapping support are simultaneously unitarily similar to quasidiagonal matrices, i.e., whether they can be…
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…
We analyze the separability properties of density operators supported on $\C^2\otimes \C^N$ whose partial transposes are positive operators. We show that if the rank of $\rho$ equals N then it is separable, and that bound entangled states…
We use the generalized concurrence approach to investigate the general multipartite separability problem. By extending the preconcurrence matrix formalism to arbitrary multipartite systems, we show that the separability problem can be…
The computable cross norm (CCN) criterion is a new powerful analytical and computable separability criterion for bipartite quantum states, that is also known to systematically detect bound entanglement. In certain aspects this criterion…