Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2409.01130 · IEEE Transactions on Information Theory

Error Exponents for Entanglement Transformations From Degenerations

Dávid Bugár, Péter Vrana

Published Jan 27, 2025• 2 citations
arXivHTMLPDF

Abstract

This paper explores the trade-off relation between the rate and the strong converse exponent for asymptotic LOCC transformations between pure multipartite states. Any single-copy probabilistic transformation between a pair of states implies that an asymptotic transformation at rate 1 is possible with an exponentially decreasing success probability. However, it is possible that an asymptotic transformation is feasible with nonzero probability, but there is no transformation between any finite number of copies with the same rate, even probabilistically. In such cases it is not known if the optimal success probability decreases exponentially or faster. A fundamental tool for showing the feasibility of an asymptotic transformation is degeneration. Any degeneration gives rise to a sequence of stochastic LOCC transformations from copies of the initial state plus a sublinear number of GHZ states to the same number of copies of the target state. These protocols involve parameters that can be freely chosen, but the choice affects the success probability. In this paper, we characterize an asymptotically optimal choice of the parameters and derive a single-letter expression for the error exponent of the resulting protocol. In particular, this implies an exponential lower bound on the success probability when the stochastic transformation arises from a degeneration.

DOI
10.1109/tit.2025.3534327

Related papers

The Asymptotic Spectrum of LOCC Transformations

Asger Kjærulff Jensen, Péter Vrana

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.

arXiv:1807.05130•IEEE Transactions on Information Theory•Jul 16, 2019•20 citations

Error exponents for entanglement concentration

Masahito Hayashi, Masato Koashi, Keiji Matsumoto +2 more

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.

arXiv:quant-ph/0206097•Journal of Physics A Mathematical and General•Dec 17, 2002•45 citations

Explicit Error Bounds for Entanglement Transformations Between Sparse Multipartite States

Dávid Bugár, Péter Vrana

The trade-off relation between the rate and the strong converse exponent for probabilistic asymptotic entanglement transformations between pure multipartite states can in principle be characterised in terms of a class of entanglement measures determined implicitly by a set of strong axioms. A nontrivial family of such functionals has recently been constructed, but their previously known characterisations have so far only made it possible to evaluate them in very simple cases. In this paper we derive a new regularised formula for these functionals in terms of a subadditive upper bound, complementing the previously known superadditive lower bound. The upper and lower bounds evaluated on tensor powers differ by a logarithmically bounded term, which provides a bound on the convergence rate. In addition, we find that on states satisfying a certain sparsity constraint, the upper bound is equal to the value of the corresponding additive entanglement measure, therefore the regularisation is not needed for such states, and the evaluation is possible via a single-letter formula. Our results provide explicit bounds on the success probability of transformations by local operations and classical communication and, due to the additivity of the entanglement measures, also on the strong converse exponent for asymptotic transformations.

arXiv:2309.11429•IEEE Transactions on Information Theory•Apr 1, 2024•3 citations

Asymptotic entanglement transformation between W and GHZ states

Péter Vrana, Matthias Christandl

We investigate entanglement transformations with stochastic local operations and classical communication in an asymptotic setting using the concepts of degeneration and border rank of tensors from algebraic complexity theory. Results well-known in that field imply that GHZ states can be transformed into W states at rate 1 for any number of parties. As a generalization, we find that the asymptotic conversion rate from GHZ states to Dicke states is bounded as the number of subsystems increases and the number of excitations is fixed. By generalizing constructions of Coppersmith and Winograd and by using monotones introduced by Strassen, we also compute the conversion rate from W to GHZ states.

arXiv:1310.3244•Journal of Mathematical Physics•Feb 1, 2015•52 citations

Error exponents for tripartite-to-bipartite entanglement transformations

Péter Vrana

We consider distillation of ebits between a specified pair of subsystems from pure tripartite states by local operations and classical communication. It is known that, allowing an asymptotically vanishing error, the maximal rate is the minimum of the von Neumann entropies of the two corresponding marginals, and under asymptotic stochastic local operations and classical communication the maximal rate is given by a minimization over a one-parameter family of entanglement measures. In this paper, we determine the direct and strong converse error exponents, and the optimal rate for deterministic transformations.

arXiv:2507.13778•Jul 18, 2025•0 citations

Classification of nonasymptotic bipartite pure-state entanglement transformations

Somshubhro Bandyopadhyay, Vwani Roychowdhury, Ujjwal Sen

We show that deterministic and conclusive transformation properties of bipartite entanglement in the nonasymptotic scenario (when many but a finite number of copies of a source state are collectively manipulated) are fundamentally different from those in both the single-copy and asymptotic limits. For instance, by generalizing the notion of local comparability of entanglement in the single-copy case, we provide a complete classification of bipartite entanglement transformations in the nonasymptotic scenario. We also show that, unlike the asymptotic case, collective operations need not always be advantageous for the many-copy case. In particular, we show that (1) there exists a class of states for which the optimal conclusive transformation probability decreases exponentially with increasing number of copies, even if the source state has more entropy of entanglement, and (2) optimal conclusive transformation probability need not be a monotonic function of the number of copies.

arXiv:quant-ph/0103131•Physical Review A•May 3, 2002•29 citations
This paper explores the trade-off relation between the rate and the strong converse exponent for asymptotic LOCC transformations between pure multipartite states. Any single-copy probabilistic transformation between a pair of states implies that an asymptotic transformation at rate 1 is possible with an exponentially decreasing success probability. However, it is possible that an asymptotic transformation is feasible with nonzero probability, but there is no transformation between any finite number of copies with the same rate, even probabilistically. In such cases it is not known if the optimal success probability decreases exponentially or faster. A fundamental tool for showing the feasibility of an asymptotic transformation is degeneration. Any degeneration gives rise to a sequence of stochastic LOCC transformations from copies of the initial state plus a sublinear number of GHZ states to the same number of copies of the target state. These protocols involve parameters that can be freely chosen, but the choice affects the success probability. In this paper, we characterize an asymptotically optimal choice of the parameters and derive a single-letter expression for the error exponent of the resulting protocol. In particular, this implies an exponential lower bound on the success probability when the stochastic transformation arises from a degeneration.
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.
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.
The trade-off relation between the rate and the strong converse exponent for probabilistic asymptotic entanglement transformations between pure multipartite states can in principle be characterised in terms of a class of entanglement measures determined implicitly by a set of strong axioms. A nontrivial family of such functionals has recently been constructed, but their previously known characterisations have so far only made it possible to evaluate them in very simple cases. In this paper we derive a new regularised formula for these functionals in terms of a subadditive upper bound, complementing the previously known superadditive lower bound. The upper and lower bounds evaluated on tensor powers differ by a logarithmically bounded term, which provides a bound on the convergence rate. In addition, we find that on states satisfying a certain sparsity constraint, the upper bound is equal to the value of the corresponding additive entanglement measure, therefore the regularisation is not needed for such states, and the evaluation is possible via a single-letter formula. Our results provide explicit bounds on the success probability of transformations by local operations and classical communication and, due to the additivity of the entanglement measures, also on the strong converse exponent for asymptotic transformations.
We investigate entanglement transformations with stochastic local operations and classical communication in an asymptotic setting using the concepts of degeneration and border rank of tensors from algebraic complexity theory. Results well-known in that field imply that GHZ states can be transformed into W states at rate 1 for any number of parties. As a generalization, we find that the asymptotic conversion rate from GHZ states to Dicke states is bounded as the number of subsystems increases and the number of excitations is fixed. By generalizing constructions of Coppersmith and Winograd and by using monotones introduced by Strassen, we also compute the conversion rate from W to GHZ states.
We consider distillation of ebits between a specified pair of subsystems from pure tripartite states by local operations and classical communication. It is known that, allowing an asymptotically vanishing error, the maximal rate is the minimum of the von Neumann entropies of the two corresponding marginals, and under asymptotic stochastic local operations and classical communication the maximal rate is given by a minimization over a one-parameter family of entanglement measures. In this paper, we determine the direct and strong converse error exponents, and the optimal rate for deterministic transformations.
We show that deterministic and conclusive transformation properties of bipartite entanglement in the nonasymptotic scenario (when many but a finite number of copies of a source state are collectively manipulated) are fundamentally different from those in both the single-copy and asymptotic limits. For instance, by generalizing the notion of local comparability of entanglement in the single-copy case, we provide a complete classification of bipartite entanglement transformations in the nonasymptotic scenario. We also show that, unlike the asymptotic case, collective operations need not always be advantageous for the many-copy case. In particular, we show that (1) there exists a class of states for which the optimal conclusive transformation probability decreases exponentially with increasing number of copies, even if the source state has more entropy of entanglement, and (2) optimal conclusive transformation probability need not be a monotonic function of the number of copies.