Pith. sign in

REVIEW 4 minor 69 references

This paper determines the exact optimal fidelity for transforming n uses of an unknown isometry channel V:C^d→C^D into its complex conjugate, and proves a fixed parallel circuit achieves it.

Reviewed by Pith at T0; open to challenge. T0 means a machine referee read the full paper against a public rubric. the ladder, T0–T4 →

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

T0 review · deepseek-v4-flash

2026-08-03 14:37 UTC pith:U5ULMV2T

load-bearing objection This paper closes the isometry complex-conjugation case with a closed-form optimal fidelity and a parallel-optimal proof across all general superchannels; worth serious refereeing, with the isometric Schur–Weyl decomposition as the main external input to check.

arxiv 2607.29054 v1 pith:U5ULMV2T submitted 2026-07-31 quant-ph

Optimal complex conjugation of unknown isometry channels

Satoshi Yoshida , Mio Murao This is my paper
classification quant-ph
keywords isometry channelcomplex conjugationquantum superchannelSchur–Weyl dualityquery complexityStiefel manifoldClebsch–Gordan transformhigher-order quantum transformation
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

The pith

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

The paper asks how well an unknown isometry channel V:C^d→C^D can be turned into its complex conjugate V̄ using only n black-box calls to V. It answers exactly: the optimal average fidelity is a closed-form ratio of representation dimensions, maximized by a 'balanced' Young diagram. The same parallel protocol reaches this value, and no more general strategy—adaptive, or with indefinite causal order—can beat it. When an error ε is allowed, the number of calls needed is Θ(d[(D−d)/ε+1]). The result matters because complex-conjugate access is a distinct resource in quantum oracle problems, and this shows when it can be simulated from forward queries alone.

Core claim

On the paper's own terms, the central discovery is Theorem 6: for n uses of an unknown isometry V:C^d→C^D, the optimal channel fidelity for implementing V̄ is the same for all deterministic protocols, F = max_{λ⊢_d n+1} (1/d)Σ_{α∈λ−□} m^{(D)}_α / m^{(D)}_λ, equal to (1/d)[D−(D−d)R_{d,D,n}] when n+1=qd+r, with R_{d,D,n} an explicit rational function. The maximizer is the balanced diagram λ* and the protocol of Fig. 6—a circuit built from the quantum Schur transform and dual Clebsch–Gordan transform—attains it. Since the upper bound is proven in the fully general quantum-superchannel SDP, the result covers adaptive and indefinite-causal-order strategies, not just parallel ones. The paper exten

What carries the argument

The load-bearing tool is the isometric Schur–Weyl decomposition U^{(n,D)}_{Sch} V^{⊗n} U^{(n,d)†}_{Sch} = ⊕_α V_α⊗1_{S_α}, which splits the n-fold tensor power of an isometry along the same Young diagrams as a unitary, together with Lemma 4, a Haar-orthogonality identity on the Stiefel manifold that evaluates the average over isometries. This turns the performance operator into a diagonal sum over Young diagrams λ⊢_d n+1; maximizing the fidelity becomes maximizing a ratio of Weyl dimensions, solved by a residue-theorem argument that identifies the balanced diagram as the unique maximizer. The circuit uses the quantum Schur transform and the dual Clebsch–Gordan transform to implement the corr

Load-bearing premise

The derivation leans on the claim that averaging over all isometries satisfies the same orthogonality (Lemma 4) and the same Schur–Weyl block structure (Eq. (34), cited from prior work) as averaging over unitaries; if that extension is subtly wrong for isometries, the closed-form fidelity and its optimality proof collapse.

What would settle it

Sample the Stiefel manifold for a small case such as d=2, D=3, n=2: numerically compute the left side of Lemma 4 (the average of V_α(·)V_β^†) for α≠β and for α=β, and check it is zero/diagonal with the stated normalization; a nonzero off-diagonal block would refute the key identity and with it Theorem 6. Alternatively, solve the SDP (58) for this case and compare with Eq. (69).

Watch this falsifier — get emailed when new claim-graph text bears on it.

If this is right

  • No strategy—parallel, adaptive, or indefinite-causal-order—can outperform the parallel Schur/CG-based circuit for one-copy isometry complex conjugation.
  • Achieving diamond-distance error ε requires Θ(d[(D−d)/ε+1]) calls for D>d, and exact conjugation is possible with d−1 calls when D=d.
  • The optimal circuit has O(poly(D,1/ε)) gate complexity, unlike estimation-based approaches whose efficient realization is not known.
  • For multi-copy output V̄^{⊗k}, the asymptotic fidelity is 1−kd(D−d)/n+o(n^{−1}), achieved by a parallel estimation protocol.
  • Combined with random Stinespring dilations, the protocol conjugates an unknown rank-r channel with O(d_in(Δ_Λ/ε+1)) queries, optimal up to a constant factor for constant r.

Where Pith is reading between the lines

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

  • If the optimality proof transfers to other isometry transformations (adjointation, inversion, transposition), parallelism may be optimal for those as well; the same dual-SDP ansatz is a natural testbed.
  • The finite-n gap between this circuit and estimation-based protocols (numerically shown for d=2,D=4) hints that estimation is never strictly optimal here, and a sharper comparison for other dimensions could map where the gap vanishes.
  • The query-complexity equivalence between forward and conjugate access for low-rank channels suggests oracle separations based on conjugate queries (e.g. reality testing) may persist only when rank or dimension gaps are large—a testable claim for learning tasks.
  • The closed form could be re-derived operationally as a complementarity with isometry cloning, in analogy with state transposition and cloning; if true, it would give a no-cloning-type bound for isometries.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Referee Report

0 major / 4 minor

Summary. The paper studies the task of implementing the complex conjugation of an unknown isometry channel V: C^d → C^D using n queries. The main result (Theorem 6) gives a closed-form expression for the optimal average fidelity, equal to max_{λ⊢_d n+1} (1/d) Σ_{α∈λ−□} m_α^{(D)}/m_λ^{(D)}, with an explicit formula depending on n mod d. Achievability is via an explicit parallel circuit based on Schur and dual Clebsch–Gordan transforms (Prop. 9), and optimality among all general superchannels is shown by constructing feasible primal and dual solutions to the corresponding SDP (Props. 7–8). The result implies a query complexity Θ(d[(D−d)/ϵ+1]) for diamond-distance error ϵ. Extensions include an asymptotic multi-copy result and a protocol for complex conjugation of rank-r quantum channels with constant-factor optimal query complexity.

Significance. If correct, the theorem closes a natural open problem and provides one of the few exact characterizations of a channel transformation where a parallel protocol is optimal even against indefinite causal order and other general superchannels. The proof is largely self-contained and rigorous: the performance operator is computed in-paper (Eqs. 89–95), Lemma 4 is proven, the balanced-diagram maximization is detailed, and Props. 7 and 8 give explicit feasible SDP solutions whose validity can be checked independently of the claimed optimum. The paper also includes reproducible numerics (Fig. 8 with code) and falsifiable predictions. These are significant strengths. The only external load-bearing ingredient is the isometric Schur–Weyl decomposition (Eq. 34), which is cited rather than re-proven.

minor comments (4)
  1. [§II-A, Eq. (34)] The isometric Schur–Weyl decomposition (34) is the single most load-bearing external input; all subsequent results (performance operator, circuit derivation, optimality) inherit it. Although it is standard and cited from [38,39,52], the paper would be more self-contained if a short proof or explicit derivation (showing that V^{⊗n} commutes with the S_n action and hence decomposes as ⊕_α V_α⊗1_{S_α} with V_α isometries) were included, perhaps as a lemma. This is a presentation/completeness suggestion, not a correctness concern.
  2. [§III-D, Eq. (135)] The definition of q_ϵ should state the ceiling explicitly (q_ϵ = max{1, ⌈(D−d)(1−ϵ)/ϵ⌉}) to make clear that it is an integer. As typeset, the expression appears not to be integer-valued, which is needed for n = d q_ϵ − 1.
  3. [§II-D, Eq. (61)] The dual SDP for general quantum superchannels is cited from Ref. [59] without derivation. For completeness, a brief explanation of the origin of the constraints (especially Tr_{O_i} W = Tr_{I_i O_i} W ⊗ 1_{I_i}/d) would help readers who are not specialists in higher-order transformations.
  4. [Fig. 2] The arrow diagram in Fig. 2 is dense; expanding the caption to define Δ_Λ and the notation for the query-complexity expressions would improve readability.

Circularity Check

0 steps flagged

No significant circularity: the one-copy optimal fidelity is derived in-paper via an explicit SDP dual/primal pair; self-citations provide standard Schur-Weyl and estimation facts that are independent of the target theorem.

full rationale

The central claim is not obtained from its inputs by construction. The performance operator is evaluated at Eqs. (89)-(95) using Eq. (34), the isometric Schur-Weyl decomposition, and Lemma 4, the Stiefel Haar orthogonality relation. Lemma 4 is proved in-text by left invariance and Schur's lemma, with the normalization checked by traces. Achievability (Prop. 7) and optimality (Prop. 8) construct explicit primal and dual SDP solutions, and the feasibility of the dual ansatz is verified in the paper (Eqs. 116-128); that ansatz is borrowed from Ref. [10], an external published benchmark rather than the authors' own work. The Young-diagram maximization is performed in-text by a residue calculation and balancing argument. No parameter is fitted to a data subset and then renamed as a prediction, and no definition of the fidelity is equivalent by construction to the claimed maximum. The paper does cite several prior works of the same authors in load-bearing positions, notably Eq. (34) from Refs. [38,39,52] and the isometry estimation fidelity of Ref. [52] used in the multi-copy lower bound. These citations are not circular: they are published, parameter-free mathematical results whose stated assumptions do not include the present target result, and the matching multi-copy upper bound is independently proved in Appendix B (Props. 14 and 15). The only mild caveat is that Eq. (34) is cited rather than re-derived, but it is standard Schur-Weyl machinery and the rest of the derivation is self-contained; this warrants at most a low score for self-citation, not a circularity finding.

Axiom & Free-Parameter Ledger

0 free parameters · 5 axioms · 0 invented entities

No free parameters are fitted anywhere in the paper; the closed form follows from SDP duality and Weyl dimension formulas, with the primal/dual ansätze acting as proof certificates rather than fitted constants. The load-bearing inputs are (i) the isometric Schur–Weyl decomposition and Stiefel Haar orthogonality, (ii) the general-superchannel dual SDP characterization, (iii) standard representation theory, and (iv) the random-dilation superchannel. No new physical entities are introduced; the random dilation superchannel is taken from prior work.

axioms (5)
  • domain assumption Isometric Schur–Weyl decomposition: U^{(n,D)}_{Sch} V^{⊗n} U^{(n,d)†}_{Sch} = ⊕_α V_α ⊗ 1_{S_α} with the equivariance (WVU)_α = W_α V_α U_α (Eq. 34), plus the Stiefel Haar orthogonality (Lemma 4, Eq. 36).
    Load-bearing for the performance operator (Eqs. 89–95). Eq. 34 is inherited from the authors' prior works [38,39,52]; Lemma 4 is proven in-text via Schur's lemma on the Stiefel manifold. A subtle failure here would invalidate Theorem 6.
  • domain assumption The GEN superchannel SDP dual (Eq. 61) is a valid characterization of optimal transformations under general (including indefinite-causal-order) quantum superchannels.
    Cited from Refs [58,59]. This carries the claim that parallel protocols are optimal among all general superchannels; a gap in this characterization would break the F^{GEN} upper bound in Prop. 8.
  • standard math Standard representation theory: Weyl dimension formula (Thm 1), branching rules (Thms 2–3), and the dual Clebsch–Gordan property (Eq. 28).
    Cited from Refs [53,56]; used throughout Props. 7–9, the residue-maximization of S_D(λ), and Appendix A.
  • domain assumption Random Stinespring dilation superchannel converts quantum-channel queries into random dilation-isometry queries (Eq. 142).
    Cited from Refs [11,12] (self-cited [12]). Load-bearing for Cor. 11's channel-complex-conjugation query bound and its claimed optimality for constant Kraus rank.
  • domain assumption Fidelity-to-diamond-distance conversion: (1/2)‖Φ_V − \bar{V}‖⋄ ≤ 1 − F_ch(Φ_V, \bar{V}) (Eq. 138, attributed to Lemma S2 of Ref [52]).
    Self-cited (Ref [52] is co-authored by Yoshida and Murao). Used to convert the fidelity formula into the query-complexity upper and lower bounds of Cor. 10.

pith-pipeline@v1.3.0-daily-deepseek · 26186 in / 56856 out tokens · 538957 ms · 2026-08-03T14:37:30.137612+00:00 · methodology

0 comments
read the original abstract

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=\Theta(d[(D-d)/\epsilon+1])$ for achieving infidelity $\epsilon$. 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/\epsilon))$. 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.

Figures

Figures reproduced from arXiv: 2607.29054 by Mio Murao, Satoshi Yoshida.

Figure 1
Figure 1. Figure 1: Illustration of the task of isometry complex conjugation. By using [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Application of this work to complex conjugation of unknown quantum channels. Each arrow indicates a lifting from one access model to another, [PITH_FULL_IMAGE:figures/full_fig_p002_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: An example of the restricted Young lattice [PITH_FULL_IMAGE:figures/full_fig_p004_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: (Left panel) The CG transforms in the quantum circuit. Two input registers correspond to the Weyl modules [PITH_FULL_IMAGE:figures/full_fig_p006_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: The quantum Schur transform U (n,d) Sch in the quantum circuit. It maps the computational-basis registers to the Weyl-module register |uλ⟩, the Specht￾module register |p⟩, and the Young-diagram register |λ⟩. C. Stiefel manifold, its Haar measure, and Schur–Weyl duality applied to isometry channels The set of isometry operators V : C d → C D can be identified with the Stiefel manifold WD,d, which is the set… view at source ↗
Figure 6
Figure 6. Figure 6: The optimal parallel protocol for complex conjugation of an unknown isometry [PITH_FULL_IMAGE:figures/full_fig_p010_6.png] view at source ↗
Figure 7
Figure 7. Figure 7: Phase diagram of the optimality of estimation-based strategies for state transposition, isometry complex conjugation, and unitary complex conjugation. [PITH_FULL_IMAGE:figures/full_fig_p018_7.png] view at source ↗
Figure 8
Figure 8. Figure 8: We compare the optimal infidelity of isometry complex conjugation (blue circles) and the isometry estimation (red triangles) for the case of [PITH_FULL_IMAGE:figures/full_fig_p019_8.png] view at source ↗

discussion (0)

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

Reference graph

Works this paper leans on

69 extracted references · 20 canonical work pages

  1. [1]

    Revisiting dequantization and quantum advantage in learning tasks,

    J. Cotler, H.-Y . Huang, and J. R. McClean, “Revisiting dequantization and quantum advantage in learning tasks,” 2021. [Online]. Available: https://arxiv.org/abs/2112.00811

    Pith/arXiv arXiv 2021

  2. [2]

    Quantum advantage in learning from experiments,

    H.-Y . Huang, M. Broughton, J. Cotler, S. Chen, J. Li, M. Mohseni, H. Neven, R. Babbush, R. Kueng, J. Preskill, and J. R. McClean, “Quantum advantage in learning from experiments,”Science, vol. 376, no. 6598, pp. 1182–1186, 2022. [Online]. Available: https://doi.org/10.1126/science.abn7293

    doi:10.1126/science.abn7293 2022

  3. [3]

    Quantum tomography using state-preparation unitaries,

    J. van Apeldoorn, A. Cornelissen, A. Gily ´en, and G. Nannicini, “Quantum tomography using state-preparation unitaries,” inProceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Society for Industrial and Applied Mathematics, 2023, pp. 1265–1318. [Online]. Available: https://doi.org/10.1137/1.9781611977554.ch47

    doi:10.1137/1.9781611977554.ch47 2023

  4. [4]

    Conjugate queries can help,

    E. Tang, J. Wright, and M. Zhandry, “Conjugate queries can help,” 2025. [Online]. Available: https://arxiv.org/abs/2510.07622

    Pith/arXiv arXiv 2025

  5. [5]

    Are controlled unitaries helpful?

    E. Tang and J. Wright, “Are controlled unitaries helpful?” 2025. [Online]. Available: https://arxiv.org/abs/2508.00055

    Pith/arXiv arXiv 2025

  6. [6]

    Amplitude amplification and estimation require inverses,

    ——, “Amplitude amplification and estimation require inverses,” 2025. [Online]. Available: https://arxiv.org/abs/2507.23787 24

    Pith/arXiv arXiv 2025

  7. [7]

    Optimal manipulations with qubits: Universal-NOT gate,

    V . Bu ˇzek, M. Hillery, and R. F. Werner, “Optimal manipulations with qubits: Universal-NOT gate,”Phys. Rev. A, vol. 60, pp. R2626(R)–R2629(R), Oct 1999. [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevA.60.R2626

    work page doi:10.1103/physreva.60.r2626 1999

  8. [8]

    Optimal pure state cloning and transposition are complementary channels,

    V . Brzi ´c, D. Grinko, M. Studzi ´nski, and M. T. Quintino, “Optimal pure state cloning and transposition are complementary channels,” 2026. [Online]. Available: https://arxiv.org/abs/2603.23628

    arXiv 2026

  9. [9]

    Complex conjugation supermap of unitary quantum maps and its universal implementation protocol,

    J. Miyazaki, A. Soeda, and M. Murao, “Complex conjugation supermap of unitary quantum maps and its universal implementation protocol,”Phys. Rev. Res., vol. 1, p. 013007, Aug 2019. [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevResearch.1.013007

    work page doi:10.1103/physrevresearch.1.013007 2019

  10. [10]

    Optimal universal quantum circuits for unitary complex conjugation,

    D. Ebler, M. Horodecki, M. Marciniak, T. Młynik, M. T. Quintino, and M. Studzi ´nski, “Optimal universal quantum circuits for unitary complex conjugation,”IEEE Transactions on Information Theory, vol. 69, no. 8, pp. 5069–5082, 2023. [Online]. Available: https://doi.org/10.1109/TIT.2023.3263771

    arXiv 2023

  11. [11]

    Random stinespring superchannel: converting channel queries into dilation isometry queries,

    F. Girardi, F. A. Mele, H. Zhao, M. Fanizza, and L. Lami, “Random stinespring superchannel: converting channel queries into dilation isometry queries,” 2025. [Online]. Available: https://arxiv.org/abs/2512.20599

    Pith/arXiv arXiv 2025

  12. [12]

    Random dilation superchannel,

    S. Yoshida, R. Niwa, T. Utsumi, R. Takagi, and M. Murao, “Random dilation superchannel,” 2025. [Online]. Available: https://arxiv.org/abs/2512.21260

    Pith/arXiv arXiv 2025

  13. [13]

    Transforming quantum operations: Quantum supermaps,

    G. Chiribella, G. M. D’Ariano, and P. Perinotti, “Transforming quantum operations: Quantum supermaps,”Europhys. Lett., vol. 83, no. 3, p. 30004,

  14. [14]

    Higher-order quantum operations,

    P. Taranto, S. Milz, M. Murao, M. T. Quintino, and K. Modi, “Higher-order quantum operations,” 2025. [Online]. Available: https: //arxiv.org/abs/2503.09693

    Pith/arXiv arXiv 2025

  15. [15]

    Quantum circuits architecture,

    G. Chiribella, G. M. D’Ariano, and P. Perinotti, “Quantum circuits architecture,”Physical Review Letters, vol. 101, no. 6, p. 060401, 2008. [Online]. Available: https://doi.org/10.1103/PhysRevLett.101.060401

    doi:10.1103/physrevlett.101.060401 2008

  16. [16]

    Quantum channels with memory,

    D. Kretschmann and R. F. Werner, “Quantum channels with memory,”Physical Review A, vol. 72, no. 6, p. 062323, 2005. [Online]. Available: https://doi.org/10.1103/PhysRevA.72.062323

    doi:10.1103/physreva.72.062323 2005

  17. [17]

    Toward a general theory of quantum games,

    G. Gutoski and J. Watrous, “Toward a general theory of quantum games,” inProceedings of the Thirty-Ninth Annual ACM Symposium on Theory of Computing. ACM, 2007, pp. 565–574. [Online]. Available: https://doi.org/10.1145/1250790.1250873

    arXiv 2007

  18. [18]

    Quantum correlations with no causal order,

    O. Oreshkov, F. Costa, and ˇC. Brukner, “Quantum correlations with no causal order,”Nature Communications, vol. 3, p. 1092, 2012. [Online]. Available: https://doi.org/10.1038/ncomms2076

    doi:10.1038/ncomms2076 2012

  19. [19]

    Quantum markov order,

    P. Taranto, F. A. Pollock, S. Milz, M. Tomamichel, and K. Modi, “Quantum markov order,”Physical Review Letters, vol. 122, no. 14, p. 140401,

  20. [20]

    Quantum algorithmic measurement,

    D. Aharonov, J. Cotler, and X.-L. Qi, “Quantum algorithmic measurement,”Nature Communications, vol. 13, p. 887, 2022. [Online]. Available: https://doi.org/10.1038/s41467-021-27922-0

    doi:10.1038/s41467-021-27922-0 2022

  21. [21]

    Optimal quantum networks and one-shot entropies,

    G. Chiribella and D. Ebler, “Optimal quantum networks and one-shot entropies,”New Journal of Physics, vol. 18, no. 9, p. 093053, 2016. [Online]. Available: https://doi.org/10.1088/1367-2630/18/9/093053

    work page doi:10.1088/1367-2630/18/9/093053 2016

  22. [22]

    Universal refocusing of systematic quantum noise,

    I. S. B. Sardharwalla, T. S. Cubitt, A. W. Harrow, and N. Linden, “Universal refocusing of systematic quantum noise,” 2016. [Online]. Available: https://arxiv.org/abs/1602.07963

    Pith/arXiv arXiv 2016

  23. [23]

    Spin echoes,

    E. L. Hahn, “Spin echoes,”Physical Review, vol. 80, no. 4, pp. 580–594, 1950. [Online]. Available: https://doi.org/10.1103/PhysRev.80.580

    doi:10.1103/physrev.80.580 1950

  24. [24]

    Freeman,Spin Choreography: Basic Steps in High Resolution NMR

    R. Freeman,Spin Choreography: Basic Steps in High Resolution NMR. Oxford, England: Oxford University Press, 1998. [Online]. Available: https://doi.org/10.1093/oso/9780198504818.001.0001

    arXiv 1998

  25. [25]

    Optimal probabilistic storage and retrieval of unitary channels,

    M. Sedl ´ak, A. Bisio, and M. Ziman, “Optimal probabilistic storage and retrieval of unitary channels,”Physical Review Letters, vol. 122, no. 17, p. 170502, 2019. [Online]. Available: https://doi.org/10.1103/PhysRevLett.122.170502

    work page doi:10.1103/physrevlett.122.170502 2019

  26. [26]

    Probabilistic exact universal quantum circuits for transforming unitary operations,

    M. T. Quintino, Q. Dong, A. Shimbo, A. Soeda, and M. Murao, “Probabilistic exact universal quantum circuits for transforming unitary operations,” Physical Review A, vol. 100, no. 6, p. 062339, 2019. [Online]. Available: https://doi.org/10.1103/PhysRevA.100.062339

    work page doi:10.1103/physreva.100.062339 2019

  27. [27]

    Reversing unknown quantum transformations: Universal quantum circuit for inverting general unitary operations,

    ——, “Reversing unknown quantum transformations: Universal quantum circuit for inverting general unitary operations,”Physical Review Letters, vol. 123, no. 21, p. 210502, 2019. [Online]. Available: https://doi.org/10.1103/PhysRevLett.123.210502

    work page doi:10.1103/physrevlett.123.210502 2019

  28. [28]

    Asymptotic teleportation scheme as a universal programmable quantum processor,

    S. Ishizaka and T. Hiroshima, “Asymptotic teleportation scheme as a universal programmable quantum processor,”Physical Review Letters, vol. 101, no. 24, p. 240501, 2008. [Online]. Available: https://doi.org/10.1103/PhysRevLett.101.240501

    doi:10.1103/physrevlett.101.240501 2008

  29. [29]

    Quantum teleportation scheme by selecting one of multiple output ports,

    ——, “Quantum teleportation scheme by selecting one of multiple output ports,”Physical Review A, vol. 79, no. 4, p. 042306, 2009. [Online]. Available: https://doi.org/10.1103/PhysRevA.79.042306

    doi:10.1103/physreva.79.042306 2009

  30. [30]

    Port-based teleportation in arbitrary dimension,

    M. Studzi ´nski, S. Strelchuk, M. Mozrzymas, and M. Horodecki, “Port-based teleportation in arbitrary dimension,”Scientific Reports, vol. 7, p. 10871,

  31. [31]

    Deterministic transformations between unitary operations: Exponential advantage with adaptive quantum circuits and the power of indefinite causality,

    M. T. Quintino and D. Ebler, “Deterministic transformations between unitary operations: Exponential advantage with adaptive quantum circuits and the power of indefinite causality,”Quantum, vol. 6, p. 679, 2022. [Online]. Available: https://doi.org/10.22331/q-2022-03-31-679

    work page doi:10.22331/q-2022-03-31-679 2022

  32. [32]

    Translating uncontrolled systems in time,

    D. Trillo, B. Dive, and M. Navascu ´es, “Translating uncontrolled systems in time,”Quantum, vol. 4, p. 374, 2020. [Online]. Available: https://doi.org/10.22331/q-2020-12-15-374

    work page doi:10.22331/q-2020-12-15-374 2020

  33. [33]

    Universal quantum rewinding protocol with an arbitrarily high probability of success,

    ——, “Universal quantum rewinding protocol with an arbitrarily high probability of success,”Physical Review Letters, vol. 130, no. 11, p. 110201,

  34. [34]

    Reversing unknown qubit-unitary operation, deterministically and exactly,

    S. Yoshida, A. Soeda, and M. Murao, “Reversing unknown qubit-unitary operation, deterministically and exactly,”Physical Review Letters, vol. 131, no. 12, p. 120602, 2023. [Online]. Available: https://doi.org/10.1103/PhysRevLett.131.120602

    work page doi:10.1103/physrevlett.131.120602 2023

  35. [36]

    Analytical lower bound on query complexity for transformations of unknown unitary operations,

    T. Odake, S. Yoshida, and M. Murao, “Analytical lower bound on query complexity for transformations of unknown unitary operations,”Physical Review Letters, vol. 135, no. 23, p. 230603, 2025. [Online]. Available: https://doi.org/10.1103/drp2-rzzw

    work page doi:10.1103/drp2-rzzw 2025

  36. [37]

    Approximation does not help in quantum unitary time-reversal,

    K. Chen, N. Yu, and Z. Zhang, “Approximation does not help in quantum unitary time-reversal,” inProceedings of the 58th Annual ACM Symposium on Theory of Computing. ACM, 2026, pp. 1376–1387. [Online]. Available: https://doi.org/10.1145/3798129.3800847

    arXiv 2026

  37. [38]

    Universal construction of decoders from encoding black boxes,

    S. Yoshida, A. Soeda, and M. Murao, “Universal construction of decoders from encoding black boxes,”Quantum, vol. 7, p. 957, 2023. [Online]. Available: https://doi.org/10.22331/q-2023-03-20-957

    work page doi:10.22331/q-2023-03-20-957 2023

  38. [39]

    Universal adjointation of isometry operations using conversion of quantum supermaps,

    ——, “Universal adjointation of isometry operations using conversion of quantum supermaps,”Quantum, vol. 9, p. 1750, 2025. [Online]. Available: https://doi.org/10.22331/q-2025-05-20-1750

    work page doi:10.22331/q-2025-05-20-1750 2025

  39. [40]

    Certifying quantumness: Benchmarks for the optimal processing of generalized coherent and squeezed states,

    Y . Yang, G. Chiribella, and G. Adesso, “Certifying quantumness: Benchmarks for the optimal processing of generalized coherent and squeezed states,” Phys. Rev. A, vol. 90, p. 042319, Oct 2014. [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevA.90.042319

    work page doi:10.1103/physreva.90.042319 2014

  40. [41]

    Towards quantum gravity: a framework for probabilistic theories with non-fixed causal structure,

    L. Hardy, “Towards quantum gravity: a framework for probabilistic theories with non-fixed causal structure,”Journal of Physics A: Mathematical and Theoretical, vol. 40, no. 12, pp. 3081–3099, 2007. [Online]. Available: https://doi.org/10.1088/1751-8113/40/12/S12

    work page doi:10.1088/1751-8113/40/12/s12 2007

  41. [42]

    Quantum computations without definite causal structure,

    G. Chiribella, G. M. D’Ariano, P. Perinotti, and B. Valiron, “Quantum computations without definite causal structure,”Phys. Rev. A, vol. 88, p. 022318, Aug 2013. [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevA.88.022318

    doi:10.1103/physreva.88.022318 2013

  42. [43]

    Applications of coherent classical communication and the schur transform to quantum information theory,

    A. W. Harrow, “Applications of coherent classical communication and the schur transform to quantum information theory,” Ph.D. dissertation, Massachusetts Institute of Technology, Cambridge, MA, USA, 2005. [Online]. Available: https://arxiv.org/abs/quant-ph/0512255

    Pith/arXiv arXiv 2005

  43. [44]

    Efficient quantum circuits for schur and clebsch-gordan transforms,

    D. Bacon, I. L. Chuang, and A. W. Harrow, “Efficient quantum circuits for schur and clebsch-gordan transforms,”Physical Review Letters, vol. 97, no. 17, p. 170502, 2006. [Online]. Available: https://doi.org/10.1103/PhysRevLett.97.170502

    doi:10.1103/physrevlett.97.170502 2006

  44. [45]

    The quantum Schur and Clebsch-Gordan transforms: I. efficient qudit circuits,

    ——, “The quantum Schur and Clebsch-Gordan transforms: I. efficient qudit circuits,” inProceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms, 2007, pp. 1235–1244. [Online]. Available: https://dl.acm.org/doi/10.5555/1283383.1283516 25

    arXiv 2007

  45. [46]

    An efficient high dimensional quantum schur transform,

    H. Krovi, “An efficient high dimensional quantum schur transform,”Quantum, vol. 3, p. 122, 2019. [Online]. Available: https: //doi.org/10.22331/q-2019-02-14-122

    doi:10.22331/q-2019-02-14-122 2019

  46. [47]

    High-dimensional quantum schur transforms,

    A. Burchardt, J. Fei, D. Grinko, M. Larocca, M. Ozols, S. Timmerman, and V . Visnevskyi, “High-dimensional quantum schur transforms,”arXiv preprint arXiv:2509.22640, 2025. [Online]. Available: https://arxiv.org/abs/2509.22640

    arXiv 2025

  47. [48]

    The mixed schur transform: efficient quantum circuit and applications,

    Q. T. Nguyen, “The mixed schur transform: efficient quantum circuit and applications,” 2023. [Online]. Available: https://arxiv.org/abs/2310.01613

    Pith/arXiv arXiv 2023

  48. [49]

    Gelfand-tsetlin basis for partially transposed permutations, with applications to quantum information,

    D. Grinko, A. Burchardt, and M. Ozols, “Gelfand-tsetlin basis for partially transposed permutations, with applications to quantum information,” 2023. [Online]. Available: https://arxiv.org/abs/2310.02252

    Pith/arXiv arXiv 2023

  49. [50]

    Efficient quantum algorithm for port-based teleportation,

    J. Fei, S. Timmerman, and P. Hayden, “Efficient quantum algorithm for port-based teleportation,”arXiv preprint, 2023. [Online]. Available: https://arxiv.org/abs/2310.01637

    Pith/arXiv arXiv 2023

  50. [51]

    Mixed schur-weyl duality in quantum information,

    D. Grinko, “Mixed schur-weyl duality in quantum information,” Ph.D. dissertation, Universiteit van Amsterdam, 2025. [Online]. Available: https://hdl.handle.net/11245.1/d9e16c26-ef20-40c5-b847-53c13d1a8a1a

    2025

  51. [52]

    Quantum Advantage in Storage and Retrieval of Isometry Channels,

    S. Yoshida, J. Miyazaki, and M. Murao, “Quantum Advantage in Storage and Retrieval of Isometry Channels,”Phys. Rev. Lett., vol. 136, p. 190601, May 2026. [Online]. Available: https://link.aps.org/doi/10.1103/fdvq-9m8m

    work page doi:10.1103/fdvq-9m8m 2026

  52. [53]

    Klimyk and N

    A. Klimyk and N. Y . Vilenkin,Representations of Lie Groups and Special Functions: Recent Advances. Springer, 1995. [Online]. Available: https://doi.org/10.1007/978-94-017-2885-0

    work page doi:10.1007/978-94-017-2885-0 1995

  53. [54]

    Fulton and J

    W. Fulton and J. Harris,Representation Theory: A First Course, ser. Graduate Texts in Mathematics. New York: Springer, 2013, vol. 129. [Online]. Available: https://doi.org/10.1007/978-1-4612-0979-9

    doi:10.1007/978-1-4612-0979-9 2013

  54. [55]

    Ceccherini-Silberstein, F

    T. Ceccherini-Silberstein, F. Scarabotti, and F. Tolli,Representation Theory of the Symmetric Groups: The Okounkov-Vershik Approach, Character Formulas, and Partition Algebras. Cambridge University Press, 2010, vol. 121. [Online]. Available: https://doi.org/10.1017/CBO9781139192361

    doi:10.1017/cbo9781139192361 2010

  55. [56]

    Efficient multi port-based teleportation schemes,

    M. Studzi ´nski, M. Mozrzymas, P. Kopszak, and M. Horodecki, “Efficient multi port-based teleportation schemes,”IEEE Transactions on Information Theory, vol. 68, no. 12, pp. 7892–7912, 2022. [Online]. Available: https://doi.org/10.1109/TIT.2022.3187852

    arXiv 2022

  56. [57]

    I. M. James,The topology of Stiefel manifolds. Cambridge University Press, 1976, vol. 24. [Online]. Available: https://doi.org/10.1017/ CBO9780511600753

    1976

  57. [58]

    Causal and causally separable processes,

    O. Oreshkov and C. Giarmatzi, “Causal and causally separable processes,”New Journal of Physics, vol. 18, no. 9, p. 093020, 2016. [Online]. Available: https://doi.org/10.1088/1367-2630/18/9/093020

    doi:10.1088/1367-2630/18/9/093020 2016

  58. [59]

    Strict hierarchy between parallel, sequential, and indefinite-causal-order strategies for channel discrimination,

    J. Bavaresco, M. Murao, and M. T. Quintino, “Strict hierarchy between parallel, sequential, and indefinite-causal-order strategies for channel discrimination,”Phys. Rev. Lett., vol. 127, no. 20, p. 200504, 2021. [Online]. Available: https://doi.org/10.1103/PhysRevLett.127.200504

    work page doi:10.1103/physrevlett.127.200504 2021

  59. [60]

    Accurate eigenvalues of a symmetric tri-diagonal matrix,

    W. Kahan, “Accurate eigenvalues of a symmetric tri-diagonal matrix,” Stanford University, Tech. Rep. CS-TR-66-41, 1966. [Online]. Available: http://i.stanford.edu/TR/CS-TR-66-41.html

    1966

  60. [61]

    https://github.com/sy3104/isometry complex conjugation estimation

  61. [62]

    https://opensource.org/licenses/MIT

  62. [63]

    Cloning Quantum Channels,

    P. Sekatski, Y . Guryanova, N. B. T. Kothakonda, and M. Skotiniotis, “Cloning Quantum Channels,” 2025. [Online]. Available: https: //arxiv.org/abs/2509.08059

    Pith/arXiv arXiv 2025

  63. [64]

    Optimal Cloning of Unitary Transformation,

    G. Chiribella, G. M. D’Ariano, and P. Perinotti, “Optimal Cloning of Unitary Transformation,”Phys. Rev. Lett., vol. 101, p. 180504, Oct 2008. [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevLett.101.180504

    doi:10.1103/physrevlett.101.180504 2008

  64. [65]

    Adhikari, M

    R. Adhikari, M. T. Quintino, and M. Studzi ´nski, in preparation

  65. [2008]

    Available: https://doi.org/10.1209/0295-5075/83/30004

    [Online]. Available: https://doi.org/10.1209/0295-5075/83/30004

    doi:10.1209/0295-5075/83/30004

  66. [2017]

    Available: https://doi.org/10.1038/s41598-017-10051-4

    [Online]. Available: https://doi.org/10.1038/s41598-017-10051-4

    work page doi:10.1038/s41598-017-10051-4

  67. [2019]

    Available: https://doi.org/10.1103/PhysRevLett.122.140401

    [Online]. Available: https://doi.org/10.1103/PhysRevLett.122.140401

    work page doi:10.1103/physrevlett.122.140401

  68. [2023]

    Available: https://doi.org/10.1103/PhysRevLett.130.110201

    [Online]. Available: https://doi.org/10.1103/PhysRevLett.130.110201

    work page doi:10.1103/physrevlett.130.110201

  69. [2024]

    Available: https://arxiv.org/abs/2403.04704

    [Online]. Available: https://arxiv.org/abs/2403.04704

    arXiv