Random dilation superchannel

• URL: http://arxiv.org/abs/2512.21260v1
• Date: Wed, 24 Dec 2025 16:09:38 GMT
• Title: Random dilation superchannel
• Authors: Satoshi Yoshida, Ryotaro Niwa, Mio Murao,
• Abstract summary: We present a quantum circuit that implements the random dilation superchannel.<n>We show an efficient storage-and-retrieval of an unknown quantum channel.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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.

Related papers

• Efficient quantum circuits for high-dimensional representations of SU(n) and Ramanujan quantum expanders [0.945747217338747]
  We present efficient quantum circuits that implement high-dimensional unitary irreducible representations (irreps) of $SU(n)$.<n>Our circuits can be used to construct explicit Ramanujan quantum expanders, a longstanding open problem.
  arXiv  Detail & Related papers  (2026-02-16T20:38:26Z)
• Random Stinespring superchannel: converting channel queries into dilation isometry queries [9.841060883971746]
  We introduce a channel-level analogue, which we call the random Stinespring superchannel.<n>We show 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)$.
  arXiv  Detail & Related papers  (2025-12-23T18:46:07Z)
• Sequential quantum processes with group symmetries [0.23332469289621782]
  We show a canonical circuit decomposition of a $(G times H)$-invariant quantum comb for compact groups $G$ and $H$.<n>We derive the optimal quantum comb which transforms an unknown unitary operation $U in mathrmSU(d)$ to its inverse $Udagger$ or transpose $Utop$.
  arXiv  Detail & Related papers  (2025-10-08T14:58:08Z)
• Strong random unitaries and fast scrambling [37.03163411089211]
  We show that strong unitary designs can form in circuit depth $O(log2 n)$ in circuits composed of independent two-qubit Haar-random gates.<n>Our results provide an operational proof of the fast scrambling conjecture from black hole physics.
  arXiv  Detail & Related papers  (2025-09-30T14:23:46Z)
• Shallow quantum circuit for generating O(1)-entangled approximate state designs [6.161617062225404]
  We find a new ensemble of quantum states that serve as an $epsilon$-approximate state $t$-design while possessing extremely low entanglement, magic, and coherence.<n>These resources can reach their theoretical lower bounds, $Omega(log (t/epsilon))$, which are also proven in this work.<n>A class of quantum circuits proposed in our work offers reduced cost for classical simulation of random quantum states.
  arXiv  Detail & Related papers  (2025-07-23T18:56:19Z)
• Singular value transformation for unknown quantum channels [0.7499722271664144]
  We develop a quantum algorithm for transforming a quantum channel's singular values.<n>We show our method applies practically to the problem of learning the $q$-th singular value moments of unknown quantum channels.
  arXiv  Detail & Related papers  (2025-06-30T17:56:07Z)
• Quantum Algorithms for Stochastic Differential Equations: A Schrödingerisation Approach [29.662683446339194]
  We propose quantum algorithms for linear differential equations.<n>The gate complexity of our algorithms exhibits an $mathcalO(dlog(Nd))$ dependence on the dimensions.<n>The algorithms are numerically verified for the Ornstein-Uhlenbeck processes, Brownian motions, and one-dimensional L'evy flights.
  arXiv  Detail & Related papers  (2024-12-19T14:04:11Z)
• Efficient unitary designs and pseudorandom unitaries from permutations [35.66857288673615]
  We show that products exponentiated sums of $S(N)$ permutations with random phases match the first $2Omega(n)$ moments of the Haar measure. The heart of our proof is a conceptual connection between the large dimension (large-$N$) expansion in random matrix theory and the method.
  arXiv  Detail & Related papers  (2024-04-25T17:08:34Z)
• On verifiable quantum advantage with peaked circuit sampling [9.551919087634522]
  We show that getting $1/textpoly(n)$ peakedness from such circuits requires $tau_p = Omega(tau_r/n)0.19)$ with overwhelming probability. We also give numerical evidence that nontrivial peakedness is possible in this model.
  arXiv  Detail & Related papers  (2024-04-22T18:00:06Z)
• On sampling determinantal and Pfaffian point processes on a quantum computer [49.1574468325115]
  DPPs were introduced by Macchi as a model in quantum optics the 1970s. Most applications require sampling from a DPP, and given their quantum origin, it is natural to wonder whether sampling a DPP on a classical computer is easier than on a classical one. Vanilla sampling consists in two steps, of respective costs $mathcalO(N3)$ and $mathcalO(Nr2)$ operations on a classical computer, where $r$ is the rank of the kernel matrix.
  arXiv  Detail & Related papers  (2023-05-25T08:43:11Z)
• On the average-case complexity of learning output distributions of quantum circuits [33.76498647184212]
  We show that learning the output distributions of brickwork random quantum circuits is average-case hard in the statistical query model.<n>This learning model is widely used as an abstract computational model for most generic learning algorithms.
  arXiv  Detail & Related papers  (2023-05-09T20:53:27Z)
• Random quantum circuits transform local noise into global white noise [118.18170052022323]
  We study the distribution over measurement outcomes of noisy random quantum circuits in the low-fidelity regime. For local noise that is sufficiently weak and unital, correlations (measured by the linear cross-entropy benchmark) between the output distribution $p_textnoisy$ of a generic noisy circuit instance shrink exponentially. If the noise is incoherent, the output distribution approaches the uniform distribution $p_textunif$ at precisely the same rate.
  arXiv  Detail & Related papers  (2021-11-29T19:26:28Z)
• Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
  We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
  arXiv  Detail & Related papers  (2020-04-14T11:05:26Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.