Probabilistic and approximate universal quantum purification machines

Abstract

We study the task of lifting arbitrary quantum states and channels to purifications and Stinespring dilations, respectively, in both the probabilistic exact and deterministic approximate settings. We formalize this task through a general framework of quantum purification machines that, given a finite number of copies or uses of a black-box input, aim to output a corresponding purification or Stinespring dilation. In the probabilistic exact setting, we show that universality is not necessary to rule out such transformations: the simple requirement that a machine purifies two inputs of different rank with non-zero probability already implies that it cannot be described by a linear positive map. This simple argument captures a fundamental obstruction of quantum theory and recovers the impossibility of universal probabilistic purification from finitely many copies. In the approximate setting, we allow for general machines that are not required, in general, to produce a pure output. Using the minimum average error as our figure of merit, we derive analytical expressions for the performance of several physically motivated strategies as well as a general upper bound on the achievable error, which is tight in a specific regime. Our analysis reveals a trade-off: strategies that produce a pure output - among which we prove the optimal to be a strategy that produces as a fixed output a maximally entangled purification of the fully depolarizing channel - perform optimally between those considered for large environment dimension, while append-environment strategies that generally produce non-pure outputs perform better at small environment dimension.