Pith. sign in

REVIEW 1 cited by

Robustness of entanglement

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv quant-ph/9806094 v1 pith:QV263PAO submitted 1998-06-29 quant-ph

Robustness of entanglement

classification quant-ph
keywords entanglementstatesrobustnessanalyticalbinaryfinitemagnitudemixed
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

In the quest of completely describing entanglement in the general case of a finite number of parties sharing a physical system of finite dimensional Hilbert space a new entanglement magnitude is introduced for its pure and mixed states: robustness. It corresponds to the minimal amount of mixing with locally prepared states which washes out all entanglement. It quantifies in a sense the endurence of entanglement against noise and jamming. Its properties are studied comprehensively. Analytical expressions for the robustness are given for pure states of binary systems, and analytical bounds for mixed states of binary systems. Specific results are obtained mainly for the qubit-qubit system. As byproducts local pseudomixtures are generalized, a lower bound for the relative volume of separable states is deduced and arguments for considering convexity a necessary condition of any entanglement magnitude are put forward.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Distribution Complexity of Electronic Structure Simulations on Quantum Supercomputers

    quant-ph 2026-06 unverdicted novelty 5.0

    An algorithm is presented for estimating distribution complexity of electronic structure Hamiltonians, with O(N^3) entanglement estimation per fragment and quadratic/exponential reductions in distribution cost for qua...