SearcharxivSearch

arXiv subjects

Grant W. Allen

Publications and source records attributed to Grant W. Allen.

2 recordsLinked to original sources

Entanglement Constraints on States Locally Connected to the Greenberger-Horne-Zeilinger State

The multi-qubit GHZ state possesses tangles with elegant transformation properties under stochastic local operations and classical communication. Since almost all pure 3-qubit states are connected to the GHZ state via SLOCC, we derive a necessary and sufficient achievability inequality on arbitrary 3-qubit tangles, which is a strictly stronger constraint than both the monogamy inequality and the marginal eigenvalue inequality. We then show that entanglement shared with any single party in the n-qubit GHZ SLOCC equivalence class is precisely accounted for by the sum of its k-tangles, recently coined the strong monogamy equality, acknowledging competing but agreeing definitions of the k-tangle on this class, one of which is then computable for arbitrary mixed states. Strong monogamy is known to not hold arbitrarily, and so we introduce a unifying outlook on entanglement constraints in light of basic real algebraic geometry.

quant-ph

Polynomial Monogamy Relations for Entanglement Negativity

The notion of non-classical correlations is a powerful contrivance for explaining phenomena exhibited in quantum systems. It is well known, however, that quantum systems are not free to explore arbitrary correlations---the church of the smaller Hilbert space only accepts monogamous congregants. We demonstrate how to characterize the limits of what is quantum mechanically possible with a computable measure, entanglement negativity. We show that negativity only saturates the standard linear monogamy inequality in trivial cases implied by its monotonicity under LOCC, and derive a necessary and sufficient inequality which, for the first time, is a non-linear higher degree polynomial. For very large quantum systems, we prove that the negativity can be distributed at least linearly for the tightest constraint and conjecture that it is at most linear.

quant-ph