Abstract

We prove that the linearity and positivity of quantum mechanics impose general restrictions on quantum purification, unveiling a new fundamental limitation of quantum information processing. In particular, no quantum operation can transform a finite number of copies of an unknown quantum state or channel into a pure state or channel that depends on the input, thereby ruling out an important form of universal purification in both static and dynamical settings. Relaxing the requirement of exact pure output, we further extend our result to establish quantitative sample complexity bounds for approximate purification, independent of any task details or operational constraints. To illustrate the practical consequences of this principle, we examine the task of approximately preparing pure dilation and, for the first time, prove an exponential lower bound on the required sample complexity.

Personal information

Zhenhuan Liu is currently a research assistant in Yau Mathematical Sciences Center, Tsinghua University. Zhenhuan got his PhD degree from the Institute for Interdisciplinary Information Science, Tsinghua University in 2025. He received his bachelor’s degree from the School of Physics, Peking University, in 2020 and started doctoral research on quantum information science. He has published several papers on entanglement detection, quantum learning, quantum error mitigation, quantum algorithms, quantum foundation, and quantum field theory. 

Reference

https://arxiv.org/abs/2509.21111