Related papers: Channel-state duality and the separability problem
The purpose of this paper is to obtain a sufficient and necessary condition as a criteria to test whether an arbitrary multipartite state is entangled or not. Based on the tensor expression of a multipartite pure state, the paper shows that…
Compatibility conditions of quantum channels featuring symmetry through covariance are studied. Compatibility here means the possibility of obtaining two or more channels through partial trace out of a broadcasting channel. We see that…
We analyse the problem of distillation of entanglement of mixed states in higher dimensional compound systems. Employing the positive maps method [M. Horodecki et al., Phys. Lett. A 223 1 (1996)] we introduce and analyse a criterion of…
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.…
Determining whether a quantum state is separable or entangled is a problem of fundamental importance in quantum information science. It has recently been shown that this problem is NP-hard. There is a highly inefficient `basic algorithm'…
Quantum state elimination measurements tell us what states a quantum system does not have. This is different from state discrimination, where one tries to determine what the state of a quantum system is, rather than what it is not. Apart…
We present a scheme of remote preparation of the two-particle state by using two Einstein-Podolsky-Rosen pairs or two partial entangled two-particle states as the quantum channel. The probability of the successful remote state preparation…
We propose an interpretation of quantum separability based on a physical principle: local time reversal. It immediately leads to a simple characterization of separable quantum states that reproduces results known to hold for binary…
The quantum formalism permits one to discriminate sometimes between any set of linearly-independent pure states with certainty. We obtain the maximum probability with which a set of equally-likely, symmetric, linearly-independent states can…
We map the quantum entanglement problem onto the mathematically well-studied truncated moment problem. This yields a necessary and sufficient condition for separability that can be checked by a hierarchy of semi-definite programs. The…
Given a finite set of linearly independent quantum states, an observer who examines a single quantum system may sometimes identify its state with certainty. However, unless these quantum states are orthogonal, there is a finite probability…
It is pointed out that separability problem for arbitrary multi-partite states can be fully solved by a finite size, elementary recursive algorithm. In the worse case scenario, the underlying numerical procedure, may grow doubly…
The computational problem of distinguishing two quantum channels is central to quantum computing. It is a generalization of the well-known satisfiability problem from classical to quantum computation. This problem is shown to be…
Based on the concept of chi-matrix and Choi-Jamiolkowski states we develop the approach of quantum process reconstruction. Special attention is paid to the adequacy of applied reconstruction models. The approach is applied to the…
We study the quantum separability problem by using general symmetric informationally complete measurements and present a separability criterion for arbitrary dimensional bipartite systems. We show by detailed examples that our criterion is…
Recently, Girolami and Adesso have demonstrated that the calculation of quantum discord for two-qubit case can be viewed as to solve a pair of transcendental equation (Phys. Rev. A, {\bf 83}, 052108(2011)). In present work, we introduce the…
Employing a recently proposed separability criterion we develop analytical lower bounds for the concurrence and for the entanglement of formation of bipartite quantum systems. The separability criterion is based on a nondecomposable…
We investigate separability and entanglement of mixed states in ${\cal C}^2\otimes{\cal C}^2\otimes{\cal C}^N$ three party quantum systems. We show that all states with positive partial transposes that have rank $\le N$ are separable. For…
We study the distinguishability of multipartite quantum states by separable operations. We first present a necessary and sufficient condition for a finite set of orthogonal quantum states to be distinguishable by separable operations. An…
After introducing the partially separable concept, we proved the equivalence between the partial separability of a given $m$-partite subsystem with $m$ qubits and the purity of states of this $m$-partite subsystem for a pure state in…