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:2610.02025

Operational transformation rates of quantum states

Giulia Mazzola, Renato Renner

quant-phSubmitted Oct 1, 2026• Announced Oct 2, 2026• 0 citations
arXivHTMLPDF

Abstract

Typically, multiple copies of a quantum state are described by a tensor power of that state. However, from an operational point of view, an experimentalist cannot, in general, rule out imperfections at unknown positions or correlations between copies, so assuming independent and identically distributed (iid) copies is not justified a priori. In the following, we relax the iid assumption by considering a whole set of resource states that are fundamentally indistinguishable from a tensor power state, and in that sense look like many copies of the quantum state to the experimentalist. Using a de Finetti-type argument, we show that this operational set of states can asymptotically be represented by almost-iid states. As an application, we introduce operational analogues of asymptotic transformation rates, such as entanglement cost and distillation. This raises the question of whether these rates coincide with their iid counterparts.

AI Summary

The paper asks whether a single resource-conversion protocol can attain iid asymptotic rates when its input is unknown and potentially correlated, but passes tomography as copies of a reference state $\rho$. It defines an operational class of state sequences through tomography accuracy and confidence, requiring sample complexity polynomial in $1/\epsilon$ and $\log(1/\delta)$, and defines rates by requiring one protocol to map the entire input class into the corresponding target class. For permutation-invariant sequences, discarding $\lceil n^\alpha\rceil$ systems, for any $0<\alpha<1$, leaves a state approximable by an almost-iid state along $\rho$, with $O(n^\kappa)$ defects for some $\kappa<1$ and trace-distance error $2^{-\Omega(n^c)}$ for some $c>0$. The proof combines a tomography-localized de Finetti representation with a change-of-reference argument for almost-iid states. Under closure assumptions on free operations, this characterizes operational rates independently of the admissible tomography protocol. A blockwise construction establishes $R_{\mathcal F}(\rho\to\sigma)\leq\tilde R_{\mathcal F}(\rho\to\sigma)$; operational outputs may themselves contain defects. A converse bounds $\tilde R_{\mathcal F}$ by the ratio of regularized relative entropies of resource. For LOCC, a universal one-way decoupling protocol converts almost-iid Bell pairs into approximate iid Bell pairs at unit rate, yielding $\tilde E_D(\rho)=E_D(\rho)$. Pure-state conversion rates consequently retain their usual entropy-ratio formula. The framework assumes finite dimensions and tomography satisfying sampling consistency and noise robustness. Equality of operational and iid conversion rates remains open generally, including whether mixed-state operational entanglement cost equals standard entanglement cost.

Little sign of AI-generated textStrong assumptions

Central claim may not hold: The abstract omits that the almost-iid characterization requires permutation symmetry, or prior symmetrization, and discarding a sublinear number of systems. The abstract's “fundamentally indistinguishable” describes only consistency with the chosen tomography criterion, although admitted states can be perfectly distinguishable from the tensor-power target by global measurements. The universal Bell-decoupling proof has a sign typo: the contribution to the lower bound on k/n is -10w_n/n, not +10w_n/n, without affecting the limiting rate.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
91 pages, 3 figures

Related papers

Almost-iid information theory

Giulia Mazzola, David Sutter, Renato Renner

Information-theoretic techniques are based on the assumption that resources are well characterized by independent and identically distributed (iid) states. This assumption cannot be justified operationally, since, for example, correlations between subsequent systems emitted by a source cannot be detected by any practical tomographic protocol. Operationally motivated symmetry assumptions still imply, via de Finetti theorems, that the resources are described by almost-iid states. This raises the question: Are almost-iid resources as effective as perfect iid resources for information-processing tasks? Here we address this question and prove that the conditional entropy of almost-iid states asymptotically coincides with that of iid states. As an application, this implies that squashed entanglement is robust for almost-iid states, asymptotically matching its value on iid states.

quant-pharXiv:2603.15792•Mar 18, 2026•9 citations

Robust classical and quantum communication over almost-iid channels

Liuhang Ye, Bjarne Bergh, Nilanjana Datta

The independent and identically distributed (iid) paradigm for asymptotic communication through quantum channels describes $n$ uses of a channel $Φ$ by $Φ^{\otimes n}$. Since exact tensor-power behaviour is an idealization, we ask whether the asymptotic capacities of $Φ$ remain achievable for channel sequences that are almost-iid along $Φ$. We consider sequences of Choi-almost-iid channels whose normalized Choi states are Mazzola-Sutter-Renner (MSR) almost-iid along the normalized Choi state of $Φ$, with defect parameters $r_n=o(n)$. In Renner's exponential de Finetti theorem for quantum states, almost-iid states appear in the approximating mixture and motivate the MSR almost-iid class. Choi-almost-iid channels play the corresponding role in an exponential de Finetti theorem for quantum channels established in a companion paper. In this paper, we prove that the universal unassisted classical and quantum capacities of the class of Choi-almost-iid channels along $Φ$ equal those of the channel $Φ$. Here universality is within this class: for each rate below the relevant capacity, a code sequence depending on $Φ$ and the rate, but not on the particular channel sequence, achieves vanishing error for every sequence in the class.

quant-pharXiv:2610.00442•Oct 1, 2026•0 citations

Catalytic and Asymptotic Equivalence for Quantum Entanglement

Ray Ganardi, Tulja Varun Kondra, Alexander Streltsov

Entanglement is a fundamental resource in quantum information processing, yet understanding its manipulation and transformation remains a challenge. Many tasks rely on highly entangled pure states, but obtaining such states is often challenging due to the presence of noise. Typically, entanglement manipulation procedures involving asymptotically many copies of a state are considered to overcome this problem. These procedures allow for distilling highly entangled pure states from noisy states, which enables a wide range of applications, such as quantum teleportation and quantum cryptography. When it comes to manipulating entangled quantum systems on a single copy level, using entangled states as catalysts can significantly broaden the range of achievable transformations. Similar to the concept of catalysis in chemistry, the entangled catalyst is returned unchanged at the end of the state manipulation procedure. Our results demonstrate that despite the apparent conceptual differences between the asymptotic and catalytic settings, they are actually strongly connected and fully equivalent for all distillable states. Our methods rely on the analysis of many-copy entanglement manipulation procedures which may establish correlations between different copies. As an important consequence, we demonstrate that using an entangled catalyst cannot enhance the asymptotic singlet distillation rate of a distillable quantum state. Our findings provide a comprehensive understanding of the capabilities and limitations of both catalytic and asymptotic state transformations of entangled states, and highlight the importance of correlations in these processes.

arXiv:2305.03488•Physical Review Letters•Dec 19, 2024•20 citations

Reversibility of quantum resources through probabilistic protocols

Bartosz Regula, Ludovico Lami

Among the most fundamental questions in the manipulation of quantum resources such as entanglement is the possibility of reversibly transforming all resource states. The key consequence of this would be the identification of a unique entropic resource measure that exactly quantifies the limits of achievable transformation rates. Remarkably, previous results claimed that such asymptotic reversibility holds true in very general settings; however, recently those findings have been found to be incomplete, casting doubt on the conjecture. Here we show that it is indeed possible to reversibly interconvert all states in general quantum resource theories, as long as one allows protocols that may only succeed probabilistically. Although such transformations have some chance of failure, we show that their success probability can be ensured to be bounded away from zero, even in the asymptotic limit of infinitely many manipulated copies. As in previously conjectured approaches, the achievability here is realised through operations that are asymptotically resource non-generating, and we show that this choice is optimal: smaller sets of transformations cannot lead to reversibility. Our methods are based on connecting the transformation rates under probabilistic protocols with strong converse rates for deterministic transformations, which we strengthen into an exact equivalence in the case of entanglement distillation.

arXiv:2309.07206•Nature Communications•Apr 17, 2024•23 citations

Computational entanglement distillation beyond pure states: efficient protocols and fundamental limitations

Takeru Utsumi, Jacopo Rizzo, Ryuji Takagi +1 more

The information-theoretic approach to entanglement typically relies on arbitrarily many input copies and unboundedly complex operations; however, the available resources are constrained in reality. This motivates the study of entanglement theory with limited resources. One of its central questions is which quantities characterize entanglement manipulations, and so far, only the idealized case of pure states has been well explored. In this work, we address entanglement distillation from mixed states and identify the Rényi coherent information as the quantity determining the optimal rate in the worst case under two distinct resource constraints. We first characterize the sample-efficient regime, in which unbounded computational power is allowed. Our universal protocol achieves this rate without knowledge of the input state under certain polynomial rank constraints. This rate is optimal among universal protocols: we construct states whose distillable entanglement is nearly extensive, yet from which no universal sample-efficient protocol attains a rate above their Rényi coherent information. We then push this characterization to the computationally efficient frontier: the same bound holds for any efficient protocol even when the input state is known, and another universal protocol achieves this rate efficiently under additional polynomial constraints on the marginal ranks. Overall, our results give the Rényi coherent information a novel operational meaning in two computational settings: universal distillation with limited copies and efficient distillation even with knowledge of the input state.

quant-pharXiv:2610.06787•Oct 6, 2026•0 citations

Rates of Multipartite Entanglement Transformations

Alexander Streltsov, Clément Meignant, Jens Eisert

The theory of the asymptotic manipulation of pure bipartite quantum systems can be considered completely understood: the rates at which bipartite entangled states can be asymptotically transformed into each other are fully determined by a single number each, the respective entanglement entropy. In the multipartite setting, similar questions of the optimally achievable rates of transforming one pure state into another are notoriously open. This seems particularly unfortunate in the light of the revived interest in such questions due to the perspective of experimentally realizing multipartite quantum networks. In this Letter, we report substantial progress by deriving simple upper and lower bounds on the rates that can be achieved in asymptotic multipartite entanglement transformations. These bounds are based on ideas of entanglement combing and state merging. We identify cases where the bounds coincide and hence provide the exact rates. As an example, we bound rates at which resource states for the cryptographic scheme of quantum secret sharing can be distilled from arbitrary pure tripartite quantum states. This result provides further scope for quantum internet applications, supplying tools to study the implementation of multipartite protocols over quantum networks.

arXiv:1709.09693•Physical Review Letters•Aug 17, 2020•26 citations
Typically, multiple copies of a quantum state are described by a tensor power of that state. However, from an operational point of view, an experimentalist cannot, in general, rule out imperfections at unknown positions or correlations between copies, so assuming independent and identically distributed (iid) copies is not justified a priori. In the following, we relax the iid assumption by considering a whole set of resource states that are fundamentally indistinguishable from a tensor power state, and in that sense look like many copies of the quantum state to the experimentalist. Using a de Finetti-type argument, we show that this operational set of states can asymptotically be represented by almost-iid states. As an application, we introduce operational analogues of asymptotic transformation rates, such as entanglement cost and distillation. This raises the question of whether these rates coincide with their iid counterparts.
The paper asks whether a single resource-conversion protocol can attain iid asymptotic rates when its input is unknown and potentially correlated, but passes tomography as copies of a reference state ρ\rhoρ. It defines an operational class of state sequences through tomography accuracy and confidence, requiring sample complexity polynomial in 1/ϵ1/\epsilon1/ϵ and log⁡(1/δ)\log(1/\delta)log(1/δ), and defines rates by requiring one protocol to map the entire input class into the corresponding target class.
For permutation-invariant sequences, discarding ⌈nα⌉\lceil n^\alpha\rceil⌈nα⌉ systems, for any 0<α<10<\alpha<10<α<1, leaves a state approximable by an almost-iid state along ρ\rhoρ, with O(nκ)O(n^\kappa)O(nκ) defects for some κ<1\kappa<1κ<1 and trace-distance error 2−Ω(nc)2^{-\Omega(n^c)}2−Ω(nc) for some c>0c>0c>0. The proof combines a tomography-localized de Finetti representation with a change-of-reference argument for almost-iid states. Under closure assumptions on free operations, this characterizes operational rates independently of the admissible tomography protocol.
A blockwise construction establishes RF(ρ→σ)≤R~F(ρ→σ)R_{\mathcal F}(\rho\to\sigma)\leq\tilde R_{\mathcal F}(\rho\to\sigma)RF​(ρ→σ)≤R~F​(ρ→σ); operational outputs may themselves contain defects. A converse bounds R~F\tilde R_{\mathcal F}R~F​ by the ratio of regularized relative entropies of resource. For LOCC, a universal one-way decoupling protocol converts almost-iid Bell pairs into approximate iid Bell pairs at unit rate, yielding E~D(ρ)=ED(ρ)\tilde E_D(\rho)=E_D(\rho)E~D​(ρ)=ED​(ρ). Pure-state conversion rates consequently retain their usual entropy-ratio formula.
The framework assumes finite dimensions and tomography satisfying sampling consistency and noise robustness. Equality of operational and iid conversion rates remains open generally, including whether mixed-state operational entanglement cost equals standard entanglement cost.
Information-theoretic techniques are based on the assumption that resources are well characterized by independent and identically distributed (iid) states. This assumption cannot be justified operationally, since, for example, correlations between subsequent systems emitted by a source cannot be detected by any practical tomographic protocol. Operationally motivated symmetry assumptions still imply, via de Finetti theorems, that the resources are described by almost-iid states. This raises the question: Are almost-iid resources as effective as perfect iid resources for information-processing tasks? Here we address this question and prove that the conditional entropy of almost-iid states asymptotically coincides with that of iid states. As an application, this implies that squashed entanglement is robust for almost-iid states, asymptotically matching its value on iid states.
The independent and identically distributed (iid) paradigm for asymptotic communication through quantum channels describes nnn uses of a channel ΦΦΦ by Φ⊗nΦ^{\otimes n}Φ⊗n. Since exact tensor-power behaviour is an idealization, we ask whether the asymptotic capacities of ΦΦΦ remain achievable for channel sequences that are almost-iid along ΦΦΦ. We consider sequences of Choi-almost-iid channels whose normalized Choi states are Mazzola-Sutter-Renner (MSR) almost-iid along the normalized Choi state of ΦΦΦ, with defect parameters rn=o(n)r_n=o(n)rn​=o(n). In Renner's exponential de Finetti theorem for quantum states, almost-iid states appear in the approximating mixture and motivate the MSR almost-iid class. Choi-almost-iid channels play the corresponding role in an exponential de Finetti theorem for quantum channels established in a companion paper. In this paper, we prove that the universal unassisted classical and quantum capacities of the class of Choi-almost-iid channels along ΦΦΦ equal those of the channel ΦΦΦ. Here universality is within this class: for each rate below the relevant capacity, a code sequence depending on ΦΦΦ and the rate, but not on the particular channel sequence, achieves vanishing error for every sequence in the class.
Entanglement is a fundamental resource in quantum information processing, yet understanding its manipulation and transformation remains a challenge. Many tasks rely on highly entangled pure states, but obtaining such states is often challenging due to the presence of noise. Typically, entanglement manipulation procedures involving asymptotically many copies of a state are considered to overcome this problem. These procedures allow for distilling highly entangled pure states from noisy states, which enables a wide range of applications, such as quantum teleportation and quantum cryptography. When it comes to manipulating entangled quantum systems on a single copy level, using entangled states as catalysts can significantly broaden the range of achievable transformations. Similar to the concept of catalysis in chemistry, the entangled catalyst is returned unchanged at the end of the state manipulation procedure. Our results demonstrate that despite the apparent conceptual differences between the asymptotic and catalytic settings, they are actually strongly connected and fully equivalent for all distillable states. Our methods rely on the analysis of many-copy entanglement manipulation procedures which may establish correlations between different copies. As an important consequence, we demonstrate that using an entangled catalyst cannot enhance the asymptotic singlet distillation rate of a distillable quantum state. Our findings provide a comprehensive understanding of the capabilities and limitations of both catalytic and asymptotic state transformations of entangled states, and highlight the importance of correlations in these processes.
Among the most fundamental questions in the manipulation of quantum resources such as entanglement is the possibility of reversibly transforming all resource states. The key consequence of this would be the identification of a unique entropic resource measure that exactly quantifies the limits of achievable transformation rates. Remarkably, previous results claimed that such asymptotic reversibility holds true in very general settings; however, recently those findings have been found to be incomplete, casting doubt on the conjecture. Here we show that it is indeed possible to reversibly interconvert all states in general quantum resource theories, as long as one allows protocols that may only succeed probabilistically. Although such transformations have some chance of failure, we show that their success probability can be ensured to be bounded away from zero, even in the asymptotic limit of infinitely many manipulated copies. As in previously conjectured approaches, the achievability here is realised through operations that are asymptotically resource non-generating, and we show that this choice is optimal: smaller sets of transformations cannot lead to reversibility. Our methods are based on connecting the transformation rates under probabilistic protocols with strong converse rates for deterministic transformations, which we strengthen into an exact equivalence in the case of entanglement distillation.
The information-theoretic approach to entanglement typically relies on arbitrarily many input copies and unboundedly complex operations; however, the available resources are constrained in reality. This motivates the study of entanglement theory with limited resources. One of its central questions is which quantities characterize entanglement manipulations, and so far, only the idealized case of pure states has been well explored. In this work, we address entanglement distillation from mixed states and identify the Rényi coherent information as the quantity determining the optimal rate in the worst case under two distinct resource constraints. We first characterize the sample-efficient regime, in which unbounded computational power is allowed. Our universal protocol achieves this rate without knowledge of the input state under certain polynomial rank constraints. This rate is optimal among universal protocols: we construct states whose distillable entanglement is nearly extensive, yet from which no universal sample-efficient protocol attains a rate above their Rényi coherent information. We then push this characterization to the computationally efficient frontier: the same bound holds for any efficient protocol even when the input state is known, and another universal protocol achieves this rate efficiently under additional polynomial constraints on the marginal ranks. Overall, our results give the Rényi coherent information a novel operational meaning in two computational settings: universal distillation with limited copies and efficient distillation even with knowledge of the input state.
The theory of the asymptotic manipulation of pure bipartite quantum systems can be considered completely understood: the rates at which bipartite entangled states can be asymptotically transformed into each other are fully determined by a single number each, the respective entanglement entropy. In the multipartite setting, similar questions of the optimally achievable rates of transforming one pure state into another are notoriously open. This seems particularly unfortunate in the light of the revived interest in such questions due to the perspective of experimentally realizing multipartite quantum networks. In this Letter, we report substantial progress by deriving simple upper and lower bounds on the rates that can be achieved in asymptotic multipartite entanglement transformations. These bounds are based on ideas of entanglement combing and state merging. We identify cases where the bounds coincide and hence provide the exact rates. As an example, we bound rates at which resource states for the cryptographic scheme of quantum secret sharing can be distilled from arbitrary pure tripartite quantum states. This result provides further scope for quantum internet applications, supplying tools to study the implementation of multipartite protocols over quantum networks.