Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2604.27087

Oscillators from non-semisimple walled Brauer algebras

Sanjaye Ramgoolam, Michał Studziński

hep-thmath.RTquant-phSubmitted Apr 29, 2026• Announced May 1, 2026
arXivHTMLPDF

Abstract

The walled Brauer algebras $B_N(m,n)$ govern Schur--Weyl duality for unitary groups $U(N)$ acting on mixed tensor spaces $V_N^{\otimes m}\otimes \overline{V}_N^{\otimes n}$ and play an important role in applications ranging from AdS/CFT to quantum information theory. In the stable regime $N\ge m+n$ the algebra is semisimple and its representation theory is well understood. For $N<m+n$, however, $B_N(m,n)$ becomes non-semisimple. The representation of the algebra on tensor space has a non-trivial kernel and the corresponding quotient algebra is semisimple, with representation dimensions differing from those in the stable regime. We introduce \emph{restricted Bratteli diagrams}, obtained by modifying the standard Bratteli diagrams for $B_N(m,n)$. This construction provides a systematic way to use representation-theoretic data from the stable regime to compute the dimension modifications arising in the non-semisimple regime. In the regime $N=m+n-l$, with $l$ small compared to $m,n$, we show that the restricted diagrams exhibit a stability property and enable an efficient counting of the paths responsible for these dimension corrections. Remarkably, the resulting generating functions are governed by the partition function of an infinite tower of simple harmonic oscillators. We briefly discuss implications for the construction of orthogonal bases of matrix invariants in gauge theory and related applications in quantum information theory.

Comments
16 pages, 6 figures, contribution to the proceedings of the Corfu Summer Institute 2025

Related papers

Efficient Quantum Fourier Transforms For Semisimple Algebras

Ben Foxman, Barak Nehoran, Yongshan Ding

The quantum Fourier transform (QFT) is a fundamental primitive in quantum computation and quantum information. In this work, we extend the framework for the QFT from finite groups to finite-dimensional semisimple algebras, and give efficient QFTs for the partition algebra $P_n(d)$, Brauer algebra $B_n(d)$, and walled Brauer algebra $B_{r,s}(d)$. These algebras play important roles in generalized Schur-Weyl duality, statistical physics and many-body systems, and have recently found several applications in quantum algorithms. Unlike the group case, the Fourier transform over a semisimple algebra can be non-unitary. Nevertheless, we show that when the parameter $d$ is sufficiently large, the Fourier transform is well approximated by a unitary operator. Furthermore, we show that for each of the algebras $A$ from above, such an approximate Fourier transform can be implemented efficiently: we give a quantum algorithm with gate complexity $\mathrm{poly}(n,\log d,\log(1/\varepsilon))$ for approximating the Fourier transform to error $(d^{-1/2} + \varepsilon) \cdot \mathrm{poly}(|A|)$. Along the way, we establish several properties of the Fourier basis of semisimple algebras that may be of independent interest.

quant-pharXiv:2605.05337•May 8, 2026•0 citations

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

Dmitry Grinko, Adam Burchardt, Māris Ozols

We study representation theory of the partially transposed permutation matrix algebra, a matrix representation of the diagrammatic walled Brauer algebra. This algebra plays a prominent role in mixed Schur-Weyl duality that appears in various contexts in quantum information. Our main technical result is an explicit formula for the action of the walled Brauer algebra generators in the Gelfand-Tsetlin basis. It generalizes the well-known Gelfand-Tsetlin basis for the symmetric group (also known as Young's orthogonal form or Young-Yamanouchi basis). We provide two applications of our result to quantum information. First, we show how to simplify semidefinite optimization problems over unitary-equivariant quantum channels by performing a symmetry reduction. Second, we derive an efficient quantum circuit for implementing the optimal port-based quantum teleportation protocol, exponentially improving the known trivial construction. As a consequence, this also exponentially improves the known lower bound for the amount of entanglement needed to implement unitaries non-locally. Both applications require a generalization of quantum Schur transform to tensors of mixed unitary symmetry. We develop an efficient quantum circuit for this mixed quantum Schur transform and provide a matrix product state representation of its basis vectors. For constant local dimension, this yields an efficient classical algorithm for computing any entry of the mixed quantum Schur transform unitary.

arXiv:2310.02252•Oct 3, 2023•1 citation

Group-Adapted Irreducible Matrix Units for the Walled Brauer Algebra

Michał Studziński, Tomasz Młynik, Marek Mozrzymas +2 more

This paper investigates the representation theory of the algebra of partially transposed permutation operators, $\mathcal{A}^d_{p,p}$, which provides a matrix representation for the abstract walled Brauer algebra. This algebra has recently gained significant attention due to its relevance in quantum information theory, particularly in the efficient quantum circuit implementation of the mixed Schur-Weyl transform. In contrast to previous Gelfand-Tsetlin type approaches, our main technical contribution is the explicit construction of irreducible matrix units in the second-highest ideal that are group-adapted to the action of $\mathbb{C}[S_p]\times \mathbb{C}[S_p]$ subalgebra, where $S_p$ is the symmetric group. This approach suggests a recursive method for constructing irreducible matrix units in the remaining ideals of the algebra. The framework is general and applies to systems with arbitrary numbers of components and local dimensions. In addition, we present a complementary construction method based on tensor networks of Clebsch-Gordan coefficients of the unitary group. This approach enables the construction of all group-adapted irreducible matrix units, but requires knowledge of certain Littlewood-Richardson coefficients. This method can be successfully applied for a reasonably small number of particles with the support of dedicated software. The obtained results are applied to a special class of operators motivated by the mathematical formalism appearing in all variants of the port-based teleportation protocols through the mixed Schur-Weyl duality. We demonstrate that the given irreducible matrix units are, in fact, eigenoperators for the considered class.

arXiv:2501.13067•Jan 22, 2025•0 citations

Gauge-string duality, monomial bases and graph determinants

Garreth Kemp, Sanjaye Ramgoolam

Questions at the intersection of the AdS/CFT correspondence and quantum information theory motivate the study of projectors in sequences of subalgebras of finite-dimensional commutative associative semisimple algebras $\mathcal{A}$, obtained by incrementally adjoining one generator at each step to produce a non-linear generating set for $\mathcal{A}$. We define degeneracy graphs, which are finite layered tree graphs whose nodes represent projectors in the successive subalgebras. Using combinatorial properties of the degeneracy graph, we give a simple formula for constructing a linear basis of $\mathcal{A}$ in terms of monomials in the generators. The nodes can be labelled by formal variables corresponding to the eigenvalues of the generators added at each layer. We prove that the construction is compatible with the required counting of projectors in $\mathcal{A}$, and give explicit constructions of the projectors in terms of the monomials, in the cases of one- and two-layer degeneracy graphs with arbitrary numbers of nodes. More generally, we provide extensive computational evidence for the invertibility of the matrix relating the proposed monomial basis to the projector basis, by evaluating its determinant. In the 1-layer case, this is a Vandermonde determinant. A simple formula for the non-vanishing determinant in the general layer case is conjectured and supported by the computational data. The construction is illustrated with examples including centres of symmetric group algebras and maximally commuting subalgebras generated by JucysMurphy elements. We outline applications of the monomial basis to algorithms for constructing matrix units in non-commutative semisimple algebras, with relevance to orthogonal bases of multi-matrix gauge-invariant operators and to quantum information theory.

hep-thCross-listedarXiv:2603.05259•Mar 6, 2026

The mixed Schur transform: efficient quantum circuit and applications

Nguyen, Quynh T.

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.

arXiv:2310.01613•Oct 2, 2023•0 citations

Quantum cellular automata and invertible phases of matter

Corey Jones, Nikita Sopenko, Ryan Thorngren

We introduce and study (fermionic and bosonic) invertible quasi-local algebras over uniformly locally finite metric spaces $X$ with infinite-dimensional local von Neumann algebras. We show that the group of Brauer equivalence classes of such algebras is isomorphic to both the group of phases of invertible states and the group of stable equivalence classes of quantum cellular automata over $X\times \mathbb{Z}$. Using K-theory of the symmetric monoidal category of invertible quasi-local algebras and bounded spread isomorphisms, we propose a definition of an $Ω$-spectrum of invertible phases as conjectured by Kitaev. We then show that the $c=\frac{1}{2}$ chiral Majorana fermion net and the $(E_{8})_{1}$ conformal net provide Brauer non-trivial invertible quasi-local algebras, thus providing explicit constructions of non-trivial invertible states and quantum cellular automata on $\mathbb{Z}^{2}$. In addition, we show that the time-slice nets of rational diagonal conformal field theories admit lattice degrees of freedom, which implies the discretization of any holomorphic conformal net is invertible.

math-phCross-listedarXiv:2608.26456•Aug 28, 2026•0 citations
The walled Brauer algebras BN(m,n)B_N(m,n)BN​(m,n) govern Schur--Weyl duality for unitary groups U(N)U(N)U(N) acting on mixed tensor spaces VN⊗m⊗V‾N⊗nV_N^{\otimes m}\otimes \overline{V}_N^{\otimes n}VN⊗m​⊗VN⊗n​ and play an important role in applications ranging from AdS/CFT to quantum information theory. In the stable regime N≥m+nN\ge m+nN≥m+n the algebra is semisimple and its representation theory is well understood. For N<m+nN<m+nN<m+n, however, BN(m,n)B_N(m,n)BN​(m,n) becomes non-semisimple. The representation of the algebra on tensor space has a non-trivial kernel and the corresponding quotient algebra is semisimple, with representation dimensions differing from those in the stable regime.
We introduce \emph{restricted Bratteli diagrams}, obtained by modifying the standard Bratteli diagrams for BN(m,n)B_N(m,n)BN​(m,n). This construction provides a systematic way to use representation-theoretic data from the stable regime to compute the dimension modifications arising in the non-semisimple regime. In the regime N=m+n−lN=m+n-lN=m+n−l, with lll small compared to m,nm,nm,n, we show that the restricted diagrams exhibit a stability property and enable an efficient counting of the paths responsible for these dimension corrections.
Remarkably, the resulting generating functions are governed by the partition function of an infinite tower of simple harmonic oscillators. We briefly discuss implications for the construction of orthogonal bases of matrix invariants in gauge theory and related applications in quantum information theory.
The quantum Fourier transform (QFT) is a fundamental primitive in quantum computation and quantum information. In this work, we extend the framework for the QFT from finite groups to finite-dimensional semisimple algebras, and give efficient QFTs for the partition algebra Pn(d)P_n(d)Pn​(d), Brauer algebra Bn(d)B_n(d)Bn​(d), and walled Brauer algebra Br,s(d)B_{r,s}(d)Br,s​(d). These algebras play important roles in generalized Schur-Weyl duality, statistical physics and many-body systems, and have recently found several applications in quantum algorithms. Unlike the group case, the Fourier transform over a semisimple algebra can be non-unitary. Nevertheless, we show that when the parameter ddd is sufficiently large, the Fourier transform is well approximated by a unitary operator. Furthermore, we show that for each of the algebras AAA from above, such an approximate Fourier transform can be implemented efficiently: we give a quantum algorithm with gate complexity poly(n,log⁡d,log⁡(1/ε))\mathrm{poly}(n,\log d,\log(1/\varepsilon))poly(n,logd,log(1/ε)) for approximating the Fourier transform to error (d−1/2+ε)⋅poly(∣A∣)(d^{-1/2} + \varepsilon) \cdot \mathrm{poly}(|A|)(d−1/2+ε)⋅poly(∣A∣). Along the way, we establish several properties of the Fourier basis of semisimple algebras that may be of independent interest.
We study representation theory of the partially transposed permutation matrix algebra, a matrix representation of the diagrammatic walled Brauer algebra. This algebra plays a prominent role in mixed Schur-Weyl duality that appears in various contexts in quantum information. Our main technical result is an explicit formula for the action of the walled Brauer algebra generators in the Gelfand-Tsetlin basis. It generalizes the well-known Gelfand-Tsetlin basis for the symmetric group (also known as Young's orthogonal form or Young-Yamanouchi basis). We provide two applications of our result to quantum information. First, we show how to simplify semidefinite optimization problems over unitary-equivariant quantum channels by performing a symmetry reduction. Second, we derive an efficient quantum circuit for implementing the optimal port-based quantum teleportation protocol, exponentially improving the known trivial construction. As a consequence, this also exponentially improves the known lower bound for the amount of entanglement needed to implement unitaries non-locally. Both applications require a generalization of quantum Schur transform to tensors of mixed unitary symmetry. We develop an efficient quantum circuit for this mixed quantum Schur transform and provide a matrix product state representation of its basis vectors. For constant local dimension, this yields an efficient classical algorithm for computing any entry of the mixed quantum Schur transform unitary.
This paper investigates the representation theory of the algebra of partially transposed permutation operators, Ap,pd\mathcal{A}^d_{p,p}Ap,pd​, which provides a matrix representation for the abstract walled Brauer algebra. This algebra has recently gained significant attention due to its relevance in quantum information theory, particularly in the efficient quantum circuit implementation of the mixed Schur-Weyl transform. In contrast to previous Gelfand-Tsetlin type approaches, our main technical contribution is the explicit construction of irreducible matrix units in the second-highest ideal that are group-adapted to the action of C[Sp]×C[Sp]\mathbb{C}[S_p]\times \mathbb{C}[S_p]C[Sp​]×C[Sp​] subalgebra, where SpS_pSp​ is the symmetric group. This approach suggests a recursive method for constructing irreducible matrix units in the remaining ideals of the algebra. The framework is general and applies to systems with arbitrary numbers of components and local dimensions. In addition, we present a complementary construction method based on tensor networks of Clebsch-Gordan coefficients of the unitary group. This approach enables the construction of all group-adapted irreducible matrix units, but requires knowledge of certain Littlewood-Richardson coefficients. This method can be successfully applied for a reasonably small number of particles with the support of dedicated software. The obtained results are applied to a special class of operators motivated by the mathematical formalism appearing in all variants of the port-based teleportation protocols through the mixed Schur-Weyl duality. We demonstrate that the given irreducible matrix units are, in fact, eigenoperators for the considered class.
Questions at the intersection of the AdS/CFT correspondence and quantum information theory motivate the study of projectors in sequences of subalgebras of finite-dimensional commutative associative semisimple algebras A\mathcal{A}A, obtained by incrementally adjoining one generator at each step to produce a non-linear generating set for A\mathcal{A}A. We define degeneracy graphs, which are finite layered tree graphs whose nodes represent projectors in the successive subalgebras. Using combinatorial properties of the degeneracy graph, we give a simple formula for constructing a linear basis of A\mathcal{A}A in terms of monomials in the generators. The nodes can be labelled by formal variables corresponding to the eigenvalues of the generators added at each layer. We prove that the construction is compatible with the required counting of projectors in A\mathcal{A}A, and give explicit constructions of the projectors in terms of the monomials, in the cases of one- and two-layer degeneracy graphs with arbitrary numbers of nodes. More generally, we provide extensive computational evidence for the invertibility of the matrix relating the proposed monomial basis to the projector basis, by evaluating its determinant. In the 1-layer case, this is a Vandermonde determinant. A simple formula for the non-vanishing determinant in the general layer case is conjectured and supported by the computational data. The construction is illustrated with examples including centres of symmetric group algebras and maximally commuting subalgebras generated by JucysMurphy elements. We outline applications of the monomial basis to algorithms for constructing matrix units in non-commutative semisimple algebras, with relevance to orthogonal bases of multi-matrix gauge-invariant operators and to quantum information theory.
The Schur transform, which block-diagonalizes the tensor representation U⊗nU^{\otimes n}U⊗n of the unitary group Ud\mathbf{U}_dUd​ on nnn 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⊗n⊗Uˉ⊗mU^{\otimes n} \otimes \bar{U}^{\otimes m}U⊗n⊗Uˉ⊗m, where Uˉ\bar{U}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 Uˉ\bar{U}Uˉ. The overall circuit has complexity O~((n+m)d4)\widetilde{O} ((n+m)d^4)O((n+m)d4). 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.
We introduce and study (fermionic and bosonic) invertible quasi-local algebras over uniformly locally finite metric spaces XXX with infinite-dimensional local von Neumann algebras. We show that the group of Brauer equivalence classes of such algebras is isomorphic to both the group of phases of invertible states and the group of stable equivalence classes of quantum cellular automata over X×ZX\times \mathbb{Z}X×Z. Using K-theory of the symmetric monoidal category of invertible quasi-local algebras and bounded spread isomorphisms, we propose a definition of an ΩΩΩ-spectrum of invertible phases as conjectured by Kitaev. We then show that the c=12c=\frac{1}{2}c=21​ chiral Majorana fermion net and the (E8)1(E_{8})_{1}(E8​)1​ conformal net provide Brauer non-trivial invertible quasi-local algebras, thus providing explicit constructions of non-trivial invertible states and quantum cellular automata on Z2\mathbb{Z}^{2}Z2. In addition, we show that the time-slice nets of rational diagonal conformal field theories admit lattice degrees of freedom, which implies the discretization of any holomorphic conformal net is invertible.