Error exponents for entanglement concentration

Abstract

Consider entanglement concentration schemes that convert n identical copies of a pure state into a maximally entangled state of a desired size with success probability being close to one in the asymptotic limit. We give the distillable entanglement, the number of Bell pairs distilled per copy, as a function of an error exponent, which represents the rate of decrease in failure probability as n tends to infinity. The formula fills the gap between the least upper bound of distillable entanglement in probabilistic concentration, which is the well-known entropy of entanglement, and the maximum attained in deterministic concentration. The method of types in information theory enables the detailed analysis of the distillable entanglement in terms of the error rate. In addition to the probabilistic argument, we consider another type of entanglement concentration scheme, where the initial state is deterministically transformed into a (possibly mixed) final state whose fidelity to a maximally entangled state of a desired size converges to one in the asymptotic limit. We show that the same formula as in the probabilistic argument is valid for the argument on fidelity by replacing the success probability with the fidelity. Furthermore, we also discuss entanglement yield when optimal success probability or optimal fidelity converges to zero in the asymptotic limit (strong converse), and give the explicit formulae for those cases.

28 pages, 4 figures, LaTeX2e, iopart.cls, minor corrections

References in corpus (2)

• A classical analogue of entanglement
• Deterministic entanglement concentration

Cited by in corpus (19)

• On the communication cost of entanglement transformations
• Deterministic Coherence Distillation
• Entropy of a quantum channel
• Local copying and local discrimination as a study for non-locality of a set
• Coherence and entanglement measures based on Rényi relative entropies
• Large deviation analysis for quantum security via smoothing of Renyi entropy of order 2
• Security analysis of epsilon-almost dual universal2 hash functions: smoothing of min entropy vs. smoothing of Rényi entropy of order 2
• Strong converse theorems using Rényi entropies
• Universal entanglement concentration
• General formulas for fixed-length quantum entanglement concentration
• Secure uniform random number extraction via incoherent strategies
• Geometric relative entropies and barycentric Rényi divergences
• Quantum Nonlocality: Multi-copy Resource Inter-convertibility & Their Asymptotic Inequivalence
• A family of multipartite entanglement measures
• Asymptotic majorization of finite probability distributions
• Quantifying the unextendibility of entanglement
• Universal and distorsion-free entanglement concentration of multiqubit quantum states in the W class
• Building Entanglement Entropy out of Correlation Functions for Interacting Fermions
• Multipartite entanglement theory with entanglement-nonincreasing operations