Random dilation superchannel

Abstract

We present a quantum circuit that implements the random dilation superchannel, transforming parallel queries of an unknown quantum channel into parallel queries of a randomly chosen dilation isometry of the input channel. This is a natural generalization of a random purification channel, that transforms copies of an unknown mixed state to copies of a randomly chosen purification state. Our construction is based on the quantum Schur transform and the quantum Fourier transform over the symmetric group. By using the efficient construction of these quantum transforms, we can implement the random dilation superchannel with the circuit complexity $O(\mathrm{poly}(n, \log d_I, \log d_O))$, where $n$ is the number of queries and $d_I$ and $d_O$ are the input and output dimensions of the input channel, respectively. As an application, we show an efficient storage-and-retrieval of an unknown quantum channel, which improves the program cost exponentially in the retrieval error $\varepsilon$. For the case where the Kraus rank $r$ is the least possible (i.e., $r = d_I/d_O$), we show quantum circuits transforming $n$ parallel queries of an unknown quantum channel $Λ$ to $Θ(n^α)$ parallel queries of $Λ$ for any $α<2$ approximately, and its Petz recovery map for the reference state given by the maximally mixed state probabilistically and exactly. We also show that our results can be further extended to the case of quantum superchannels.