Distilling Unitary Operations: A No-Go Theorem and Minimal Realization
Jiayi Zhao, Yu-Ao Chen, Guocheng Zhen, Chengkai Zhu, Ranyiliu Chen, and Xin Wang

TL;DR
This paper investigates the fundamental limits of quantum unitary purification, proving no universal purification with two slots exists under indefinite causal order, but three slots suffice for optimal correction.
Contribution
It establishes the minimal realization (three slots) needed for universal purification of noisy unitaries and provides an explicit optimal circuit construction.
Findings
No nontrivial 2-slot purification is possible under indefinite causal order.
A 3-slot architecture achieves the minimal universal purification.
The optimal fidelity surpasses trivial strategies by using ancillary qubits.
Abstract
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 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. Focusing on canonical depolarizing noise, we first reveal a fundamental operational obstruction. We prove that within the indefinite causal order 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 architecture provides the minimal realization for non-trivial universal purification. We…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
