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.21260

Random dilation superchannel

Satoshi Yoshida, Ryotaro Niwa, Takeru Utsumi, Ryuji Takagi, Mio Murao

quant-phSubmitted Dec 24, 2025• Announced Dec 25, 2025• 17 citations• Revised May 16, 2026 (v2)
v1 · Dec 24, 2025v2 · May 16, 2026
arXivHTMLPDF

Abstract

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.

Comments
18 pages, 10 figures. See also the independent work arXiv:2512.20599, which constructs a quantum circuit implementing the random dilation superchannel shown in Fig. 2(a) of this work. Two authors are added and the contents are significantly updated from the previous version

Related papers

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•22 citations

On Random Purifications of Isometries and Channels

Eli Goldin

Acorn tricks turn weak quantum resources into stronger "randomized" ones. A recent example is the random purification channel, which turns $t$ copies of a mixed state into $t$ copies of a random purification. We ask whether analogous techniques can turn queries to an isometry into queries to a random unitary completion, or queries to a quantum channel into queries to a random isometry dilation. For an isometry from dimension $N$ to dimension $M$, we give an efficient, stateful simulator for $T$ sequential, forward queries to a fixed Haar random unitary completion. It uses at most one forward isometry query per simulated call, with total trace-distance error $O(T\sqrt{N/(M-T)})$. This lifts isometry query lower bounds to arbitrary unitary completions, and copy complexity lower bounds to forward access to state preparation unitaries, with dimension-dependent loss that can be made arbitrarily small for most applications. Conversely, we construct two distributions on quantum channels distinguishable exactly with two queries to an arbitrary dilation, but requiring exponentially many channel queries for nonnegligible advantage. This rules out efficient simulation of random channel dilations. Our technique also shows that approximating the quantum switch to any constant error below $1/2$ requires exponentially many channel queries, even for identical channels, giving an exponential query advantage for indefinite causal order and improving on Bavaresco et al. (2025). Finally, we show how to "decontrol" controlled forward access to an isometry: any algorithm making controlled queries to $φV$ for a random phase $φ$ can be transformed into one using the same number of uncontrolled forward queries to $V$, generalizing the analogous result for unitaries.

quant-pharXiv:2611.04573•Nov 4, 2026•2 citations

Quantum channel tomography and estimation by local test

Kean Chen, Nengkun Yu, Zhicheng Zhang

We study the estimation of an unknown quantum channel $\mathcal{E}$ with input dimension $d_1$, output dimension $d_2$ and Kraus rank at most $r$. We establish a connection between the query complexities in two models: (i) access to $\mathcal{E}$, and (ii) access to a random dilation of $\mathcal{E}$. Specifically, we show that for parallel (possibly coherent) testers, access to dilations does not help. This is proved by constructing a local tester that uses $n$ queries to $\mathcal{E}$ yet faithfully simulates the tester with $n$ queries to a random dilation. As application, we show that: - $O(rd_1d_2/\varepsilon^2)$ queries to $\mathcal{E}$ suffice for channel tomography to within diamond norm error $\varepsilon$. Moreover, when $rd_2=d_1$, we show that the Heisenberg scaling $O(1/\varepsilon)$ can be achieved, even if $\mathcal{E}$ is not a unitary channel: - $O(\min\{d_1^{2.5}/\varepsilon,d_1^2/\varepsilon^2\})$ queries to $\mathcal{E}$ suffice for channel tomography to within diamond norm error $\varepsilon$, and $O(d_1^2/\varepsilon)$ queries suffice for the case of Choi state trace norm error $\varepsilon$. - $O(\min\{d_1^{1.5}/\varepsilon,d_1/\varepsilon^2\})$ queries to $\mathcal{E}$ suffice for tomography of the mixed state $\mathcal{E}(|0\rangle\langle 0|)$ to within trace norm error $\varepsilon$.

quant-pharXiv:2512.13614•Dec 16, 2025•17 citations

Optimal complex conjugation of unknown isometry channels

Satoshi Yoshida, Mio Murao

Access to the complex conjugate of an unknown quantum channel is a useful resource in quantum oracle problems, motivating the question of how such access can be simulated using only a limited number of calls to the original channel. We determine the optimal deterministic protocol for approximately implementing the complex conjugate isometry $\overline{V}$ from $n$ uses of an unknown isometry channel $V: \mathbb{C}^d\to\mathbb{C}^D$. We derive a closed-form expression for the optimal fidelity and prove that a parallel protocol is optimal even among general quantum superchannels, including adaptive and indefinite-causal-order strategies. The formula implies a query complexity $n=Θ(d[(D-d)/ε+1])$ for achieving infidelity $ε$. We also present a circuit construction based on the quantum Schur transform and the dual Clebsch--Gordan transform, with circuit complexity $O(\mathrm{poly}(D,1/ε))$. This task is extended to the multi-copy case $V^{\otimes n}\mapsto \overline{V}^{\otimes k}$. For fixed $d<D$ and $k$, we show that the optimal fidelity for the multi-copy case is $1-kd(D-d)/n+o(n^{-1})$, and that this value is asymptotically attained by a parallel estimation-based protocol. Finally, combining the isometry protocol with random Stinespring dilations yields a protocol for complex conjugation of unknown rank-$r$ quantum channels whose query complexity is optimal up to a constant factor if the Kraus rank $r$ is constant.

quant-pharXiv:2607.29054•Aug 3, 2026•2 citations

Random purification channel for passive Gaussian bosons

Francesco Anna Mele, Filippo Girardi, Senrui Chen +2 more

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.

quant-pharXiv:2512.16878•Dec 19, 2025•14 citations

Optimal learning of covariant quantum states and channels

Satoshi Yoshida, Kazuki Okigami, Pietro M. Posta +1 more

We give collective tomography protocols for quantum states and channels with known symmetries, using random purification and dilation to reduce learning to pure-state estimation. For states commuting with a compact-group representation with multiplicities $m_λ$, the optimal copy complexity is $Θ((\sum_λm_λ^2+\logη^{-1})/\varepsilon^2)$ for sufficiently small trace-distance error $\varepsilon$ and failure probability $η$ for the nontrivial case $\sum_λm_λ^2>1$. For $G$-covariant channels with finite-dimensional unitary representations of a compact group $G$, parallel $\widetilde{O}(D_G/\varepsilon^2)$ queries achieve a diamond-distance error $\varepsilon $ at fixed success probability $2/3$, where $D_G$ counts the real parameters of covariant Choi operators before imposing trace preservation. For permutation-covariant channels on $k$ qudits of fixed local dimension $d$, at sufficiently small fixed error and fixed success probability $2/3$, we obtain the optimal query scalings $Θ_d(k^{d^4-1})$ for diamond distance and $Θ_d(k^{d^4-d^2})$ for Choi trace distance. Furthermore, we resolve an open problem in quantum tomography of constructing efficient quantum circuits that approximate the Hayashi measurement for optimal pure-state estimation. We encode states in the symmetric subspace into bosonic occupation modes, realize the measurement by heterodyne detection and normalization, and approximate this procedure on qubits using the quantum Hermite transform. Combined with our symmetry-compatible purification and dilation circuits, this yields query-optimal and gate-efficient learners of permutation-covariant states and channels with gate complexity $O_d(\mathrm{poly}(k,\varepsilon^{-1},\logη^{-1}))$.

quant-pharXiv:2609.39280•Oct 1, 2026•0 citations
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 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).
Acorn tricks turn weak quantum resources into stronger "randomized" ones. A recent example is the random purification channel, which turns ttt copies of a mixed state into ttt copies of a random purification. We ask whether analogous techniques can turn queries to an isometry into queries to a random unitary completion, or queries to a quantum channel into queries to a random isometry dilation. For an isometry from dimension NNN to dimension MMM, we give an efficient, stateful simulator for TTT sequential, forward queries to a fixed Haar random unitary completion. It uses at most one forward isometry query per simulated call, with total trace-distance error O(TN/(M−T))O(T\sqrt{N/(M-T)})O(TN/(M−T)​). This lifts isometry query lower bounds to arbitrary unitary completions, and copy complexity lower bounds to forward access to state preparation unitaries, with dimension-dependent loss that can be made arbitrarily small for most applications. Conversely, we construct two distributions on quantum channels distinguishable exactly with two queries to an arbitrary dilation, but requiring exponentially many channel queries for nonnegligible advantage. This rules out efficient simulation of random channel dilations. Our technique also shows that approximating the quantum switch to any constant error below 1/21/21/2 requires exponentially many channel queries, even for identical channels, giving an exponential query advantage for indefinite causal order and improving on Bavaresco et al. (2025). Finally, we show how to "decontrol" controlled forward access to an isometry: any algorithm making controlled queries to φVφVφV for a random phase φφφ can be transformed into one using the same number of uncontrolled forward queries to VVV, generalizing the analogous result for unitaries.
We study the estimation of an unknown quantum channel E\mathcal{E}E with input dimension d1d_1d1​, output dimension d2d_2d2​ and Kraus rank at most rrr. We establish a connection between the query complexities in two models: (i) access to E\mathcal{E}E, and (ii) access to a random dilation of E\mathcal{E}E. Specifically, we show that for parallel (possibly coherent) testers, access to dilations does not help. This is proved by constructing a local tester that uses nnn queries to E\mathcal{E}E yet faithfully simulates the tester with nnn queries to a random dilation. As application, we show that: - O(rd1d2/ε2)O(rd_1d_2/\varepsilon^2)O(rd1​d2​/ε2) queries to E\mathcal{E}E suffice for channel tomography to within diamond norm error ε\varepsilonε. Moreover, when rd2=d1rd_2=d_1rd2​=d1​, we show that the Heisenberg scaling O(1/ε)O(1/\varepsilon)O(1/ε) can be achieved, even if E\mathcal{E}E is not a unitary channel: - O(min⁡{d12.5/ε,d12/ε2})O(\min\{d_1^{2.5}/\varepsilon,d_1^2/\varepsilon^2\})O(min{d12.5​/ε,d12​/ε2}) queries to E\mathcal{E}E suffice for channel tomography to within diamond norm error ε\varepsilonε, and O(d12/ε)O(d_1^2/\varepsilon)O(d12​/ε) queries suffice for the case of Choi state trace norm error ε\varepsilonε. - O(min⁡{d11.5/ε,d1/ε2})O(\min\{d_1^{1.5}/\varepsilon,d_1/\varepsilon^2\})O(min{d11.5​/ε,d1​/ε2}) queries to E\mathcal{E}E suffice for tomography of the mixed state E(∣0⟩⟨0∣)\mathcal{E}(|0\rangle\langle 0|)E(∣0⟩⟨0∣) to within trace norm error ε\varepsilonε.
Access to the complex conjugate of an unknown quantum channel is a useful resource in quantum oracle problems, motivating the question of how such access can be simulated using only a limited number of calls to the original channel. We determine the optimal deterministic protocol for approximately implementing the complex conjugate isometry V‾\overline{V}V from nnn uses of an unknown isometry channel V:Cd→CDV: \mathbb{C}^d\to\mathbb{C}^DV:Cd→CD. We derive a closed-form expression for the optimal fidelity and prove that a parallel protocol is optimal even among general quantum superchannels, including adaptive and indefinite-causal-order strategies. The formula implies a query complexity n=Θ(d[(D−d)/ε+1])n=Θ(d[(D-d)/ε+1])n=Θ(d[(D−d)/ε+1]) for achieving infidelity εεε. We also present a circuit construction based on the quantum Schur transform and the dual Clebsch--Gordan transform, with circuit complexity O(poly(D,1/ε))O(\mathrm{poly}(D,1/ε))O(poly(D,1/ε)). This task is extended to the multi-copy case V⊗n↦V‾⊗kV^{\otimes n}\mapsto \overline{V}^{\otimes k}V⊗n↦V⊗k. For fixed d<Dd<Dd<D and kkk, we show that the optimal fidelity for the multi-copy case is 1−kd(D−d)/n+o(n−1)1-kd(D-d)/n+o(n^{-1})1−kd(D−d)/n+o(n−1), and that this value is asymptotically attained by a parallel estimation-based protocol. Finally, combining the isometry protocol with random Stinespring dilations yields a protocol for complex conjugation of unknown rank-rrr quantum channels whose query complexity is optimal up to a constant factor if the Kraus rank rrr is constant.
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.
We give collective tomography protocols for quantum states and channels with known symmetries, using random purification and dilation to reduce learning to pure-state estimation. For states commuting with a compact-group representation with multiplicities mλm_λmλ​, the optimal copy complexity is Θ((∑λmλ2+log⁡η−1)/ε2)Θ((\sum_λm_λ^2+\logη^{-1})/\varepsilon^2)Θ((∑λ​mλ2​+logη−1)/ε2) for sufficiently small trace-distance error ε\varepsilonε and failure probability ηηη for the nontrivial case ∑λmλ2>1\sum_λm_λ^2>1∑λ​mλ2​>1. For GGG-covariant channels with finite-dimensional unitary representations of a compact group GGG, parallel O~(DG/ε2)\widetilde{O}(D_G/\varepsilon^2)O(DG​/ε2) queries achieve a diamond-distance error $\varepsilon $ at fixed success probability 2/32/32/3, where DGD_GDG​ counts the real parameters of covariant Choi operators before imposing trace preservation. For permutation-covariant channels on kkk qudits of fixed local dimension ddd, at sufficiently small fixed error and fixed success probability 2/32/32/3, we obtain the optimal query scalings Θd(kd4−1)Θ_d(k^{d^4-1})Θd​(kd4−1) for diamond distance and Θd(kd4−d2)Θ_d(k^{d^4-d^2})Θd​(kd4−d2) for Choi trace distance. Furthermore, we resolve an open problem in quantum tomography of constructing efficient quantum circuits that approximate the Hayashi measurement for optimal pure-state estimation. We encode states in the symmetric subspace into bosonic occupation modes, realize the measurement by heterodyne detection and normalization, and approximate this procedure on qubits using the quantum Hermite transform. Combined with our symmetry-compatible purification and dilation circuits, this yields query-optimal and gate-efficient learners of permutation-covariant states and channels with gate complexity Od(poly(k,ε−1,log⁡η−1))O_d(\mathrm{poly}(k,\varepsilon^{-1},\logη^{-1}))Od​(poly(k,ε−1,logη−1)).