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:1909.02540 · Physical Review Letters

No-Go Theorems for Quantum Resource Purification

Kun Fang, Zi-Wen Liu

Published Aug 6, 2020• 107 citations
arXivHTMLPDF

Abstract

The manipulation of quantum "resources" such as entanglement, coherence, and magic states lies at the heart of quantum science and technology, empowering potential advantages over classical methods. In practice, a particularly important kind of manipulation is to "purify" the quantum resources since they are inevitably contaminated by noise and thus often lose their power or become unreliable for direct usage. Here we prove fundamental limitations on how effectively generic noisy resources can be purified enforced by the laws of quantum mechanics, which universally apply to any reasonable kind of quantum resource. More explicitly, we derive nontrivial lower bounds on the error of converting any full-rank noisy state to any target pure resource state by any free protocol (including probabilistic ones)-it is impossible to achieve perfect resource purification, even probabilistically. Our theorems indicate strong limits on the efficiency of distillation, a widely used type of resource purification routine that underpins many key applications of quantum information science. In particular, this general result induces the first explicit lower bounds on the resource cost of magic state distillation, a leading scheme for realizing scalable fault-tolerant quantum computation. Implications for the standard error-correction-based methods are specifically discussed.

DOI
10.1103/physrevlett.125.060405

Related papers

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

Virtual Quantum Resource Distillation

Xiao Yuan, Bartosz Regula, Ryuji Takagi +1 more

Distillation, or purification, is central to the practical use of quantum resources in noisy settings often encountered in quantum communication and computation. Conventionally, distillation requires using some restricted "free" operations to convert a noisy state into one that approximates a desired pure state. Here, we propose to relax this setting by only requiring the approximation of the measurement statistics of a target pure state, which allows for additional classical postprocessing of the measurement outcomes. We show that this extended scenario, which we call "virtual resource distillation," provides considerable advantages over standard notions of distillation, allowing for the purification of noisy states from which no resources can be distilled conventionally. We show that general states can be virtually distilled with a cost (measurement overhead) that is inversely proportional to the amount of existing resource, and we develop methods to efficiently estimate such cost via convex and semidefinite programming, giving several computable bounds. We consider applications to coherence, entanglement, and magic distillation, and an explicit example in quantum teleportation (distributed quantum computing). This work opens a new avenue for investigating generalized ways to manipulate quantum resources.

arXiv:2303.00955•Physical Review Letters•Feb 2, 2024•25 citations

A Nonstabilizerness Resource Law for Universal Quantum State Purification

Keming He, Enji Xiong, Xin Wang

Quantum state purification aims to recover higher-fidelity quantum states from multiple noisy copies and is a fundamental primitive for quantum information processing. Magic resources enable operations beyond classically simulable dynamics and are central to universal fault-tolerant quantum computation. Recent no-go results show that classically simulable operations cannot achieve a nontrivial universal fidelity gain. This motivates a quantitative theory of the magic required for purification at prescribed success probability and target fidelity. For universal purification with two input copies, we prove an exact linear mana law in odd dimensions and a two-sided linear robustness law for multi-qubit systems, which becomes exact for a single qubit. We also identify an explicit successful purification map that makes the tradeoff transparent. These results establish universal purification as a task obeying a quantitative magic-fidelity law and link magic resources to error mitigation and fault-tolerant quantum information processing.

quant-pharXiv:2607.08626•Jul 10, 2026•1 citation

Probabilistic Transformations of Quantum Resources

Bartosz Regula

The difficulty in manipulating quantum resources deterministically often necessitates the use of probabilistic protocols, but the characterization of their capabilities and limitations has been lacking. We develop a general approach to this problem by introducing a new resource monotone that obeys a very strong type of monotonicity: it can rule out all transformations, probabilistic or deterministic, between states in any quantum resource theory. This allows us to place fundamental limitations on state transformations and restrict the advantages that probabilistic protocols can provide over deterministic ones, significantly strengthening previous findings and extending recent no-go theorems. We apply our results to obtain a substantial improvement in bounds for the errors and overheads of probabilistic distillation protocols, directly applicable to tasks such as entanglement or magic state distillation, and computable through convex optimization. In broad classes of resources, we strengthen our results to show that the monotone completely governs probabilistic transformations-it serves as a necessary and sufficient condition for state convertibility. This endows the monotone with a direct operational interpretation, as it can exactly quantify the highest fidelity achievable in resource distillation tasks by means of any probabilistic manipulation protocol.

arXiv:2109.04481•Physical Review Letters•Mar 18, 2022•49 citations

No-Go Theorems for Universal Quantum State Purification via Classically Simulable Operations

Keming He, Chengkai Zhu, Hongshun Yao +3 more

Quantum state purification, a process that aims to recover a state closer to a system's principal eigenstate from multiple copies of an unknown noisy quantum state, is crucial for restoring noisy states to a more useful form in quantum information processing. Fault-tolerant quantum computation relies on stabilizer operations, which are classically simulable operations critical for error correction but inherently limited in computational power. In this Letter, we investigate the limitations of classically simulable operations for quantum state purification. We demonstrate that while certain classically simulable operations can enhance fidelity for specific noisy state ensembles, they cannot achieve universal purification. We prove that neither deterministic nor probabilistic protocols using only classically simulable operations can achieve universal two-to-one purification for qubit systems or systems of any odd dimension. We further extend this no-go result to state purification using three and four copies via semidefinite programming and numerical evidence. Our findings highlight the indispensable role of nonstabilizer resources and the inherent limitations of classically simulable operations in quantum state purification, emphasizing the necessity of harnessing the full power of quantum operations for robust quantum information processing.

arXiv:2504.10516•Physical Review Letters•Feb 4, 2026•5 citations

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
The manipulation of quantum "resources" such as entanglement, coherence, and magic states lies at the heart of quantum science and technology, empowering potential advantages over classical methods. In practice, a particularly important kind of manipulation is to "purify" the quantum resources since they are inevitably contaminated by noise and thus often lose their power or become unreliable for direct usage. Here we prove fundamental limitations on how effectively generic noisy resources can be purified enforced by the laws of quantum mechanics, which universally apply to any reasonable kind of quantum resource. More explicitly, we derive nontrivial lower bounds on the error of converting any full-rank noisy state to any target pure resource state by any free protocol (including probabilistic ones)-it is impossible to achieve perfect resource purification, even probabilistically. Our theorems indicate strong limits on the efficiency of distillation, a widely used type of resource purification routine that underpins many key applications of quantum information science. In particular, this general result induces the first explicit lower bounds on the resource cost of magic state distillation, a leading scheme for realizing scalable fault-tolerant quantum computation. Implications for the standard error-correction-based methods are specifically discussed.
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.
Distillation, or purification, is central to the practical use of quantum resources in noisy settings often encountered in quantum communication and computation. Conventionally, distillation requires using some restricted "free" operations to convert a noisy state into one that approximates a desired pure state. Here, we propose to relax this setting by only requiring the approximation of the measurement statistics of a target pure state, which allows for additional classical postprocessing of the measurement outcomes. We show that this extended scenario, which we call "virtual resource distillation," provides considerable advantages over standard notions of distillation, allowing for the purification of noisy states from which no resources can be distilled conventionally. We show that general states can be virtually distilled with a cost (measurement overhead) that is inversely proportional to the amount of existing resource, and we develop methods to efficiently estimate such cost via convex and semidefinite programming, giving several computable bounds. We consider applications to coherence, entanglement, and magic distillation, and an explicit example in quantum teleportation (distributed quantum computing). This work opens a new avenue for investigating generalized ways to manipulate quantum resources.
Quantum state purification aims to recover higher-fidelity quantum states from multiple noisy copies and is a fundamental primitive for quantum information processing. Magic resources enable operations beyond classically simulable dynamics and are central to universal fault-tolerant quantum computation. Recent no-go results show that classically simulable operations cannot achieve a nontrivial universal fidelity gain. This motivates a quantitative theory of the magic required for purification at prescribed success probability and target fidelity. For universal purification with two input copies, we prove an exact linear mana law in odd dimensions and a two-sided linear robustness law for multi-qubit systems, which becomes exact for a single qubit. We also identify an explicit successful purification map that makes the tradeoff transparent. These results establish universal purification as a task obeying a quantitative magic-fidelity law and link magic resources to error mitigation and fault-tolerant quantum information processing.
The difficulty in manipulating quantum resources deterministically often necessitates the use of probabilistic protocols, but the characterization of their capabilities and limitations has been lacking. We develop a general approach to this problem by introducing a new resource monotone that obeys a very strong type of monotonicity: it can rule out all transformations, probabilistic or deterministic, between states in any quantum resource theory. This allows us to place fundamental limitations on state transformations and restrict the advantages that probabilistic protocols can provide over deterministic ones, significantly strengthening previous findings and extending recent no-go theorems. We apply our results to obtain a substantial improvement in bounds for the errors and overheads of probabilistic distillation protocols, directly applicable to tasks such as entanglement or magic state distillation, and computable through convex optimization. In broad classes of resources, we strengthen our results to show that the monotone completely governs probabilistic transformations-it serves as a necessary and sufficient condition for state convertibility. This endows the monotone with a direct operational interpretation, as it can exactly quantify the highest fidelity achievable in resource distillation tasks by means of any probabilistic manipulation protocol.
Quantum state purification, a process that aims to recover a state closer to a system's principal eigenstate from multiple copies of an unknown noisy quantum state, is crucial for restoring noisy states to a more useful form in quantum information processing. Fault-tolerant quantum computation relies on stabilizer operations, which are classically simulable operations critical for error correction but inherently limited in computational power. In this Letter, we investigate the limitations of classically simulable operations for quantum state purification. We demonstrate that while certain classically simulable operations can enhance fidelity for specific noisy state ensembles, they cannot achieve universal purification. We prove that neither deterministic nor probabilistic protocols using only classically simulable operations can achieve universal two-to-one purification for qubit systems or systems of any odd dimension. We further extend this no-go result to state purification using three and four copies via semidefinite programming and numerical evidence. Our findings highlight the indispensable role of nonstabilizer resources and the inherent limitations of classically simulable operations in quantum state purification, emphasizing the necessity of harnessing the full power of quantum operations for robust quantum information processing.
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.