Quantum Purity Amplification for Arbitrary Eigenstates and Multiple Outputs

Abstract:Quantum purity amplification (QPA) is the task of coherently transforming $n$ copies of a mixed state into high-fidelity copies of a chosen eigenstate. We develop a general theory of QPA for $n$ input copies, $m$ output copies, and arbitrary choices of target eigenstate, local dimension $d$, and input spectrum. We introduce the overhang-removal protocol, derive its all-site and one-site fidelities across output regimes, and show that it is optimal in several regimes, both asymptotically and nonasymptotically. For the asymptotic analysis, we use a path-graph parametrization to show that, when the target eigenvalue has a constant spectral gap $D_{k,\mathrm{min}}$, achieving worst-case all-site error $\varepsilon$ scales as $O(m/(\varepsilon D_{k,\mathrm{min}}^2))$. When $m/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 tight dimension-uniform guarantee for optimal QPA. We also provide asymptotically efficient implementations of the overhang-removal 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.

arXiv:2605.21570 [quant-ph]

(or arXiv:2605.21570v2 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2605.21570 Focus to learn more arXiv-issued DOI via DataCite

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.