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

Chinese Physics B

Converse Bounds on Probabilistic Distillation of Quantum Channel Resources

Zhanyuan Fu, Lei Li, Yiran Wang

Published Oct 28, 2026• 0 citations
Publisher

Abstract

Abstract Probabilistic protocols can enlarge the set of feasible resource transformations by conditioning on successful outcomes, but in many practical setting there are fundamental limitations on the success probability and the error incurred in such transformation. We derive complementary one-shot converse bounds and their regularized asymptotic rate bounds. Successful outcomes are represented by branches of free superinstruments. While projective robustness yields an accuracy constraint independent of the success probability, generalized robustness directly bounds the probability itself. In particular, we establish the explicit relationship between the success probability and the error of the protocol using robustness measure. For a flagged erasure channel, postselection recovers the identity channel exactly. In this case, generalized robustness remains finite although projective robustness is infinite. Restricting the framework to preparation channels recovers state distillation and gives explicit bounds for coherence distillation from noisy coherent states. Together, these examples distinguish channel-level behavior from the state-theoretic case obtained by restricting the framework to preparation channels.

DOI
10.1088/1674-1056/aeba68

Related papers

Conditional Error Exponents of Probabilistic Quantum Resource Distillation

Xian Shi

Quantum resource distillation converts imperfect resource states into highly resourceful targets and is a central task in quantum information processing. When distillation is probabilistic, unfavorable outcomes may be discarded and the quality of the output is evaluated conditioned on success, leading to a notion of reliability that differs from the deterministic setting. Here we study the conditional error exponents of probabilistic quantum resource distillation under approximately resource-nongenerating instruments and derive its general connection to the postselected composite quantum hypothesis testing against the corresponding set of free states. This reduction leads naturally to scale-invariant projective distinguishability measures and provides finite-blocklength bounds for a broad class of resource theories. We apply the framework to entanglement, coherence, and magic. For entanglement and magic, we obtain exact zero-rate asymptotic characterizations of the conditional error exponent in terms of regularized projective distinguishability, while for coherence we derive general finite-blocklength and asymptotic bounds. For representative entangled and magic states, the resulting quantities can be evaluated analytically and reveal regimes in which postselection yields a strictly larger conditional error exponent than deterministic distillation. Furthermore, we also show that the conditional error exponents for probabilistic entanglement distillation under a strictly positive success probability constraint are smaller than those with no constraints on the success probability.

quant-pharXiv:2609.06688•Sep 8, 2026•0 citations

Fundamental limitations on distillation of quantum channel resources

Bartosz Regula, Ryuji Takagi

Quantum channels underlie the dynamics of quantum systems, but in many practical settings it is the channels themselves that require processing. We establish universal limitations on the processing of both quantum states and channels, expressed in the form of no-go theorems and quantitative bounds for the manipulation of general quantum channel resources under the most general transformation protocols. Focusing on the class of distillation tasks - which can be understood either as the purification of noisy channels into unitary ones, or the extraction of state-based resources from channels - we develop fundamental restrictions on the error incurred in such transformations, and comprehensive lower bounds for the overhead of any distillation protocol. In the asymptotic setting, our results yield broadly applicable bounds for rates of distillation. We demonstrate our results through applications to fault-tolerant quantum computation, where we obtain state-of-the-art lower bounds for the overhead cost of magic state distillation, as well as to quantum communication, where we recover a number of strong converse bounds for quantum channel capacity.

arXiv:2010.11942•Nature Communications•Jul 20, 2021•75 citations

Overcoming entropic limitations on asymptotic state transformations through probabilistic protocols

Bartosz Regula, Ludovico Lami, Mark M. Wilde

The quantum relative entropy is known to play a key role in determining the asymptotic convertibility of quantum states in general resource-theoretic settings, often constituting the unique monotone that is relevant in the asymptotic regime. We show that this is no longer the case when one allows stochastic protocols that may only succeed with some probability, in which case the quantum relative entropy is insufficient to characterize the rates of asymptotic state transformations, and a new entropic quantity based on a regularization of the Hilbert projective metric comes into play. Such a scenario is motivated by a setting where the cost associated with transformations of quantum states, typically taken to be the number of copies of a given state, is instead identified with the size of the quantum memory needed to realize the protocol. Our approach allows for constructing transformation protocols that achieve strictly higher rates than those imposed by the relative entropy. Focusing on the task of resource distillation, we give broadly applicable strong converse bounds on the asymptotic rates of probabilistic distillation protocols, and show them to be tight in relevant settings such as entanglement distillation with nonentangling operations. This generalizes and extends previously known limitations that are only applicable to deterministic protocols. Our methods are based on recent results for probabilistic one-shot transformations as well as a new asymptotic equipartition property for the projective relative entropy.

arXiv:2209.03362•Physical Review A•Apr 3, 2023•8 citations

Tight constraints on probabilistic convertibility of quantum states

Bartosz Regula

We develop two general approaches to characterising the manipulation of quantum states by means of probabilistic protocols constrained by the limitations of some quantum resource theory. First, we give a general necessary condition for the existence of a physical transformation between quantum states, obtained using a recently introduced resource monotone based on the Hilbert projective metric. In all affine quantum resource theories (e.g. coherence, asymmetry, imaginarity) as well as in entanglement distillation, we show that the monotone provides a necessary and sufficient condition for one-shot resource convertibility under resource-non-generating operations, and hence no better restrictions on all probabilistic protocols are possible. We use the monotone to establish improved bounds on the performance of both one-shot and many-copy probabilistic resource distillation protocols. Complementing this approach, we introduce a general method for bounding achievable probabilities in resource transformations under resource-non-generating maps through a family of convex optimisation problems. We show it to tightly characterise single-shot probabilistic distillation in broad types of resource theories, allowing an exact analysis of the trade-offs between the probabilities and errors in distilling maximally resourceful states. We demonstrate the usefulness of both of our approaches in the study of quantum entanglement distillation.

arXiv:2112.11321•Quantum•Sep 22, 2022•28 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

Distillation and simulation in quantum information

Kun Fang

We use the techniques of convex optimization, especially semidefinite programming, to study two kinds of fundamental tasks, i.e., distillation and simulation in quantum information theory. We investigate these tasks in a unified framework of resource theory and focus on their computation and characterization with finite resources. Particularly we study the tradeoff among relevant parameters such as the number of resource copies, resource transformation rate, error tolerance and success probability. In the first part, we study the task of distillation for two different resources, maximally entangled state and maximally coherent state, representing nonlocal and local “quantumness” respectively. For entanglement distillation, we derive an efficiently computable second-order estimation of the distillation rate for general quantum states, which are tight for quantum states of practical interest. Our study overcomes the limitation of conventional research either focusing on the asymptotic rate or ignoring the computability. For the coherence distillation, we perform finite analysis for both deterministic and probabilistic scenarios. Our results unveil several new features of coherence from a resource theoretic viewpoint and contribute to an increased understanding of the fundamental properties of different sets of free operations. In the second part, we investigate the resource cost of simulating a quantum channel via quantum coherence or another quantum channel. We introduce the channel’s analogs of max-relative entropy, logarithmic robustness and max-information of quantum states, providing their operational interpretation with the channel simulation cost via different resources. Particularly, we establish the asymptotic equipartition property of the channel’s max-information, that is, it converges to the quantum mutual information of the channel in the independent and identically distributed asymptotic limit. As applications, this asymptotic equipartition property implies the quantum reverse Shannon theorem in the presence of non-signalling correlations. From the perspective of resource theory, the worth of a resource can usually be characterized by the minimum distance to a set of useless resources under a proper distance measure. We give such characterization for all the tasks studied in this thesis, and find that the distance measure for the distillation and simulation process naturally corresponds to the quantum hypothesis testing relative entropy and the max-relative entropy, respectively.

•Jan 1, 2018•1 citation
Abstract Probabilistic protocols can enlarge the set of feasible resource transformations by conditioning on successful outcomes, but in many practical setting there are fundamental limitations on the success probability and the error incurred in such transformation. We derive complementary one-shot converse bounds and their regularized asymptotic rate bounds. Successful outcomes are represented by branches of free superinstruments. While projective robustness yields an accuracy constraint independent of the success probability, generalized robustness directly bounds the probability itself. In particular, we establish the explicit relationship between the success probability and the error of the protocol using robustness measure. For a flagged erasure channel, postselection recovers the identity channel exactly. In this case, generalized robustness remains finite although projective robustness is infinite. Restricting the framework to preparation channels recovers state distillation and gives explicit bounds for coherence distillation from noisy coherent states. Together, these examples distinguish channel-level behavior from the state-theoretic case obtained by restricting the framework to preparation channels.
Quantum resource distillation converts imperfect resource states into highly resourceful targets and is a central task in quantum information processing. When distillation is probabilistic, unfavorable outcomes may be discarded and the quality of the output is evaluated conditioned on success, leading to a notion of reliability that differs from the deterministic setting. Here we study the conditional error exponents of probabilistic quantum resource distillation under approximately resource-nongenerating instruments and derive its general connection to the postselected composite quantum hypothesis testing against the corresponding set of free states. This reduction leads naturally to scale-invariant projective distinguishability measures and provides finite-blocklength bounds for a broad class of resource theories. We apply the framework to entanglement, coherence, and magic. For entanglement and magic, we obtain exact zero-rate asymptotic characterizations of the conditional error exponent in terms of regularized projective distinguishability, while for coherence we derive general finite-blocklength and asymptotic bounds. For representative entangled and magic states, the resulting quantities can be evaluated analytically and reveal regimes in which postselection yields a strictly larger conditional error exponent than deterministic distillation. Furthermore, we also show that the conditional error exponents for probabilistic entanglement distillation under a strictly positive success probability constraint are smaller than those with no constraints on the success probability.
Quantum channels underlie the dynamics of quantum systems, but in many practical settings it is the channels themselves that require processing. We establish universal limitations on the processing of both quantum states and channels, expressed in the form of no-go theorems and quantitative bounds for the manipulation of general quantum channel resources under the most general transformation protocols. Focusing on the class of distillation tasks - which can be understood either as the purification of noisy channels into unitary ones, or the extraction of state-based resources from channels - we develop fundamental restrictions on the error incurred in such transformations, and comprehensive lower bounds for the overhead of any distillation protocol. In the asymptotic setting, our results yield broadly applicable bounds for rates of distillation. We demonstrate our results through applications to fault-tolerant quantum computation, where we obtain state-of-the-art lower bounds for the overhead cost of magic state distillation, as well as to quantum communication, where we recover a number of strong converse bounds for quantum channel capacity.
The quantum relative entropy is known to play a key role in determining the asymptotic convertibility of quantum states in general resource-theoretic settings, often constituting the unique monotone that is relevant in the asymptotic regime. We show that this is no longer the case when one allows stochastic protocols that may only succeed with some probability, in which case the quantum relative entropy is insufficient to characterize the rates of asymptotic state transformations, and a new entropic quantity based on a regularization of the Hilbert projective metric comes into play. Such a scenario is motivated by a setting where the cost associated with transformations of quantum states, typically taken to be the number of copies of a given state, is instead identified with the size of the quantum memory needed to realize the protocol. Our approach allows for constructing transformation protocols that achieve strictly higher rates than those imposed by the relative entropy. Focusing on the task of resource distillation, we give broadly applicable strong converse bounds on the asymptotic rates of probabilistic distillation protocols, and show them to be tight in relevant settings such as entanglement distillation with nonentangling operations. This generalizes and extends previously known limitations that are only applicable to deterministic protocols. Our methods are based on recent results for probabilistic one-shot transformations as well as a new asymptotic equipartition property for the projective relative entropy.
We develop two general approaches to characterising the manipulation of quantum states by means of probabilistic protocols constrained by the limitations of some quantum resource theory. First, we give a general necessary condition for the existence of a physical transformation between quantum states, obtained using a recently introduced resource monotone based on the Hilbert projective metric. In all affine quantum resource theories (e.g. coherence, asymmetry, imaginarity) as well as in entanglement distillation, we show that the monotone provides a necessary and sufficient condition for one-shot resource convertibility under resource-non-generating operations, and hence no better restrictions on all probabilistic protocols are possible. We use the monotone to establish improved bounds on the performance of both one-shot and many-copy probabilistic resource distillation protocols. Complementing this approach, we introduce a general method for bounding achievable probabilities in resource transformations under resource-non-generating maps through a family of convex optimisation problems. We show it to tightly characterise single-shot probabilistic distillation in broad types of resource theories, allowing an exact analysis of the trade-offs between the probabilities and errors in distilling maximally resourceful states. We demonstrate the usefulness of both of our approaches in the study of quantum entanglement distillation.
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.
We use the techniques of convex optimization, especially semidefinite programming, to study two kinds of fundamental tasks, i.e., distillation and simulation in quantum information theory. We investigate these tasks in a unified framework of resource theory and focus on their computation and characterization with finite resources. Particularly we study the tradeoff among relevant parameters such as the number of resource copies, resource transformation rate, error tolerance and success probability. In the first part, we study the task of distillation for two different resources, maximally entangled state and maximally coherent state, representing nonlocal and local “quantumness” respectively. For entanglement distillation, we derive an efficiently computable second-order estimation of the distillation rate for general quantum states, which are tight for quantum states of practical interest. Our study overcomes the limitation of conventional research either focusing on the asymptotic rate or ignoring the computability. For the coherence distillation, we perform finite analysis for both deterministic and probabilistic scenarios. Our results unveil several new features of coherence from a resource theoretic viewpoint and contribute to an increased understanding of the fundamental properties of different sets of free operations. In the second part, we investigate the resource cost of simulating a quantum channel via quantum coherence or another quantum channel. We introduce the channel’s analogs of max-relative entropy, logarithmic robustness and max-information of quantum states, providing their operational interpretation with the channel simulation cost via different resources. Particularly, we establish the asymptotic equipartition property of the channel’s max-information, that is, it converges to the quantum mutual information of the channel in the independent and identically distributed asymptotic limit. As applications, this asymptotic equipartition property implies the quantum reverse Shannon theorem in the presence of non-signalling correlations. From the perspective of resource theory, the worth of a resource can usually be characterized by the minimum distance to a set of useless resources under a proper distance measure. We give such characterization for all the tasks studied in this thesis, and find that the distance measure for the distillation and simulation process naturally corresponds to the quantum hypothesis testing relative entropy and the max-relative entropy, respectively.