Related papers: Canonical Form and Separability of PPT States on M…
The problem of determining whether a given quantum state is entangled lies at the heart of quantum information processing, which is known to be an NP-hard problem in general. Despite the proposed many methods such as the positive partial…
We compute the probability that a bipartite quantum state is separable by Monte Carlo sampling. This is carried out for rebits, qubits and quaterbits. We sampled $5\times 10^{11}$ points for each of these three cases. The results strongly…
Separability of quantum states is analyzed with the use of the Choi-Jamiolkowski isomorphism. Spectral separability criteria are derived. The presented approach is illustrated with various examples, among which a separable decomposition of…
The set of all separable quantum states is compact and convex. We focus on the two-qubit quanum system and study the boundary of the set. Then we give the criterion to determine whether a separable state is on the boundary. Some…
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…
An arbitrary quantum-optical process (channel) can be completely characterized by probing it with coherent states using the recently developed coherent-state quantum process tomography (QPT) [Lobino et al., Science 322, 563 (2008)]. In…
A set of quantum states can be unambiguously discriminated if and only if they are linearly independent. However, for a linearly dependent set, if C copies of the state are available, then the resulting C particle states may form a linearly…
Determining whether a quantum state is separable or entangled is a problem of fundamental importance in quantum information science. This is a brief review in which we consider the problem for states in infinite dimensional Hilbert spaces.…
We show how to design families of operational criteria that distinguish entangled from separable quantum states. The simplest of these tests corresponds to the well-known Peres-Horodecki positive partial transpose (PPT) criterion, and the…
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…
In view of the photon-number tomograms of two-mode light states, using the qubit-portrait method for studying the probability distributions with infinite outputs, the separability and entanglement detection of the states are studied.…
Given two sets finite $S_0$ and $S_1$ of quantum states. We show necessary and sufficient conditions for distinguishing them by a measurement.
Quantum states that remain separable (i.e., not entangled) under any global unitary transformation are known as absolutely separable and form a convex set. Despite extensive efforts, the complete characterization of this set remains largely…
We present separability criteria for both bipartite and multipartite quantum states. These criteria include the criteria based on the correlation matrix and its generalized form as special cases. We show by detailed examples that our…
We study the distinguishability of a particular type of maximally entangled states -- the "lattice states" using a new approach of semidefinite program. With this, we successfully construct all sets of four ququad-ququad orthogonal…
We present a quantum extension of a version of Sanov's theorem focussing on a hypothesis testing aspect of the theorem: There exists a sequence of typical subspaces for a given set $\Psi$ of stationary quantum product states asymptotically…
We introduce algebraic sets in the products of complex projective spaces for the mixed states in multipartite quantum systems as their invariants under local unitary operations. The algebraic sets have to be the union of the linear…
For quantum systems with a total dimension greater than six, the positive partial transposition (PPT) criterion is sufficient but not necessary to decide the non-separability of quantum states. Here, we present an Automated Machine Learning…
Probabilistic quantum state transformations can be characterized by the degree of state separation they provide. This, in turn, sets limits on the success rate of these transformations. We consider optimum state separation of two known pure…
Quantum entanglement is the core resource in quantum information processing and quantum computing. It is an significant challenge to effectively characterize the entanglement of quantum states. Recently, elegant separability criterion is…