pith. sign in

arxiv: 2512.21260 · v2 · pith:K5ETII66new · submitted 2025-12-24 · 🪐 quant-ph

Random dilation superchannel

Satoshi Yoshida , Ryotaro Niwa , Takeru Utsumi , Ryuji Takagi , Mio Murao This is my paper

Pith reviewed 2026-05-21 16:55 UTC · model grok-4.3

classification 🪐 quant-ph
keywords quantum channelStinespring dilationrandom dilation superchannelquantum circuitstorage and retrievalPetz recovery mapsequential vs parallel queries
0
0 comments X

The pith

A quantum circuit turns parallel queries to an unknown channel into queries to a random dilation isometry of that channel.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper constructs a quantum circuit that takes n parallel uses of an unknown quantum channel and produces n parallel uses of a randomly chosen Stinespring dilation isometry for the same channel. This generalizes the existing random purification technique that works for unknown mixed states. The circuit runs with polynomial complexity in the number of queries and the logarithms of the input and output dimensions. The authors also give an approximate construction for sequential queries, a no-go theorem ruling out efficient exact sequential versions, and an application to storage-and-retrieval of unknown channels that improves program cost exponentially in the retrieval error.

Core claim

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. The circuit complexity is O(poly(n, log d_I, log d_O)). 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(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

What carries the argument

The random dilation superchannel, implemented by a circuit that selects and applies a random Stinespring dilation isometry without knowledge of the unknown channel.

If this is right

  • Enables storage-and-retrieval of an unknown quantum channel with program cost that improves exponentially in the retrieval error ε.
  • For minimal Kraus rank r = d_I/d_O, transforms n parallel queries approximately into Θ(n^α) parallel queries for any α < 2.
  • Implements the Petz recovery map for the maximally mixed reference state both probabilistically and exactly.
  • Extends the random dilation construction to quantum superchannels.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The separation between parallel and sequential cases indicates that access model strongly affects what manipulations of channels are efficient.
  • The technique may let protocols that rely on random purifications of states be adapted to channels.
  • Approximate sequential versions could still support useful quantum information tasks even if exact ones are ruled out.

Load-bearing premise

A suitably distributed random dilation isometry can be chosen and realized by a circuit whose structure does not depend on the unknown channel.

What would settle it

Running the circuit on a known test channel such as the identity channel and checking whether the output statistics match the expected distribution over random dilations would confirm or refute the construction.

Figures

Figures reproduced from arXiv: 2512.21260 by Mio Murao, Ryotaro Niwa, Ryuji Takagi, Satoshi Yoshida, Takeru Utsumi.

Figure 1
Figure 1. Figure 1: FIG. 1. Quantum circuit implementing the random purifica [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: FIG. 2. (a) Quantum circuit implementing the random dilation superchannel [PITH_FULL_IMAGE:figures/full_fig_p003_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: FIG. 3. Quantum circuits implementing transformation of [PITH_FULL_IMAGE:figures/full_fig_p004_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: FIG. 4. Quantum circuit implementing another construction of the random dilation superchannel [PITH_FULL_IMAGE:figures/full_fig_p005_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: FIG. 5. Quantum circuit implementing the random dilation supersuperchannel Σ that transforms [PITH_FULL_IMAGE:figures/full_fig_p009_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: FIG. 6. The proof idea to get another construction of random dilation superchannel shown in Fig. [PITH_FULL_IMAGE:figures/full_fig_p011_6.png] view at source ↗
read the original 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 $\Lambda$ to $\Theta(n^\alpha)$ parallel queries of $\Lambda$ for any $\alpha<2$ approximately, and implement its Petz recovery map for the maximally mixed reference state probabilistically and exactly.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 3 minor

Summary. The paper claims to construct a quantum circuit that implements the random dilation superchannel for parallel queries to an unknown quantum channel, converting them to queries of a random dilation isometry. The circuit has complexity O(poly(n, log d_I, log d_O)). It provides an approximate extension to sequential queries with O(poly(d_I)) overhead, a no-go theorem for exact sequential random dilation, and applications to efficient storage-retrieval of channels and approximate Petz recovery for minimal Kraus rank cases.

Significance. If the central claims hold, the work is significant because it generalizes the random purification channel to the setting of quantum channels and superchannels. The efficient parallel-query construction, the clear separation between parallel and sequential cases via the no-go result, and the exponential improvement in the storage-retrieval application represent useful advances. The paper provides explicit constructions relying on standard techniques for approximating Haar-random unitaries, which aids reproducibility.

major comments (2)
  1. [Sequential queries extension] The approximate extension to sequential queries is claimed with O(poly(d_I)) overhead. However, the manuscript does not specify how the approximation error in the parallel-to-sequential transformation scales with the number of queries n; this could affect the overall utility for large n.
  2. [No-go theorem] The no-go theorem states that exact random dilation for sequential queries requires Ω(poly(min{d_I, d_O})) query overhead. The proof sketch should clarify whether it applies to all possible distributions over dilations or only uniform ones, as this impacts the strength of the fundamental difference claimed between parallel and sequential cases.
minor comments (3)
  1. The notation d_I and d_O for input and output dimensions is introduced in the abstract but should be defined explicitly at the beginning of the main text for readers.
  2. [Application to storage-and-retrieval] The claim of exponential improvement in program cost with respect to the retrieval error ε would benefit from a direct comparison to the best known previous results in the literature.
  3. Some equations in the complexity analysis could include explicit constants or big-O notation clarifications to avoid ambiguity.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their careful reading of our manuscript and for the constructive comments. We address each major comment point by point below. Where clarifications are needed, we will revise the manuscript accordingly.

read point-by-point responses

  1. Referee: [Sequential queries extension] The approximate extension to sequential queries is claimed with O(poly(d_I)) overhead. However, the manuscript does not specify how the approximation error in the parallel-to-sequential transformation scales with the number of queries n; this could affect the overall utility for large n.

    Authors: We thank the referee for highlighting this omission. The parallel-to-sequential transformation applies an approximate unitary dilation independently to each query. Consequently, the per-query approximation error accumulates linearly with n. To keep the total error below a fixed constant, the per-query error tolerance can be set to scale as 1/n; this adds only a logarithmic factor in n to the overhead while preserving the polynomial dependence on d_I. We will revise the relevant section to state this scaling explicitly and confirm that the overall query complexity remains polynomial in d_I (with an additional log n factor when error control is required). revision: yes

  2. Referee: [No-go theorem] The no-go theorem states that exact random dilation for sequential queries requires Ω(poly(min{d_I, d_O})) query overhead. The proof sketch should clarify whether it applies to all possible distributions over dilations or only uniform ones, as this impacts the strength of the fundamental difference claimed between parallel and sequential cases.

    Authors: We appreciate the referee’s suggestion for greater precision. The no-go result is proven for the uniform distribution over dilations, which is the direct generalization of the random purification channel used in the parallel-query construction. The argument relies on the invariance of the uniform measure on the appropriate Stiefel manifold together with a counting argument on the number of distinct sequential behaviors. We will revise the proof sketch to state explicitly that the theorem applies to the uniform distribution, thereby preserving the claimed separation between the parallel and sequential regimes under this canonical choice. revision: yes

Circularity Check

0 steps flagged

No significant circularity in the derivation chain

full rationale

The paper constructs an explicit quantum circuit for the random dilation superchannel by composing fixed random unitaries on ancilla registers with black-box channel queries, independent of the unknown channel. Circuit complexity follows from standard efficient approximations to Haar-random unitaries on the environment space. The approximate sequential extension and no-go theorem for exact sequential dilation are derived separately without reducing the central parallel result to fitted inputs or self-referential definitions. No load-bearing steps rely on self-citations that themselves presuppose the target construction, and the application to storage-and-retrieval uses the circuit as an independent primitive.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The work rests on the standard existence of Stinespring dilations for quantum channels and the ability to implement random isometries via circuits; no free parameters or new invented entities are introduced in the abstract.

axioms (1)
  • standard math Every quantum channel admits a Stinespring dilation to an isometry on a larger space
    Invoked implicitly to guarantee the existence of the random dilation isometry that the superchannel targets.

pith-pipeline@v0.9.0 · 5865 in / 1181 out tokens · 51400 ms · 2026-05-21T16:55:25.904931+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

  • IndisputableMonolith/Foundation/AbsoluteFloorClosure.lean reality_from_one_distinction unclear
    ?
    unclear

    Relation between the paper passage and the cited Recognition theorem.

    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. ... based on the quantum Schur transform and the quantum Fourier transform over the symmetric group.

  • IndisputableMonolith/Cost/FunctionalEquation.lean washburn_uniqueness_aczel unclear
    ?
    unclear

    Relation between the paper passage and the cited Recognition theorem.

    The quantum circuit shown in Fig. 2 (a) implements the random dilation superchannel Ξ that transforms n parallel queries of an unknown quantum channel Λ ...

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Forward citations

Cited by 5 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Quantum channel tomography: optimal bounds and a Heisenberg-to-classical phase transition

    quant-ph 2026-04 unverdicted novelty 7.0

    Quantum channel tomography query complexity transitions from Heisenberg scaling Θ(r d1 d2 / ε) at dilation rate τ=1 to classical scaling Θ(r d1 d2 / ε²) for τ ≥ 1+Ω(1).

  2. Optimal Quantum State Testing Even with Limited Entanglement

    quant-ph 2026-04 unverdicted novelty 7.0

    Algorithms achieve near-optimal quantum state certification with limited entanglement (t=d^2 copies), plus similar results for mixedness testing and purity estimation, supported by lower bounds.

  3. Probabilistic and approximate universal quantum purification machines

    quant-ph 2026-04 unverdicted novelty 7.0

    A machine that purifies two quantum inputs of different rank with positive probability cannot be a linear positive map, ruling out universal probabilistic purification from finite copies; approximate strategies exhibi...

  4. Quantum metrology of mixed states via purification

    quant-ph 2026-05 unverdicted novelty 6.0

    New purification-based reformulations of QCRB and HCRB connect mixed-state metrology bounds to those of purified states, enabling asymptotic attainment of HCRB or 2×QCRB via random channels and individual measurements.

  5. Advances in quantum learning theory with bosonic systems

    quant-ph 2026-05 unverdicted novelty 2.0

    A concise review of sample complexities and methods for tomography and learning in continuous-variable quantum systems, with emphasis on Gaussian versus non-Gaussian states.

Reference graph

Works this paper leans on

53 extracted references · 53 canonical work pages · cited by 5 Pith papers · 18 internal anchors

  1. [1]

    Store the action of Λ into the Choi stateJ Λ

    work page

  2. [2]

    Apply the random purification channel onJ ⊗n Λ to obtain the Choi state ofE V∼Dil(Λ) [V ⊗n]

    work page

  3. [3]

    The above strategy can be described as Fig

    Retrieve the action of the quantum channel EV∼Dil(Λ) [V ⊗n] from its Choi state by using the P-CTC. The above strategy can be described as Fig. 2 (b). The controlled permutation channel ctrl−πsandwiched by the unnormalized maximally entangled state|1⟩ ⟩and the P-CTC can be rewritten as ctrl−π T := X σ∈Sn |σ⟩ ⟨σ| ⊗π(σ)T,(15) as shown in Fig. 2 (a). The abo...

    work page

  4. [4]

    Z. Liu, Z. Du, Z. Cai, and Z.-W. Liu, No universal purifi- cation in quantum mechanics, arXiv:2509.21111 (2025)

    work page arXiv 2025

  5. [5]

    E. Tang, J. Wright, and M. Zhandry, Conjugate queries can help, arXiv:2510.07622 (2025)

    work page internal anchor Pith review Pith/arXiv arXiv 2025

  6. [6]

    Girardi, F

    F. Girardi, F. A. Mele, and L. Lami, Random purification channel made simple, arXiv:2511.23451 (2025)

    work page arXiv 2025

  7. [7]

    Pelecanos, J

    A. Pelecanos, J. Spilecki, E. Tang, and J. Wright, Mixed state tomography reduces to pure state tomography, arXiv:2511.15806 (2025)

    work page arXiv 2025

  8. [8]

    A. A. Mele and L. Bittel, Optimal learning of quantum channels in diamond distance, arXiv:2512.10214 (2025)

    work page arXiv 2025

  9. [9]

    Walter and F

    M. Walter and F. Witteveen, A random purification channel for arbitrary symmetries with applications to fermions and bosons, arXiv:2512.15690 (2025)

    work page arXiv 2025

  10. [10]

    F. A. Mele, F. Girardi, S. Chen, M. Fanizza, and L. Lami, Random purification channel for passive Gaus- sian bosons, arXiv:2512.16878 (2025)

    work page arXiv 2025

  11. [11]

    Quartic quantum theory: an extension of the standard quantum mechanics

    K. ˙Zyczkowski, Quartic quantum theory: an extension of the standard quantum mechanics, Journal of Physics A: Mathematical and Theoretical41, 355302 (2008), arXiv:0804.1247

    work page internal anchor Pith review Pith/arXiv arXiv 2008

  12. [12]

    Transforming quantum operations: quantum supermaps

    G. Chiribella, G. M. D’Ariano, and P. Perinotti, Trans- forming quantum operations: Quantum supermaps, Eu- rophysics Letters83, 30004 (2008), arXiv:0804.0180

    work page internal anchor Pith review Pith/arXiv arXiv 2008

  13. [13]

    Quantum Circuits Architecture

    G. Chiribella, G. M. D’Ariano, and P. Perinotti, Quan- tum Circuit Architecture, Phys. Rev. Lett.101, 060401 (2008), arXiv:0712.1325

    work page internal anchor Pith review Pith/arXiv arXiv 2008

  14. [14]

    Quantum correlations with no causal order

    O. Oreshkov, F. Costa, and ˇC. Brukner, Quantum corre- lations with no causal order, Nature communications3, 1092 (2012), arXiv:1105.4464

    work page internal anchor Pith review Pith/arXiv arXiv 2012

  15. [15]

    K. Chen, N. Yu, and Z. Zhang, Quantum channel to- mography and estimation by local test, arXiv:2512.13614 (2025)

    work page arXiv 2025

  16. [16]

    Beals, Quantum computation of Fourier transforms over symmetric groups, inProceedings of the twenty-ninth annual ACM symposium on Theory of computing(1997) pp

    R. Beals, Quantum computation of Fourier transforms over symmetric groups, inProceedings of the twenty-ninth annual ACM symposium on Theory of computing(1997) pp. 48–53

    work page 1997

  17. [17]

    Kawano and H

    Y. Kawano and H. Sekigawa, Quantum Fourier trans- form over symmetric groups—improved result, Journal of Symbolic Computation75, 219 (2016)

    work page 2016

  18. [18]

    The Quantum Schur Transform: I. Efficient Qudit Circuits

    D. Bacon, I. L. Chuang, and A. W. Harrow, The quan- tum Schur transform: I. efficient qudit circuits (2005), arXiv:quant-ph/0601001

    work page internal anchor Pith review Pith/arXiv arXiv 2005

  19. [19]

    Bacon, I

    D. Bacon, I. L. Chuang, and A. W. Harrow, Efficient Quantum Circuits for Schur and Clebsch-Gordan Trans- forms, Phys. Rev. Lett.97, 170502 (2006), arXiv:quant- ph/0407082

    work page arXiv 2006

  20. [20]

    Burchardt , author J

    A. Burchardt, J. Fei, D. Grinko, M. Larocca, M. Ozols, S. Timmerman, and V. Visnevskyi, High-dimensional quantum Schur transforms, arXiv:2509.22640 (2025)

    work page arXiv 2025

  21. [21]

    Universal super-replication of unitary gates

    G. Chiribella, Y. Yang, and C. Huang, Universal Su- perreplication of Unitary Gates, Phys. Rev. Lett.114, 120504 (2015), arXiv:1412.1349

    work page internal anchor Pith review Pith/arXiv arXiv 2015

  22. [22]

    M. T. Quintino, Q. Dong, A. Shimbo, A. Soeda, and M. Murao, Reversing Unknown Quantum Transforma- tions: Universal Quantum Circuit for Inverting Gen- eral Unitary Operations, Phys. Rev. Lett.123, 210502 (2019), arXiv:1810.06944

    work page arXiv 2019

  23. [23]

    M. T. Quintino, Q. Dong, A. Shimbo, A. Soeda, and M. Murao, Probabilistic exact universal quantum circuits for transforming unitary operations, Phys. Rev. A100, 062339 (2019), arXiv:1909.01366

    work page arXiv 2019

  24. [24]

    Goodman and N

    R. Goodman and N. R. Wallach,Symmetry, Representa- tions, and Invariants, Vol. 255 (Springer, 2009)

    work page 2009

  25. [25]

    G. D. James,The Representation Theory of the Symmet- ric Groups, Vol. 682 (Springer, 2006)

    work page 2006

  26. [26]

    A. W. Harrow,Applications of coherent classical com- munication and the Schur transform to quantum infor- mation theory, Ph.D. thesis, Massachusetts Institute of Technology (2005), arXiv:quant-ph/0512255

    work page internal anchor Pith review Pith/arXiv arXiv 2005

  27. [27]

    The quantum mechanics of time travel through post-selected teleportation

    S. Lloyd, L. Maccone, R. Garcia-Patron, V. Giovan- netti, and Y. Shikano, Quantum mechanics of time travel through post-selected teleportation, Phys. Rev. D84, 025007 (2011), arXiv:1007.2615

    work page internal anchor Pith review Pith/arXiv arXiv 2011

  28. [28]

    M. A. Nielsen and I. L. Chuang, Programmable Quan- tum Gate Arrays, Phys. Rev. Lett.79, 321 (1997), arXiv:quant-ph/9703032

    work page internal anchor Pith review Pith/arXiv arXiv 1997

  29. [29]

    Optimal quantum learning of a unitary transformation

    A. Bisio, G. Chiribella, G. M. D’Ariano, S. Facchini, and P. Perinotti, Optimal quantum learning of a uni- tary transformation, Phys. Rev. A81, 032324 (2010), arXiv:0903.0543

    work page internal anchor Pith review Pith/arXiv arXiv 2010

  30. [30]

    Optimal probabilistic storage and retrieval of unitary channels

    M. Sedl´ ak, A. Bisio, and M. Ziman, Optimal Probabilistic Storage and Retrieval of Unitary Channels, Phys. Rev. Lett.122, 170502 (2019), arXiv:1809.04552

    work page internal anchor Pith review Pith/arXiv arXiv 2019

  31. [31]

    Sedl´ ak and M

    M. Sedl´ ak and M. Ziman, Probabilistic storage and re- trieval of qubit phase gates, Phys. Rev. A102, 032618 (2020), arXiv:2008.09555

    work page arXiv 2020

  32. [32]

    Y. Yang, R. Renner, and G. Chiribella, Optimal Univer- sal Programming of Unitary Gates, Phys. Rev. Lett.125, 210501 (2020), arXiv:2007.10363

    work page arXiv 2020

  33. [33]

    Sedl´ ak, R

    M. Sedl´ ak, R. St´ arek, N. Horov´ a, M. Miˇ cuda, J. Fiur´ aˇ sek, and A. Bisio, Storage and retrieval of two unknown uni- tary channels, arXiv:2410.23376 (2024)

    work page arXiv 2024

  34. [34]

    Quantum Advantage in Storage and Retrieval of Isometry Channels

    S. Yoshida, J. Miyazaki, and M. Murao, Quantum ad- vantage in storage and retrieval of isometry channels, 7 arXiv:2507.10784 (2025)

    work page internal anchor Pith review Pith/arXiv arXiv 2025

  35. [35]

    Structure of states which satisfy strong subadditivity of quantum entropy with equality

    P. Hayden, R. Jozsa, D. Petz, and A. Winter, Structure of States Which Satisfy Strong Subadditivity of Quantum Entropy with Equality, Communications in mathemati- cal physics246, 359 (2004), arXiv:quant-ph/0304007

    work page internal anchor Pith review Pith/arXiv arXiv 2004

  36. [36]

    Gily´ en, S

    A. Gily´ en, S. Lloyd, I. Marvian, Y. Quek, and M. M. Wilde, Quantum Algorithm for Petz Recovery Channels and Pretty Good Measurements, Phys. Rev. Lett.128, 220502 (2022)

    work page 2022

  37. [37]

    Gily´ en, Y

    A. Gily´ en, Y. Su, G. H. Low, and N. Wiebe, Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics, inPro- ceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019 (Association for Computing Machinery, New York, NY, USA, 2019) pp. 193–204, arXiv:1806.01838

    work page arXiv 2019

  38. [38]

    Utsumi, Y

    T. Utsumi, Y. Nakata, Q. Wang, and R. Tak- agi, Quantum algorithms for Uhlmann transformation, arXiv:2509.03619 (2025)

    work page arXiv 2025

  39. [39]

    J. Haah, R. Kothari, R. O’Donnell, and E. Tang, Query- optimal estimation of unitary channels in diamond dis- tance, in2023 IEEE 64th Annual Symposium on Foun- dations of Computer Science (FOCS)(IEEE, 2023) pp. 363–390, arXiv:2302.14066

    work page arXiv 2023

  40. [40]

    Yoshida, A

    S. Yoshida, A. Soeda, and M. Murao, Universal adjointa- tion of isometry operations using conversion of quantum supermaps, Quantum9, 1750 (2025), arXiv:2401.10137

    work page arXiv 2025

  41. [41]

    Yoshida, A

    S. Yoshida, A. Soeda, and M. Murao, Reversing Unknown Qubit-Unitary Operation, Deterministically and Exactly, Phys. Rev. Lett.131, 120602 (2023), arXiv:2209.02907

    work page arXiv 2023

  42. [42]

    Y.-A. Chen, Y. Mo, Y. Liu, L. Zhang, and X. Wang, Quantum algorithm for reversing unknown unitary evo- lutions, arXiv:2403.04704 (2024)

    work page arXiv 2024

  43. [43]

    Girardi, F

    F. Girardi, F. A. Mele, H. Zhao, M. Fanizza, and L. Lami, Random Stinespring superchannel: converting channel queries into dilation isometry queries, arXiv:2512.20599 (2025)

    work page arXiv 2025

  44. [44]

    C. A. Fuchs and J. Van De Graaf, Cryptographic Distin- guishability Measures for Quantum Mechanical States, IEEE Transactions on Information Theory45, 1216 (2002), arXiv:quant-ph/9712042

    work page internal anchor Pith review Pith/arXiv arXiv 2002

  45. [45]

    Miyazaki, A

    J. Miyazaki, A. Soeda, and M. Murao, Complex conjuga- tion supermap of unitary quantum maps and its univer- sal implementation protocol, Phys. Rev. Res.1, 013007 (2019), arXiv:1706.03481

    work page arXiv 2019

  46. [46]

    Asymptotic teleportation scheme as a universal programmable quantum processor

    S. Ishizaka and T. Hiroshima, Asymptotic Telepor- tation Scheme as a Universal Programmable Quan- tum Processor, Phys. Rev. Lett.101, 240501 (2008), arXiv:0807.4568

    work page internal anchor Pith review Pith/arXiv arXiv 2008

  47. [47]

    Quantum teleportation scheme by selecting one of multiple output ports

    S. Ishizaka and T. Hiroshima, Quantum teleportation scheme by selecting one of multiple output ports, Phys. Rev. A79, 042306 (2009), arXiv:0901.2975

    work page internal anchor Pith review Pith/arXiv arXiv 2009

  48. [48]

    Port-based teleportation in arbitrary dimension

    M. Studzi´ nski, S. Strelchuk, M. Mozrzymas, and M. Horodecki, Port-based teleportation in arbi- trary dimension, Scientific reports7, 10871 (2017), arXiv:1612.09260

    work page internal anchor Pith review Pith/arXiv arXiv 2017

  49. [49]

    Grinko, A

    D. Grinko, A. Burchardt, and M. Ozols, Gelfand-Tsetlin basis for partially transposed permutations, with applica- tions to quantum information, arXiv:2310.02252 (2023)

    work page arXiv 2023

  50. [50]

    Grinko, A

    D. Grinko, A. Burchardt, and M. Ozols, Effi- cient quantum circuits for port-based teleportation, arXiv:2312.03188 (2023)

    work page arXiv 2023

  51. [51]

    J. Fei, S. Timmerman, and P. Hayden, Efficient quantum algorithm for port-based teleportation, arXiv:2310.01637 (2023)

    work page arXiv 2023

  52. [52]

    Q. T. Nguyen, The mixed Schur transform: effi- cient quantum circuit and applications, arXiv:2310.01613 (2023)

    work page arXiv 2023

  53. [53]

    Klimyk and N

    A. Klimyk and N. Y. Vilenkin,Representation of Lie Groups and Special Functions: Recent Advances (Springer, 1995). End Matter Proof of Thm. 1.As shown in Lem. 2.16 of Ref. [2], the random purification is given by E|ψ⟩∼Pur(ρ) h |ψ⟩ ⟨ψ|⊗n i = X λ⊢n mλX i,i′=1 U(n,r)† Sch (|λ⟩ ⟨λ| ⊗πUλ ⊗ |i⟩ ⟨i′|)U(n,r) Sch ⊗U (n,d)† Sch [|λ⟩ ⟨λ| ⊗fλ(ρ)⊗ |i⟩ ⟨i′|]U (n,d) Sch...

    work page 1995