Topics in matrix analysis
The Kronecker product in approximation and fast transform generation
The Kronecker product in approximation and fast transform generation
Quantum computation and quantum information
Quantum computation and quantum information
Quantum Information: An Introduction to Basic Theoretical Concepts and Experiments
Quantum Information: An Introduction to Basic Theoretical Concepts and Experiments
The Physics of Quantum Information: Quantum Cryptography, Quantum Teleportation, Quantum Computation
The Physics of Quantum Information: Quantum Cryptography, Quantum Teleportation, Quantum Computation
On Duality between Quantum Maps and Quantum States
Open Systems & Information Dynamics
Combinatorial laplacians and positivity under partial transpose
Mathematical Structures in Computer Science
Computable constraints on entanglement-sharing of multipartite quantum states
Quantum Information & Computation
Local invariants for multi-partite entangled states allowing for a simple entanglement criterion
Quantum Information & Computation
On independent permutation separability criteria
Quantum Information & Computation
Computational complexity of the quantum separability problem
Quantum Information & Computation
Separability criteria based on the bloch representation of density matrices
Quantum Information & Computation
Matrix rearrangement approach for the entangling power with hybrid qudit systems
Quantum Information & Computation
An analytic approach to the problem of separability of quantum states based upon the theory of cones
Quantum Information Processing
Entanglement detection and distillation for arbitrary bipartite systems
Quantum Information Processing
Realignment entanglement criterion of phase damped Gaussian states
Quantum Information Processing
Quantum Information Processing
| Hi-index | 0.00 |
Motivated by the Kronecker product approximation technique, we have developed a very simple method to assess the inseparability of bipartite quantum systems, which is based on a realigned matrix constructed from the density matrix. For any separable state, the sum of the singular values of the matrix should be less than or equal to 1. This condition provides a very simple, computable necessary criterion for separability, and shows powerful ability to identify most bound entangled states discussed in the literature. As a byproduct of the criterion, we give an estimate for the degree of entanglement of the quantum state.