Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2512.16878

Random purification channel for passive Gaussian bosons

Francesco Anna Mele, Filippo Girardi, Senrui Chen, Marco Fanizza, Ludovico Lami

quant-phcond-mat.othermath-phSubmitted Dec 18, 2025• Announced Dec 19, 2025• 0 citations
arXivHTMLPDF

Abstract

The random purification channel, which, given $n$ copies of an unknown mixed state $ρ$, prepares $n$ copies of an associated random purification, has proved to be an extremely valuable tool in quantum information theory. In this work, we construct a Gaussian version of this channel that, given $n$ copies of a bosonic passive Gaussian state, prepares $n$ copies of one of its randomly chosen Gaussian purifications. The construction has the additional advantage that each purification has a mean photon number which is exactly twice that of the initial state. Our construction relies on the characterisation of the commutant of passive Gaussian unitaries via the representation theory of dual reductive pairs of unitary groups.

Comments
13 pages. See independent work [arXiv:2512.15690] by Walter and Witteveen

Related papers

A random purification channel for arbitrary symmetries with applications to fermions and bosons

Michael Walter, Freek Witteveen

The random purification channel maps n copies of any mixed quantum state to n copies of a random purification of the state. We generalize this construction to arbitrary symmetries: for any group G of unitaries, we construct a quantum channel that maps states contained in the algebra generated by G to random purifications obtained by twirling over G. In addition to giving a surprisingly concise proof of the original random purification theorem, our result implies the existence of fermionic and bosonic Gaussian purification channels. As applications, we obtain the first tomography protocol for fermionic Gaussian states that scales optimally with the number of modes and the error, as well as an improved property test for this class of states.

quant-pharXiv:2512.15690•Dec 18, 2025•0 citations

Random purification channel made simple

Filippo Girardi, Francesco Anna Mele, Ludovico Lami

The recently introduced random purification channel, which converts $n$ i.i.d. copies of any mixed quantum state into a uniform convex combination of $n$ i.i.d. copies of its purifications, has proved to be an extremely useful tool in quantum learning theory. Here we give a remarkably simple construction of this channel, making its known properties -- and several new ones -- immediately transparent. In particular, we show that the channel also purifies non-i.i.d. states: it transforms any permutationally symmetric state into a uniform convex combination of permutationally symmetric purifications, each differing only by a tensor-product unitary acting on the purifying system. We then apply the channel to give a one-line proof of (a stronger version of) the recently established Uhlmann's theorem for quantum divergences.

quant-pharXiv:2511.23451•Physical Review Letters•Dec 1, 2025•0 citations

Optimal cloning of mixed states

Marco Fanizza, Dmitry Grinko, Thilo Scharnhorst +1 more

We consider the problem of approximate cloning of quantum states: given $n$ copies of an unknown state $ρ\in \mathbb{C}^{d \times d}$, prepare an $(n+k)$-copy state with high fidelity to $ρ^{\otimes (n+k)}$. Werner's pure state cloner is the optimal channel for the pure state case, and shows that $n = Θ(kd/\varepsilon)$ copies are necessary and sufficient to clone $k$ additional copies of an unknown pure state to fidelity $1-\varepsilon$. The random purification channel gives a straightforward extension of Werner's cloner to mixed state inputs: given $n$ copies of a mixed state, randomly purify your input, apply Werner's channel in the larger Hilbert space, and then trace out the auxiliary registers. This gives a mixed state cloner using $n = O(krd/\varepsilon)$ copies to clone rank-$r$ states. Can one do any better? We show that the answer is no: one must use $n = Ω(krd/\varepsilon)$ copies. We prove our lower bound by studying the special case of projector cloning, in which the input state $ρ$ is promised to be of the form $P/r$, where $P$ is a rank-$r$ orthogonal projector. As a further application of our techniques, we consider the closely related problem of approximate transposition of quantum states, where one seeks to convert $ρ^{\otimes n}$ to a $k$-copy state with high fidelity to $(ρ^T)^{\otimes k}$. Here, we again show $n = Θ(krd/\varepsilon)$ copies are necessary and sufficient for this task.

quant-pharXiv:2608.27298•Aug 28, 2026•0 citations

Random dilation superchannel

Satoshi Yoshida, Ryotaro Niwa, Takeru Utsumi +2 more

We present a quantum circuit that implements the random dilation superchannel, transforming parallel queries of an unknown quantum channel into the same number of parallel queries of a randomly chosen dilation isometry of the input channel. This is a natural generalization of the random purification channel, that transforms copies of an unknown mixed state to copies of a randomly chosen purification state. The circuit complexity of our construction is $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. This random dilation superchannel is extended to the sequential queries approximately, by transforming the parallel random dilation isometry into sequential random dilation unitaries with $O(\mathrm{poly}(d_I))$ overhead in the number of queries. We also show that our results can be further extended to the case of quantum superchannels. On the other hand, we show a no-go theorem on the exact random dilation of sequential queries with $o(\mathrm{poly}(\min\{d_I, d_O\}))$ query overhead, showcasing a fundamental difference between the parallel and sequential cases. 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 that transform $n$ parallel queries of an unknown quantum channel $Λ$ to $Θ(n^α)$ parallel queries of $Λ$ for any $α<2$ approximately, and implement its Petz recovery map for the maximally mixed reference state probabilistically and exactly.

quant-pharXiv:2512.21260•Dec 25, 2025•0 citations

Optimal tomography of bosonic and fermionic Gaussian states

Senrui Chen, Marco Fanizza, Filippo Girardi +4 more

The sample complexity is the minimum number of copies required to learn an accurate classical description of a quantum state. Bosonic and fermionic Gaussian quantum states are families of quantum states that play a key role in quantum science and technology, from quantum optics and many-body physics to quantum chemistry, quantum computing, and quantum information theory. Despite their importance, their sample complexity had not been fully determined. We settle this open problem and show that both bosonic and fermionic Gaussian states can be learned using a number of copies that scales quadratically in the number of modes, regardless of whether the state is pure or mixed, and independently of any energy bound on the state. We derive these results by using the representation theory of Gaussian unitaries and by putting forth a generalization of the random purification channel to this setting and beyond.

quant-pharXiv:2607.11847•Jul 14, 2026•0 citations

Random Stinespring superchannel: converting channel queries into dilation isometry queries

Filippo Girardi, Francesco Anna Mele, Haimeng Zhao +2 more

The recently introduced random purification channel, which converts $n$ copies of an arbitrary mixed quantum state into $n$ copies of the same uniformly random purification, has emerged as a powerful tool in quantum information theory. Motivated by this development, we introduce a channel-level analogue, which we call the random Stinespring superchannel. This consists in a procedure to transform $n$ parallel queries of an arbitrary quantum channel into $n$ parallel queries of the same uniformly random Stinespring isometry, via universal encoding and decoding operations that are efficiently implementable. When the channel is promised to have Choi rank at most $r$, the procedure can be tailored to yield a Stinespring environment of dimension $r$. We present two applications of the random Stinespring superchannel, one in quantum Shannon theory and one in quantum learning theory. In quantum Shannon theory, we prove a channel-level analogue of Uhlmann's theorem for quantum divergences. In quantum learning theory, our construction shows that tomography of quantum channels reduces to tomography of isometries. This yields a simple channel learning algorithm, based on existing isometry learning protocols, that matches the performance of the two recently proposed channel tomography algorithms. Complementarily, whereas the optimality of these algorithms had previously been established only up to a logarithmic factor in the dimension, we close this gap by removing this logarithmic factor from the lower bound. Taken together, our results fully establish the optimality of these recently introduced channel learning algorithms, showing that the optimal query complexity of learning a quantum channel with input dimension $d_A$, output dimension $d_B$, and Choi rank $r$ is $Θ(d_A d_B r)$.

quant-pharXiv:2512.20599•Dec 24, 2025•0 citations
The random purification channel, which, given nnn copies of an unknown mixed state ρρρ, prepares nnn copies of an associated random purification, has proved to be an extremely valuable tool in quantum information theory. In this work, we construct a Gaussian version of this channel that, given nnn copies of a bosonic passive Gaussian state, prepares nnn copies of one of its randomly chosen Gaussian purifications. The construction has the additional advantage that each purification has a mean photon number which is exactly twice that of the initial state. Our construction relies on the characterisation of the commutant of passive Gaussian unitaries via the representation theory of dual reductive pairs of unitary groups.
The random purification channel maps n copies of any mixed quantum state to n copies of a random purification of the state. We generalize this construction to arbitrary symmetries: for any group G of unitaries, we construct a quantum channel that maps states contained in the algebra generated by G to random purifications obtained by twirling over G. In addition to giving a surprisingly concise proof of the original random purification theorem, our result implies the existence of fermionic and bosonic Gaussian purification channels. As applications, we obtain the first tomography protocol for fermionic Gaussian states that scales optimally with the number of modes and the error, as well as an improved property test for this class of states.
The recently introduced random purification channel, which converts nnn i.i.d. copies of any mixed quantum state into a uniform convex combination of nnn i.i.d. copies of its purifications, has proved to be an extremely useful tool in quantum learning theory. Here we give a remarkably simple construction of this channel, making its known properties -- and several new ones -- immediately transparent. In particular, we show that the channel also purifies non-i.i.d. states: it transforms any permutationally symmetric state into a uniform convex combination of permutationally symmetric purifications, each differing only by a tensor-product unitary acting on the purifying system. We then apply the channel to give a one-line proof of (a stronger version of) the recently established Uhlmann's theorem for quantum divergences.
We consider the problem of approximate cloning of quantum states: given nnn copies of an unknown state ρ∈Cd×dρ\in \mathbb{C}^{d \times d}ρ∈Cd×d, prepare an (n+k)(n+k)(n+k)-copy state with high fidelity to ρ⊗(n+k)ρ^{\otimes (n+k)}ρ⊗(n+k). Werner's pure state cloner is the optimal channel for the pure state case, and shows that n=Θ(kd/ε)n = Θ(kd/\varepsilon)n=Θ(kd/ε) copies are necessary and sufficient to clone kkk additional copies of an unknown pure state to fidelity 1−ε1-\varepsilon1−ε. The random purification channel gives a straightforward extension of Werner's cloner to mixed state inputs: given nnn copies of a mixed state, randomly purify your input, apply Werner's channel in the larger Hilbert space, and then trace out the auxiliary registers. This gives a mixed state cloner using n=O(krd/ε)n = O(krd/\varepsilon)n=O(krd/ε) copies to clone rank-rrr states. Can one do any better? We show that the answer is no: one must use n=Ω(krd/ε)n = Ω(krd/\varepsilon)n=Ω(krd/ε) copies. We prove our lower bound by studying the special case of projector cloning, in which the input state ρρρ is promised to be of the form P/rP/rP/r, where PPP is a rank-rrr orthogonal projector. As a further application of our techniques, we consider the closely related problem of approximate transposition of quantum states, where one seeks to convert ρ⊗nρ^{\otimes n}ρ⊗n to a kkk-copy state with high fidelity to (ρT)⊗k(ρ^T)^{\otimes k}(ρT)⊗k. Here, we again show n=Θ(krd/ε)n = Θ(krd/\varepsilon)n=Θ(krd/ε) copies are necessary and sufficient for this task.
We present a quantum circuit that implements the random dilation superchannel, transforming parallel queries of an unknown quantum channel into the same number of parallel queries of a randomly chosen dilation isometry of the input channel. This is a natural generalization of the random purification channel, that transforms copies of an unknown mixed state to copies of a randomly chosen purification state. The circuit complexity of our construction is O(poly(n,log⁡dI,log⁡dO))O(\mathrm{poly}(n, \log d_I, \log d_O))O(poly(n,logdI​,logdO​)), where nnn is the number of queries and dId_IdI​ and dOd_OdO​ are the input and output dimensions of the input channel, respectively. This random dilation superchannel is extended to the sequential queries approximately, by transforming the parallel random dilation isometry into sequential random dilation unitaries with O(poly(dI))O(\mathrm{poly}(d_I))O(poly(dI​)) overhead in the number of queries. We also show that our results can be further extended to the case of quantum superchannels. On the other hand, we show a no-go theorem on the exact random dilation of sequential queries with o(poly(min⁡{dI,dO}))o(\mathrm{poly}(\min\{d_I, d_O\}))o(poly(min{dI​,dO​})) query overhead, showcasing a fundamental difference between the parallel and sequential cases. 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 rrr is the least possible (i.e., r=dI/dOr = d_I/d_Or=dI​/dO​), we show quantum circuits that transform nnn parallel queries of an unknown quantum channel ΛΛΛ to Θ(nα)Θ(n^α)Θ(nα) parallel queries of ΛΛΛ for any α<2α<2α<2 approximately, and implement its Petz recovery map for the maximally mixed reference state probabilistically and exactly.
The sample complexity is the minimum number of copies required to learn an accurate classical description of a quantum state. Bosonic and fermionic Gaussian quantum states are families of quantum states that play a key role in quantum science and technology, from quantum optics and many-body physics to quantum chemistry, quantum computing, and quantum information theory. Despite their importance, their sample complexity had not been fully determined. We settle this open problem and show that both bosonic and fermionic Gaussian states can be learned using a number of copies that scales quadratically in the number of modes, regardless of whether the state is pure or mixed, and independently of any energy bound on the state. We derive these results by using the representation theory of Gaussian unitaries and by putting forth a generalization of the random purification channel to this setting and beyond.
The recently introduced random purification channel, which converts nnn copies of an arbitrary mixed quantum state into nnn copies of the same uniformly random purification, has emerged as a powerful tool in quantum information theory. Motivated by this development, we introduce a channel-level analogue, which we call the random Stinespring superchannel. This consists in a procedure to transform nnn parallel queries of an arbitrary quantum channel into nnn parallel queries of the same uniformly random Stinespring isometry, via universal encoding and decoding operations that are efficiently implementable. When the channel is promised to have Choi rank at most rrr, the procedure can be tailored to yield a Stinespring environment of dimension rrr. We present two applications of the random Stinespring superchannel, one in quantum Shannon theory and one in quantum learning theory. In quantum Shannon theory, we prove a channel-level analogue of Uhlmann's theorem for quantum divergences. In quantum learning theory, our construction shows that tomography of quantum channels reduces to tomography of isometries. This yields a simple channel learning algorithm, based on existing isometry learning protocols, that matches the performance of the two recently proposed channel tomography algorithms. Complementarily, whereas the optimality of these algorithms had previously been established only up to a logarithmic factor in the dimension, we close this gap by removing this logarithmic factor from the lower bound. Taken together, our results fully establish the optimality of these recently introduced channel learning algorithms, showing that the optimal query complexity of learning a quantum channel with input dimension dAd_AdA​, output dimension dBd_BdB​, and Choi rank rrr is Θ(dAdBr)Θ(d_A d_B r)Θ(dA​dB​r).