Posted

Zhaoyi Li, Elias Theil, Aram W. Harrow, Isaac Chuang (May 22 2026).
Abstract: Quantum purity amplification (QPA) is the task of coherently transforming nn copies of a mixed state into high-fidelity copies of a chosen eigenstate. We solve QPA in the general setting of nn input copies, mm output copies, arbitrary target eigenstates, arbitrary local dimension dd, and generic input spectra. We characterize the optimal channel and derive its all-site and one-site performance laws across output regimes. For the asymptotic analysis, we use a path-graph parametrization to show that, when the target eigenvalue has a constant spectral gap Dk,minD_{k,\mathrm{min}}, achieving all-site error ε\varepsilon requires a number of input copies independent of dd and scaling as O(m/(εDk,min2))O(m/(\varepsilon D_{k,\mathrm{min}}^2)). When m/nm/n approaches a constant, the performance exhibits phase-like regimes, which we characterize explicitly. For the nonasymptotic analysis, we develop a theory of generalized Young diagrams that yields tight sample complexity bounds and provides the first dimension-uniform guarantee for optimal QPA. We also provide asymptotically efficient implementations of the optimal protocol. Together, these results establish QPA as a rigorous example of coherent quantum information processing with dimension-uniform sample complexity, supplying the technical foundation for the coherent-incoherent separation developed in the companion work.

Order by:

Want to join this discussion?

Join our community today and start discussing with our members by participating in exciting events, competitions, and challenges. Sign up now to engage with quantum experts!