Covariance matrix entanglement criterion for an arbitrary set of operators
Vinay Tripathi, Chandrashekar Radhakrishnan, Tim Byrnes

TL;DR
This paper introduces a versatile covariance matrix-based entanglement detection method applicable to arbitrary operator sets, scalable to high-dimensional systems, and demonstrated on spin ensembles.
Contribution
It generalizes covariance matrix entanglement criteria to arbitrary operators, independent of basis and commutation relations, with efficient computation for high-dimensional systems.
Findings
Detects entanglement in a basis-independent manner
Efficiently scales with the number of operators, not Hilbert space dimension
Successfully applied to two spin ensembles
Abstract
We generalize entanglement detection with covariance matrices for an arbitrary set of observables. A generalized uncertainty relation is constructed using the covariance and commutation matrices, then a criterion is established by performing a partial transposition on the operators. The method is highly efficient and versatile in the sense that the set of measurement operators can be freely chosen, do not need to be complete, and there is no constraint on the commutation relations. The method is particularly suited for systems with higher dimensionality since the computations do not scale with the dimension of the Hilbert space rather they scale with the number of chosen observables which can always be kept small. We illustrate the approach by examining the entanglement between two spin ensembles, and show that it detects entanglement in a basis independent way.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
