The mixed Schur transform: efficient quantum circuit and applications
read the original 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.
This paper has not been read by Pith yet.
Forward citations
Cited by 6 Pith papers
-
Quantum Time Lower Bounds by Permutation Invariance
A reduction framework from sample complexity yields matching time lower bounds for purity estimation, high-order functionals, productness testing, and related quantum protocols.
-
Sample Optimal and Memory Efficient Quantum State Tomography
A sample-optimal quantum state tomography algorithm that is memory-efficient by using unitary Schur sampling with streaming access to samples.
-
Quantum Lazy Sampling and Path Recording for Any Group
A general-purpose path-recording oracle is defined that perfectly simulates random elements of any closed subgroup of U(N) by storing t input-output pairs whose updates are governed by the commutant of the group's ten...
-
Oscillators from non-semisimple walled Brauer algebras
Dimension corrections in non-semisimple walled Brauer algebras are counted via restricted Bratteli diagrams whose generating functions match the partition function of an infinite tower of simple harmonic oscillators.
-
Random dilation superchannel
Presents a poly-complexity quantum circuit implementing the random dilation superchannel for parallel channel queries, with approximate sequential extension, a no-go theorem for exact sequential dilation, and an appli...
-
A resource theory of asynchronous quantum information processing
Introduces resource theories for asynchronous port-based teleportation with free classical and quantum pre-processing, computes tight fidelity bounds for isotropic, graph, and symmetrized EPR states, and proves the st...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.