# Entanglement Detection: Complexity and Shannon Entropic Criteria

@article{Huang2013EntanglementDC, title={Entanglement Detection: Complexity and Shannon Entropic Criteria}, author={Yichen Huang}, journal={IEEE Transactions on Information Theory}, year={2013}, volume={59}, pages={6774-6778} }

Entanglement plays a key role in quantum information. The separability problem arises: how to prove that a given quantum state is entangled? Covariance-matrix-based entanglement criteria are the most important and widely used approach to this problem in continuous variable systems. Here, the separability problem is systematically studied in the more experimentally realistic setting that the questioned state is only partly known. A simple general formalism is proposed for this variant of the…

## 14 Citations

On Generalized Stam Inequalities and Fisher-Rényi Complexity Measures

- Computer ScienceEntropy
- 2017

This paper introduces a three-parametric Fisher–Renyi complexity, named (p, β, λ)-Fisher–Ren Yi complexity, based on both a two-parametic extension of the Fisher information and the Renyi entropies of a probability density function ρ characteristic of the system, and determines the distribution that saturates the inequality.

Open-system dynamics of entanglement:a key issues review

- PhysicsReports on progress in physics. Physical Society
- 2015

An overview of recent theoretical and experimental efforts to underpin the dynamics of entanglement under the influence of noise is presented, and how it evolves due to the unavoidable interaction of the entangled system with its surroundings is surveyed.

Computing quantum discord is NP-complete

- Computer Science, Physics
- 2014

The computational complexity of quantum discord is studied, and the NP-completeness of two typical problems are proved: linear optimization over classical states and detecting classical states in a convex set, providing evidence that working with classical states is generically intractable.

Continuous-variable entropic uncertainty relations

- PhysicsJournal of Physics A: Mathematical and Theoretical
- 2019

Uncertainty relations are central to quantum physics. While they were originally formulated in terms of variances, they have later been successfully expressed with entropies following the advent of…

Classical simulation of quantum many-body systems

- Physics
- 2015

Classical simulation of quantum many-body systems is in general a challenging problem for the simple reason that the dimension of the Hilbert space grows exponentially with the system size. In…

Rényi and Tsallis formulations of separability conditions in finite dimensions

- Computer ScienceQuantum Inf. Process.
- 2017

New approach based on the convolution of discrete probability distributions of Maassen–Uffink type as well as majorization relations to derive separability conditions for local measurements with a special structure, such as mutually unbiased bases and symmetric informationally complete measurements.

Wehrl entropy, entropic uncertainty relations, and entanglement

- PhysicsPhysical Review A
- 2021

The Wehrl entropy is an entropy associated to the Husimi quasi-probability distribution. We discuss how it can be used to formulate entropic uncertainty relations and for a quantification of…

A family of generalized quantum entropies: definition and properties

- Computer ScienceQuantum Inf. Process.
- 2016

A quantum version of the generalized generalized entropies, introduced by Salicrú et al, is presented and it is exhibited that majorization plays a key role in explaining most of their common features.

Non-Gaussian entanglement in gravitating masses: The role of cumulants

- PhysicsPhysical Review D
- 2022

We develop an entanglement criterion with thirdand fourth-order cumulants to detect the entanglement of non-Gaussian states. The efficiency of the entanglement criterion is investigated for…

Entanglement and squeezing in continuous-variable systems

- Physics
- 2017

We introduce a multi-mode squeezing coefficient to characterize entanglement in $N$-partite continuous-variable systems. The coefficient relates to the squeezing of collective observables in the…

## References

SHOWING 1-10 OF 45 REFERENCES

Computational complexity of the quantum separability problem

- Computer ScienceQuantum Inf. Comput.
- 2007

This paper gives the first systematic and comprehensive treatment of this (bipartite) quantum separability problem, focusing on its deterministic computational complexity.

Optimal entanglement witnesses for continuous-variable systems

- Mathematics
- 2006

This paper is concerned with all tests for continuous-variable entanglement that arise from linear combinations of second moments or variances of canonical coordinates, as they are commonly used in…

Detecting entanglement with partial state information

- Physics
- 2012

We introduce a sequence of numerical tests that can determine the entanglement or separability of a state even when there is not enough information to completely determine its density matrix. Given…

Quantum entanglement beyond Gaussian criteria

- PhysicsProceedings of the National Academy of Sciences
- 2009

The experimental observation of genuine non-Gaussian entanglement using spatially entangled photon pairs is reported, which shows that the photons exhibit a variety ofEntanglement that cannot be reproduced by Gaussian states.

Strong NP-hardness of the quantum separability problem

- MathematicsQuantum Inf. Comput.
- 2010

An immediate lower bound on the maximum distance between abound entangled state and the separable set is shown and NP-hardness for the problem of determining whether a completely positive trace-preserving linearmap is entanglement-breaking is extended to an inverse polynomial distance.

Classical deterministic complexity of Edmonds' Problem and quantum entanglement

- MathematicsSTOC '03
- 2003

It turns out that one of the most important cases when Edmonds' problem can be solved in polynomial deterministic time, i.e. an intersection of two geometric matroids, corresponds to unentangled (aka separable) bipartite density matrices.

Family of continuous-variable entanglement criteria using general entropy functions

- Physics, Computer Science
- 2011

We derive a family of entanglement criteria for continuous-variable systems based on the Renyi entropy of complementary distributions. We show that these entanglement witnesses can be more sensitive…

Entropic entanglement criteria for continuous variables.

- Mathematics, PhysicsPhysical review letters
- 2009

We derive several entanglement criteria for bipartite continuous variable quantum systems based on the Shannon entropy. These criteria are more sensitive than those involving only second-order…

Unitarily localizable entanglement of gaussian states

- Physics
- 2005

We consider generic (mxn)-mode bipartitions of continuous-variable systems, and study the associated bisymmetric multimode Gaussian states. They are defined as (m+n)-mode Gaussian states invariant…

Quantum information with continuous variables

- PhysicsConference Digest. 2000 International Quantum Electronics Conference (Cat. No.00TH8504)
- 2000

This work discusses new work that shows how entanglement of the Bell-type can be observed in continuous variable, homodyne measurement schemes, and contrasts the various classical limits which emerge from the different ways of assessing teleportation.