Detection of the quantum states containing at most $k-1$ unentangled particles

Abstract

There are many different classifications of entanglement for multipartite quantum systems, one of which is based on the number of unentangled particles. In this paper, we mainly study the quantum states containing at most $k-1$ unentangled particles and provide several entanglement criteria based on different forms of inequalities which can both identify quantum states containing at most $k-1$ unentangled particles. We show that these criteria are more effective for some states by concrete examples.

References in corpus (19)

• Quantum entanglement
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Entanglement detection
• Geometric measure of entanglement and applications to bipartite and multipartite quantum states
• Multipartite entanglement and high precision metrology
• Decoherence and multipartite entanglement
• Entanglement Certification $-$ From Theory to Experiment
• Measure of genuine multipartite entanglement with computable lower bounds
• Multipartite entanglement in spin chains
• Spin squeezing and entanglement
• Optimal Controlled Teleportation
• On the permutationally invariant part of a density matrix and nonseparability of N-qubit states
• Measure of multipartite entanglement with computable lower bounds
• Detection of genuinely entangled and non-separable $n$-partite quantum states
• Efficient $k$-separability criteria for mixed multipartite quantum states
• Separability criteria via sets of mutually unbiased measurements
• A unified approach to entanglement criteria using the Cauchy-Schwarz and Hölder inequalities
• Separability criteria via some classes of measurements
• Separability criteria based on Heisenberg-Weyl representation of density matrices