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 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 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.
Pure quantum states are a fundamental resource for quantum information processing, but unavoidable noise degrades their purity and limits the performance of quantum tasks. Quantum state purification attempts to restore purity by jointly processing several noisy copies of an unknown state, typically in a probabilistic way. Whether purification is possible, and how much it can achieve, depends strongly on the set of operations that are physically allowed. In this work, we study universal purification under \textit{energy-preserving operations}, which cannot exchange energy with an external environment. We identify exactly when the energy-preserving constraint forbids any universal purification advantage, and we provide concrete examples in which an advantage available to unrestricted operations disappears under energy conservation. When energy-preserving purification remains possible, we determine its optimal fidelity and success probability and construct the corresponding protocols. The framework includes unrestricted purification as a special case and extends naturally to purification assisted by an external energy resource.
Quantum state purification protocols, which mitigate noise by converting multiple copies of noisy quantum states into fewer copies with a lower noise level, have applications in quantum communication and computation with imperfect devices. Here, we systematically study the task of state purification in distributed quantum systems, demanding that purification be achieved by local operations and classical communication (LOCC). We prove that, in the presence of depolarizing noise, no LOCC purification protocol starting from two copies can work blindly for all the states in three important sets: the set of all pure two-qubit states, the set of all two-qubit maximally entangled states, and the Bell basis. In stark contrast, we show that a targeted, single-state purification is always achievable in the presence of depolarizing noise, and we provide an explicit analytical LOCC protocol for every given two-qubit state. For arbitrary finite sets of pure states and arbitrary noise profiles, we develop an optimization-based algorithm that systematically designs LOCC purification protocols, and we demonstrate it through concrete examples. Overall, our results identify both fundamental limitations and practical noise-reduction strategies for distributed quantum information processing.
Abstract Quantum state purification is crucial in quantum communication and computation, aiming to recover a purified state from multiple copies of an unknown noisy state. This work introduces a general state purification framework designed to achieve the highest fidelity with a specified probability and characterize the associated trade-offs. For i.i.d. quantum states under depolarizing noise, our framework can replicate the purification protocol proposed by Barenco et al (1997 SIAM J. Comput. 26 1541–57) and further provide exact formulas for the purification fidelity and probability with explicit trade-offs. We prove the protocols’ optimality for two copies of noisy states with any dimension and confirm its optimality for higher numbers of copies and dimensions through numerical analysis. Our methodological approach paves the way for proving the protocol’s optimality in more general scenarios and leads to optimal protocols for other noise models. Furthermore, we present a systematic implementation method via block encoding and parameterized quantum circuits, providing explicit circuits for purifying three-copy and four-copy states under depolarizing noise. Finally, we estimate the sample complexity and generalize the protocol to a recursive form, demonstrating its practicality for quantum computers with limited memory.
Quantum gates executed on physical hardware are inevitably degraded by environmental noise. While state purification effectively distills static quantum resources, the dynamic execution of quantum algorithms requires a higher-order approach to mitigate errors on the operations themselves. In this work, we investigate universal unitary purification: the task of utilizing a quantum higher-order operation to partially restore the ideal action of an unknown unitary corrupted by a known noise model. We consider deterministic purification of unknown single-qubit unitaries under independent depolarizing noise with ideal auxiliary operations. We prove that within the indefinite causal order (ICO) framework, no nontrivial 2-slot higher-order operation can universally purify the set of single-qubit unitaries. Overcoming this strict limitation, we establish that a 3-slot parallel architecture provides the minimal realization for nontrivial purification. We analytically derive the optimal average fidelity over all 3-slot ICO strategies and show that a parallel strategy attains it, strictly surpassing trivial strategies through input encoding and joint decoding of the channel outputs and a quantum memory. Furthermore, we provide a concrete quantum circuit construction attaining this optimum. Our results clarify the possibilities and limitations of purifying unknown qubit unitaries under depolarizing noise, offering insights for robust gate design.
Noise remains the primary obstacle to realizing quantum advantage, continuously degrading the resources that enable quantum technologies. Purification aims to reverse this degradation by extracting high-fidelity resources from noisy ensembles, yet its conventional formulation is intrinsically static, acting only after noise has taken effect. Here we instead recast purification as a dynamical task, introducing a spatiotemporal framework that distributes interventions across the noise process. This formulation reveals operational capabilities inaccessible to existing approaches and gives rise to forward-assisted purifications that extend achievable performance. In certain regimes, a single-copy protocol already exceeds what can be achieved with up to 50 copies under conventional purification, demonstrating a significant overhead in required resources. Beyond these gains, our framework circumvents no-purification theorems within conventional protocols, including for Bell-state ensembles, thereby enabling purification previously considered impossible and pointing toward an efficient route to mitigating noise in quantum systems.