Pith. sign in

REVIEW 1 cited by

The asymptotic spectrum of LOCC transformations

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 1807.05130 v3 pith:P6STDJ7D submitted 2018-07-13 quant-ph cs.ITmath-phmath.ITmath.MP

classification quant-phcs.ITmath-phmath.ITmath.MP
keywords asymptoticspectrumratestatestatesbipartiteconverseerror
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We study exact, non-deterministic conversion of multipartite pure quantum states into one-another via local operations and classical communication (LOCC) and asymptotic entanglement transformation under such channels. In particular, we consider the maximal number of copies of any given target state that can be extracted exactly from many copies of any given initial state as a function of the exponential decay in success probability, known as the converese error exponent. We give a formula for the optimal rate presented as an infimum over the asymptotic spectrum of LOCC conversion. A full understanding of exact asymptotic extraction rates between pure states in the converse regime thus depends on a full understanding of this spectrum. We present a characterisation of spectral points and use it to describe the spectrum in the bipartite case. This leads to a full description of the spectrum and thus an explicit formula for the asymptotic extraction rate between pure bipartite states, given a converse error exponent. This extends the result on entanglement concentration in [Hayashi et al, 2003], where the target state is fixed as the Bell state. In the limit of vanishing converse error exponent the rate formula provides an upper bound on the exact asymptotic extraction rate between two states, when the probability of success goes to 1. In the bipartite case we prove that this bound holds with equality.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Error exponents for tripartite-to-bipartite entanglement transformations

    quant-ph 2025-07 accept novelty 7.0 of 10

    For pure tripartite states, the optimal deterministic rate is the minimum of two min-entropies of entanglement, and the direct and strong converse error exponents are given by explicit rate formulas.

Pith tools