The Asymptotic Spectrum of LOCC Transformations

Publikation: Bidrag til tidsskriftTidsskriftartikelForskningfagfællebedømt

Standard

The Asymptotic Spectrum of LOCC Transformations. / Jensen, Asger Kjaerulff; Vrana, Peter.

I: IEEE Transactions on Information Theory, Bind 66, Nr. 1, 2020, s. 155-166.

Publikation: Bidrag til tidsskriftTidsskriftartikelForskningfagfællebedømt

Harvard

Jensen, AK & Vrana, P 2020, 'The Asymptotic Spectrum of LOCC Transformations', IEEE Transactions on Information Theory, bind 66, nr. 1, s. 155-166. https://doi.org/10.1109/TIT.2019.2927555

APA

Jensen, A. K., & Vrana, P. (2020). The Asymptotic Spectrum of LOCC Transformations. IEEE Transactions on Information Theory, 66(1), 155-166. https://doi.org/10.1109/TIT.2019.2927555

Vancouver

Jensen AK, Vrana P. The Asymptotic Spectrum of LOCC Transformations. IEEE Transactions on Information Theory. 2020;66(1):155-166. https://doi.org/10.1109/TIT.2019.2927555

Author

Jensen, Asger Kjaerulff ; Vrana, Peter. / The Asymptotic Spectrum of LOCC Transformations. I: IEEE Transactions on Information Theory. 2020 ; Bind 66, Nr. 1. s. 155-166.

Bibtex

@article{88f997067c9247eda3c30c8ddd22510d,
title = "The Asymptotic Spectrum of LOCC Transformations",
abstract = "We study the 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 the success probability, known as the converse 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 characterization 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 [1], 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.",
keywords = "Quantum entanglement, Entropy, Additives, Topology, Probabilistic logic, local operations and classical communication, asymptotic entanglement transformation, error exponent, resource theory, asymptotic conversion rates",
author = "Jensen, {Asger Kjaerulff} and Peter Vrana",
year = "2020",
doi = "10.1109/TIT.2019.2927555",
language = "English",
volume = "66",
pages = "155--166",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers",
number = "1",

}

RIS

TY - JOUR

T1 - The Asymptotic Spectrum of LOCC Transformations

AU - Jensen, Asger Kjaerulff

AU - Vrana, Peter

PY - 2020

Y1 - 2020

N2 - We study the 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 the success probability, known as the converse 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 characterization 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 [1], 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.

AB - We study the 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 the success probability, known as the converse 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 characterization 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 [1], 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.

KW - Quantum entanglement

KW - Entropy

KW - Additives

KW - Topology

KW - Probabilistic logic

KW - local operations and classical communication

KW - asymptotic entanglement transformation

KW - error exponent

KW - resource theory

KW - asymptotic conversion rates

U2 - 10.1109/TIT.2019.2927555

DO - 10.1109/TIT.2019.2927555

M3 - Journal article

VL - 66

SP - 155

EP - 166

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 1

ER -

ID: 243060698