Numerical evidence for a bipartite pure state entanglement witness from approximate analytical diagonalization
Paul M. Alsing, Richard J. Birrittella

TL;DR
This paper introduces a numerical method to estimate bipartite pure state entanglement using an approximate analytical diagonalization that simplifies calculations and relates directly to the Log Negativity, providing exact results for certain classes of states.
Contribution
It presents a new approximate analytical diagonalization technique to evaluate entanglement witnesses directly from wavefunction coefficients, avoiding eigenvalue computations.
Findings
The entanglement witness exactly matches Log Negativity for pure states with positive Hermitian amplitude matrices.
The approximate Log Negativity formula provides a lower bound for general states and is exact for two-qubit pure states.
The method extends to certain mixed states, maintaining exactness for specific pure state decompositions.
Abstract
We show numerical evidence for a bipartite pure state entanglement witness that is readily calculated from the wavefunction coefficients directly, without the need for the numerical computation of eigenvalues. This is accomplished by using an approximate analytic diagonalization of the bipartite state that captures dominant contributions to the negativity of the partially transposed state. We relate this entanglement witness to the Log Negativity, and show that it exactly agrees with it for the class of pure states whose quantum amplitudes form a positive Hermitian matrix. In this case, the Log Negativity is given by the negative logarithm of the purity of the amplitudes consider as a density matrix. In other cases, the witness forms a lower bound to the exact, numerically computed Log Negativity. The formula for the approximate Log Negativity achieves equality with the…
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.
Taxonomy
TopicsQuantum Information and Cryptography · Quantum Mechanics and Applications · Quantum Computing Algorithms and Architecture
