Skip to main page content
U.S. flag

An official website of the United States government

Dot gov

The .gov means it’s official.
Federal government websites often end in .gov or .mil. Before sharing sensitive information, make sure you’re on a federal government site.

Https

The site is secure.
The https:// ensures that you are connecting to the official website and that any information you provide is encrypted and transmitted securely.

Access keys NCBI Homepage MyNCBI Homepage Main Content Main Navigation
. 2023 Mar 21;13(1):4601.
doi: 10.1038/s41598-023-31273-9.

Negativity vs. purity and entropy in witnessing entanglement

Affiliations

Negativity vs. purity and entropy in witnessing entanglement

James Schneeloch et al. Sci Rep. .

Abstract

In this paper, we explore the value of measures of mixedness in witnessing entanglement. While all measures of mixedness may be used to witness entanglement, we show that all such entangled states must have a negative partial transpose (NPT). Where the experimental resources needed to determine this negativity scale poorly at high dimension, we compare different measures of mixedness over both Haar-uniform and uniform-purity ensembles of joint quantum states at varying dimension to gauge their relative success at witnessing entanglement. In doing so, we find that comparing joint and marginal purities is overwhelmingly (albeit not exclusively) more successful at identifying entanglement than comparing joint and marginal von Neumann entropies, in spite of requiring fewer resources. We conclude by showing how our results impact the fundamental relationship between correlation and entanglement and related witnesses.

PubMed Disclaimer

Conflict of interest statement

The authors declare no competing interests.

Figures

Figure 1
Figure 1
(Top) Scatterplots of S2(A|B) vs S1(A|B) and respective purity histograms for 106 2-quDit systems for D=(2,3,5,8,10) with each plot labeled 22, 33, 55, 88,and 1010, respectively. The light orange scatterplots are from the fully uniform ensemble (abbreviated UE) while the blue scatterplots are from the ensemble uniform with respect to purity (abbreviated UP). The inset histograms are of the joint purity of the fully uniform ensemble). The red dotted line in each plot is where S1(A|B)=S2(A|B). The set of all DD pure states is within the green serrated blade region in the lower left quadrant (or is only a single curve for 22), while the set of all DD states with maximally mixed marginals corresponds to the large magenta serrated blade spanning three quadrants of the plot. The regions enclosed between the two blades also correspond to valid density matrices. (Bottom) This table gives the percentages of the total number of generated states whose entanglement was witnessed with the function in the first column.
Figure 2
Figure 2
Plots showing different conditional entropy functions (and the negativity) for uniform-purity ensembles as a function of joint purity. (Left) Case of 33 systems. (Right) Case of 1010 systems. Narrow curves of the same color plot the corresponding function of the Werner state whose purity is varied by changing the mixing parameter p. Note that the Werner state curves for negative the log negativity -EN(ρ^) coincide with the conditional min entropy S(A|B) where entanglement is witnessed.
Figure 3
Figure 3
Plot showing percentages of 60-dimensional joint systems sampled according to the uniform-purity ensemble, whose entanglement was witnessed by comparing different forms of joint and marginal entropies, and by the negativity of the partial transpose. These systems were bipartitioned into subsystems of dimensions DA and DB respectively, such that DADB=60. Starting with 106 random diagonal density matrices, different random unitaries were performed for each possible bipartition to generate the full ensemble of density matrices analyzed here. The entanglement-success percentages are plotted as a function of DB. The vertical axis denotes the different entanglement witnesses used, and in particular, that we are conditioning on subsystem B.

References

    1. Feynman RP. Quantum mechanical computers. Found. Phys. 1986;16:507–532. doi: 10.1007/BF01886518. - DOI
    1. Knill, E., Laflamme, R. & Milburn, G. J. A scheme for efficient quantum computation with linear optics. Nature409, 46–52 (2001). - PubMed
    1. Bharti K, et al. Noisy intermediate-scale quantum algorithms. Rev. Mod. Phys. 2022;94:015004. doi: 10.1103/RevModPhys.94.015004. - DOI
    1. Bennett CH, et al. Teleporting an unknown quantum state via dual classical and einstein-podolsky-rosen channels. Phys. Rev. Lett. 1993;70:1895–1899. doi: 10.1103/PhysRevLett.70.1895. - DOI - PubMed
    1. Ekert AK. Quantum cryptography based on bell’s theorem. Phys. Rev. Lett. 1991;67:661–663. doi: 10.1103/PhysRevLett.67.661. - DOI - PubMed