Curator's Take
This article establishes the first quantitative “magic‑resource law” that tells exactly how much nonstabilizer (mana or robustness) is needed to purify noisy quantum states at a given success probability and target fidelity. By proving linear bounds for both odd‑dimensional qudits and multi‑qubit systems, it bridges a gap between abstract resource theory and the practical demands of error mitigation and fault‑tolerant gate synthesis, where magic‑state distillation is already a bottleneck. The explicit purification map also gives experimentalists a concrete protocol to benchmark how much extra “magic” must be injected, although the results currently apply only to two‑copy inputs and idealized operations.
— Mark Eatherly
Summary
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.