Pith. sign in

REVIEW 4 cited by

The mixed Schur transform: efficient quantum circuit and applications

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2310.01613 v1 pith:JDDYZSJ7 submitted 2023-10-02 quant-ph math.COmath.RT

classification quant-phmath.COmath.RT
keywords transformmixedquantumschurotimesrepresentationapplicationscircuit
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

The Schur transform, which block-diagonalizes the tensor representation $U^{\otimes n}$ of the unitary group $\mathbf{U}_d$ on $n$ qudits, is an important primitive in quantum information and theoretical physics. We give a generalization of its quantum circuit implementation due to Bacon, Chuang, and Harrow (SODA 2007) to the case of mixed tensor $U^{\otimes n} \otimes \bar{U}^{\otimes m}$, where $\bar{U}$ is the dual representation. This representation is the symmetry of unitary-equivariant channels, which find various applications in quantum majority vote, multiport-based teleportation, asymmetric state cloning, black-box unitary transformations, etc. The "mixed" Schur transform contains several natural extensions of the representation theory used in the Schur transform, in which the main ingredient is a duality between the mixed tensor representations and the walled Brauer algebra. Another element is an efficient implementation of a "dual" Clebsch-Gordan transform for $\bar{U}$. The overall circuit has complexity $\widetilde{O} ((n+m)d^4)$. Finally, we show how the mixed Schur transform enables efficient implementation of unitary-equivariant channels in various settings and discuss other potential applications, including an extension of permutational quantum computing that includes partial transposes.

Discussion (0). Sign in to comment.

Forward citations

Cited by 4 Pith papers

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

  1. Optimal complex conjugation of unknown isometry channels

    quant-ph 2026-07 accept novelty 7.0 of 10

    The optimal n-use fidelity for complex conjugating an unknown isometry C^d→C^D is derived in closed form, with parallel protocols proven optimal among all general quantum superchannels.

  2. Sequential quantum processes with group symmetries

    quant-ph 2025-10 conditional novelty 7.0 of 10

    A canonical streaming circuit decomposition for (G×H)-invariant quantum combs is derived, and numerical optimization suggests a deterministic 7-query transposition protocol for qutrits that is reported as exact.

  3. Quantum Simulation of Random Unitaries from Clebsch-Gordan Transforms

    quant-ph 2025-09 accept novelty 7.0 of 10

    Clebsch-Gordan transforms give exact compressed oracles for Haar-random unitary group actions, with efficient circuits for U(d).

  4. Another generalization of Hadamard test: Optimal sample complexities for learning functions on the unitary group

    quant-ph 2025-09 conditional novelty 6.0 of 10

    The query complexity of estimating a function of an unknown unitary under average bias is Θ(Rep_ε(f)), where Rep_ε(f) measures the L2 tail of the function beyond degree 2m polynomials.

Pith tools