arxiv: 2605.05337 · v1 · submitted 2026-05-06 · 🪐 quant-ph

Recognition: unknown

Efficient Quantum Fourier Transforms For Semisimple Algebras

Ben Foxman , Barak Nehoran , Yongshan Ding

Authors on Pith no claims yet

Pith reviewed 2026-05-08 16:45 UTC · model grok-4.3

classification 🪐 quant-ph

keywords quantum Fourier transformsemisimple algebraspartition algebraBrauer algebrawalled Brauer algebraquantum algorithmsapproximate unitariesSchur-Weyl duality

0 comments

The pith

Quantum algorithms can efficiently approximate the Fourier transform over semisimple algebras like the partition and Brauer algebras by a unitary when d is large.

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

The paper generalizes the quantum Fourier transform from finite groups to finite-dimensional semisimple algebras and constructs explicit efficient quantum algorithms for the partition algebra, Brauer algebra, and walled Brauer algebra. It proves that for large enough d the transform, which may otherwise be non-unitary, lies close to a unitary operator. The resulting circuits use a number of gates polynomial in n, log d, and log(1/ε) while keeping the approximation error at most (d^{-1/2} + ε) times a polynomial in the algebra dimension. A reader would care because these algebras arise in models of many-body physics and generalized Schur-Weyl duality, so the new primitive opens the door to quantum algorithms that manipulate their representation theory directly.

Core claim

We generalize the quantum Fourier transform to finite-dimensional semisimple algebras and give quantum algorithms that approximate the Fourier transform over the partition algebra P_n(d), the Brauer algebra B_n(d), and the walled Brauer algebra B_{r,s}(d). When d is sufficiently large the transform is close to unitary, and each of these algebras admits an efficient circuit implementation with gate complexity poly(n, log d, log(1/ε)) that achieves error (d^{-1/2} + ε) poly(|A|). Several structural properties of the Fourier basis are established along the way.

What carries the argument

The approximate unitary Fourier transform over a semisimple algebra, realized by explicit quantum circuits whose complexity is polynomial in the rank n and log d.

If this is right

Quantum algorithms that rely on representation theory or Schur-Weyl duality can now invoke an efficient Fourier transform step over these algebras.
Simulations of statistical-mechanical models whose Hamiltonians are expressed in Brauer or partition algebra bases become feasible on quantum hardware.
The same circuit techniques may be reused whenever a new semisimple algebra satisfies the large-d unitary approximation condition.
Properties of the Fourier basis derived in the paper can be used to design further quantum primitives such as convolution or sampling algorithms over these algebras.

Where Pith is reading between the lines

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

The approximation strategy may extend to other families of semisimple algebras that appear in quantum information but are not treated here.
When d is too small for the unitary approximation to hold, one could explore quantum dilation or embedding techniques to implement the exact non-unitary map.
Classical precomputation of the circuit descriptions for fixed small n could be combined with the quantum part to yield hybrid algorithms for algebraic problems.

Load-bearing premise

When the parameter d is sufficiently large, the Fourier transform over the semisimple algebra is well approximated by a unitary operator.

What would settle it

For a concrete small-n instance of the partition algebra with large d, compute the exact Fourier matrix, measure its distance to the nearest unitary matrix, and check whether that distance exceeds the claimed error bound (d^{-1/2} + ε) poly(|A|).

Figures

Figures reproduced from arXiv: 2605.05337 by Barak Nehoran, Ben Foxman, Yongshan Ding.

**Figure 1.** Figure 1: Diagram multiplication in the symmetric group algebra. view at source ↗

**Figure 2.** Figure 2: Example elements of the partition algebra view at source ↗

**Figure 3.** Figure 3: The Fourier transform block-diagonalizes the natural view at source ↗

**Figure 4.** Figure 4: Actions of the partition algebra generators on a graph view at source ↗

**Figure 5.** Figure 5: An example of multiplying two partition diagrams. view at source ↗

**Figure 6.** Figure 6: An example of a walled Brauer diagram in view at source ↗

**Figure 7.** Figure 7: Examples of the Schur representation for different partition diagrams. view at source ↗

**Figure 8.** Figure 8: The Fourier transform maps diagrams with propagating number view at source ↗

**Figure 9.** Figure 9: The Bratteli diagram of 𝐵3,2 (𝑑). The dimension of an irrep 𝜆 ∈ 𝐵3,2 (𝑑) is equivalent to the number of paths from the root (∅, ∅) ∈ 𝐵0,0 (𝑑) to the label 𝜆. Note that the sum of the squares of the dimensions is 120 = |𝐵3,2 (𝑑)|. We will sometimes refer to the subalgebra adapted basis vectors as Bratteli paths, and use the letters 𝑃, 𝑄, 𝑅, . . . to denote such paths. For a Bratteli path 𝑃, we write 𝑃(𝑖) … view at source ↗

**Figure 10.** Figure 10: A circuit for the quantum Fourier transform, following the separation of variables approach. On view at source ↗

**Figure 11.** Figure 11: The circuit implementing Algorithm 1, equivalent to the postprocessing gate in view at source ↗

read the original abstract

The quantum Fourier transform (QFT) is a fundamental primitive in quantum computation and quantum information. In this work, we generalize the QFT for finite groups to a QFT for finite-dimensional semisimple algebras, and give efficient quantum Fourier transforms 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.

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.

Desk Editor's Note private letter to a colleague

The paper generalizes the QFT to semisimple algebras with explicit efficient circuits for three cases, but the error bound forces d to be exponentially large before the approximation becomes useful.

read the letter

The main things to know are that this work extends the quantum Fourier transform from finite groups to finite-dimensional semisimple algebras and gives concrete quantum algorithms for the partition algebra, Brauer algebra, and walled Brauer algebra. These algebras appear in Schur-Weyl duality and in statistical physics models, so the extension could matter for algorithm design in those areas. They also record some properties of the Fourier basis that look independently useful. The constructions adapt standard group QFT techniques in a direct way and keep the gate count polynomial in n, log d, and log(1/ε). That part is cleanly executed and gives credit to the prior group literature without overclaiming. The soft spot sits in the error analysis. The stated bound is (d^{-1/2} + ε) times a polynomial in |A|. For these algebras |A| grows exponentially with n (Bell numbers and close relatives), so the poly(|A|) term is itself exponential in n. To drive the total error below a fixed constant you have to push d up exponentially as well to shrink the d^{-1/2} piece. The paper correctly notes that d must be sufficiently large, but this regime is far from the modest d values that usually appear in the physics applications. Adjusting ε to compensate keeps the complexity polynomial, yet the approximation guarantee only becomes nontrivial when d is already huge. No circularity or unfalsifiable steps appear in the argument, and the work engages the existing group-QFT results honestly. This is for quantum information people who want to move beyond groups into algebraic structures that show up in many-body systems. A reader interested in new primitives or in the specific algebras will find concrete material worth examining. The claims are specific and the setting is new enough that the paper deserves a full referee process rather than a desk rejection.

Referee Report

1 major / 1 minor

Summary. The paper generalizes the quantum Fourier transform from finite groups to finite-dimensional semisimple algebras. It establishes properties of the Fourier basis and gives quantum algorithms for approximating the (possibly non-unitary) Fourier transform over the partition algebra P_n(d), Brauer algebra B_n(d), and walled Brauer algebra B_{r,s}(d) to error (d^{-1/2} + ε) · poly(|A|) with gate complexity poly(n, log d, log(1/ε)), provided d is large enough that the transform is well approximated by a unitary.

Significance. If the approximation result holds with a useful (sub-constant) error bound, this would be a significant extension of the QFT primitive to algebraic structures arising in generalized Schur-Weyl duality, statistical physics, and many-body systems. The efficient implementations for these concrete algebras and the auxiliary properties of the Fourier basis could support new quantum algorithms in those domains.

major comments (1)

[Abstract] Abstract (main complexity and approximation claim): the stated error is (d^{-1/2} + ε) · poly(|A|). For P_n(d) the algebra dimension |A| equals the Bell number B(2n) ∼ exp(Θ(n log n)); the same exponential growth holds for the Brauer and walled Brauer algebras. Consequently poly(|A|) is exponential in n, so the product exceeds 1 (and grows unbounded) for any fixed d and ε once n is large. This renders the approximation guarantee vacuous and supplies no nontrivial guarantee that the output is close to the Fourier transform.

minor comments (1)

[Abstract] The abstract asserts that 'several properties of the Fourier basis of semisimple algebras' are established but does not enumerate them; a short list or forward reference to the relevant theorem would improve readability.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for the careful reading of the manuscript and for highlighting this issue with the error bound. We address the comment point by point below.

read point-by-point responses

Referee: [Abstract] Abstract (main complexity and approximation claim): the stated error is (d^{-1/2} + ε) · poly(|A|). For P_n(d) the algebra dimension |A| equals the Bell number B(2n) ∼ exp(Θ(n log n)); the same exponential growth holds for the Brauer and walled Brauer algebras. Consequently poly(|A|) is exponential in n, so the product exceeds 1 (and grows unbounded) for any fixed d and ε once n is large. This renders the approximation guarantee vacuous and supplies no nontrivial guarantee that the output is close to the Fourier transform.

Authors: We agree that the referee's observation is correct: as written, the factor of poly(|A|) renders the stated error bound greater than 1 for sufficiently large n and therefore vacuous as a guarantee of closeness in operator norm. The poly(|A|) term arises in our current proof from a loose bound on the maximum matrix-element size combined with a union bound over the (exponentially many) basis elements when controlling the deviation between the non-unitary Fourier transform and its unitary approximation. We will revise the abstract, the statement of the main theorem, and the error analysis in Section 4 to replace this factor with a polynomial in n and log d (specifically, we expect a revised bound of the form (d^{-1/2} + ε) poly(n, log d)). The gate complexity poly(n, log d, log(1/ε)) is unaffected. These changes will make the approximation guarantee nontrivial and restore the claimed utility for the target algebras. revision: yes

Circularity Check

0 steps flagged

No significant circularity in derivation chain

full rationale

The paper generalizes the known group QFT to semisimple algebras via explicit algebraic constructions and quantum circuit implementations for the partition, Brauer, and walled Brauer algebras. The approximation result (unitary approximation to the possibly non-unitary Fourier transform for large d) and the gate-complexity bound poly(n, log d, log(1/ε)) are derived from properties of the Fourier basis and standard quantum algorithmic techniques rather than from any fitted parameter, self-definition, or load-bearing self-citation that reduces the central claim to its inputs by construction. The error expression (d^{-1/2} + ε) · poly(|A|) is an explicit (if loose) bound obtained from norm estimates; it does not constitute a tautological renaming or a prediction forced by prior fitting. The derivation therefore remains self-contained against external algebraic and quantum-computing benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The central claim rests on the existence of a Fourier basis for semisimple algebras and on the statement that the transform becomes approximately unitary for large d; no free parameters or invented entities are visible in the abstract.

axioms (1)

domain assumption Finite-dimensional semisimple algebras admit a Fourier transform that can be approximated by a unitary operator when the parameter d is sufficiently large
Directly stated in the abstract as the condition under which the approximation holds.

pith-pipeline@v0.9.0 · 5528 in / 1199 out tokens · 37328 ms · 2026-05-08T16:45:38.828441+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

117 extracted references · 29 canonical work pages · 1 internal anchor

[1]

2009 , eprint=

The cycle structure of compositions of random involutions , author=. 2009 , eprint=

2009
[2]

2008 , eprint=

Alcove geometry and a translation principle for the Brauer algebra , author=. 2008 , eprint=

2008
[3]

Okounkov and A

A. Okounkov and A. Vershik , title =. Selecta Mathematica , volume =
[4]

2011 , eprint=

Gradings on walled Brauer algebras and Khovanov's arc algebra , author=. 2011 , eprint=

2011
[5]

Journal of the American Mathematical Society , volume =

Persi Diaconis and Daniel Rockmore , title =. Journal of the American Mathematical Society , volume =. 1990 , doi =

1990
[6]

R. M. Green and P. P. Martin , title =. Journal of Pure and Applied Algebra , volume =. 2007 , doi =. math/0503751 , archivePrefix =

work page arXiv 2007
[7]

Journal of Combinatorial Theory, Series A , volume =

Heping Rui , title =. Journal of Combinatorial Theory, Series A , volume =. 2005 , doi =

2005
[8]

Transactions of the American Mathematical Society , volume =

Paul Martin and Maud De Visscher , title =. Transactions of the American Mathematical Society , volume =. 2010 , doi =. 0908.1500 , archivePrefix =

work page arXiv 2010
[9]

NIST Digital Library of Mathematical Functions , year =
[10]

Efficient Qudit Circuits , author=

The Quantum Schur Transform: I. Efficient Qudit Circuits , author=. 2005 , eprint=

2005
[11]

2016 , eprint=

The efficient computation of Fourier transforms on semisimple algebras , author=. 2016 , eprint=

2016
[12]

Annals of Mathematics , volume =

David Harvey and Joris van der Hoeven , title =. Annals of Mathematics , volume =
[13]

Brent and Paul Zimmermann , title =

Richard P. Brent and Paul Zimmermann , title =
[14]

Lehrer and J.J

G.I. Lehrer and J.J. Graham , journal =. Cellular algebras. , url =
[15]

2025 , school=

Mixed Schur-Weyl duality in quantum information , author=. 2025 , school=

2025
[16]

Young's orthogonal form for Brauer's centralizer algebra

Maxim Nazarov. Young's orthogonal form for Brauer's centralizer algebra. Journal of Algebra. 1996. doi:10.1006/jabr.1996.0195

work page doi:10.1006/jabr.1996.0195 1996
[17]

Jucys–Murphy elements and a presentation for partition algebras , volume=

Enyang, John , year=. Jucys–Murphy elements and a presentation for partition algebras , volume=. Journal of Algebraic Combinatorics , publisher=. doi:10.1007/s10801-012-0370-4 , number=

work page doi:10.1007/s10801-012-0370-4
[18]

A seminormal form for partition algebras , volume=

Enyang, John , year=. A seminormal form for partition algebras , volume=. Journal of Combinatorial Theory, Series A , publisher=. doi:10.1016/j.jcta.2013.06.001 , number=

work page doi:10.1016/j.jcta.2013.06.001 2013
[19]

2023 , eprint=

Gelfand-Tsetlin basis for partially transposed permutations, with applications to quantum information , author=. 2023 , eprint=

2023
[20]

Shende and Stephen S

Vivek V. Shende and Stephen S. Bullock and Igor L. Markov , title =. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems , volume =. 2006 , doi =

2006
[21]

Berry and Ian D

Ryan Babbush and Dominic W. Berry and Ian D. Kivlichan and Ann Arbor Wei and Al. Low-Depth Quantum Simulation of Materials , journal =. 2018 , doi =

2018
[22]

SIAM Journal on Computing , volume =

Sean Hallgren and Alexander Russell and Amnon Ta-Shma , title =. SIAM Journal on Computing , volume =. 2003 , doi =

2003
[23]

Shor , title =

Peter W. Shor , title =. Proceedings 35th Annual Symposium on Foundations of Computer Science , pages =. 1994 , doi =

1994
[24]

Dalzell and Alessandro Achille and Martin Suchara and Frederic T

Kaiwen Gui and Alexander M. Dalzell and Alessandro Achille and Martin Suchara and Frederic T. Chong , title =. Quantum , volume =. 2024 , doi =

2024
[25]

Pacific Journal of Mathematics , volume =

Tom Halverson , title =. Pacific Journal of Mathematics , volume =. 1996 , pages =

1996
[26]

Advances in Mathematics , volume =

Kazuhiko Koike , title =. Advances in Mathematics , volume =. 1989 , pages =

1989
[27]

1997 , isbn =

Beals, Robert , title =. 1997 , isbn =. doi:10.1145/258533.258548 , booktitle =

work page doi:10.1145/258533.258548 1997
[28]

2003 , eprint=

Generic Quantum Fourier Transforms , author=. 2003 , eprint=

2003
[29]

2004 , eprint=

Partition Algebras , author=. 2004 , eprint=

2004
[30]

Electron

Pittel, Boris , TITLE =. Electron. J. Combin. , FJOURNAL =. 2000 , PAGES =. doi:10.37236/1483 , URL =

work page doi:10.37236/1483 2000
[31]

Stam, A. J. , TITLE =. J. Combin. Theory Ser. A , FJOURNAL =. 1983 , NUMBER =. doi:10.1016/0097-3165(83)90009-2 , URL =

work page doi:10.1016/0097-3165(83)90009-2 1983
[32]

2007 , eprint=

On the blocks of the walled Brauer algebra , author=. 2007 , eprint=

2007
[33]

Molev, A. I. and Rozhkovskaya, N. , year=. Characteristic maps for the Brauer algebra , volume=. Journal of Algebraic Combinatorics , publisher=. doi:10.1007/s10801-012-0388-7 , number=

work page doi:10.1007/s10801-012-0388-7
[34]

2025 , eprint=

A log-depth in-place quantum Fourier transform that rarely needs ancillas , author=. 2025 , eprint=

2025
[35]

An efficient high dimensional quantum schur transform

Krovi, Hari , year=. An efficient high dimensional quantum Schur transform , volume=. doi:10.22331/q-2019-02-14-122 , journal=

work page doi:10.22331/q-2019-02-14-122 2019
[36]

Littlewood, D. E. and Richardson, A. R. , title =. Philosophical Transactions of the Royal Society of London. Series A, Containing Papers of a Mathematical or Physical Character , volume =. 1934 , doi =

1934
[37]

Kostka, Carl , title =. J. Reine Angew. Math. , volume =
[38]

Littlewood, D. E. , title =. Canadian Journal of Mathematics , volume =. 1958 , doi =

1958
[39]

Christandl, Matthias and Mitchison, Graeme , TITLE =. Comm. Math. Phys. , FJOURNAL =. 2006 , NUMBER =. doi:10.1007/s00220-005-1435-1 , URL =

work page doi:10.1007/s00220-005-1435-1 2006
[40]

2004 , eprint=

Quantum marginal problem and representations of the symmetric group , author=. 2004 , eprint=

2004
[41]

Murnaghan, F. D. , title =. American Journal of Mathematics , volume =. 1938 , doi =

1938
[42]

2022 , eprint=

What is a combinatorial interpretation? , author=. 2022 , eprint=

2022
[43]

Frame, J. S. and Robinson, G. de B. and Thrall, R. M. , year=. The Hook Graphs of the Symmetric Group , volume=. doi:10.4153/CJM-1954-030-1 , journal=

work page doi:10.4153/cjm-1954-030-1 1954
[44]

, TITLE =

Stanley, Richard P. , TITLE =. Mathematics: frontiers and perspectives , PAGES =. 2000 , ISBN =

2000
[45]

and Walter, Michael , year=

Ikenmeyer, Christian and Mulmuley, Ketan D. and Walter, Michael , year=. On vanishing of Kronecker coefficients , volume=. computational complexity , publisher=. doi:10.1007/s00037-017-0158-y , number=

work page doi:10.1007/s00037-017-0158-y
[46]

Jozsa, R. , year=. Quantum factoring, discrete logarithms, and the hidden subgroup problem , volume=. Computing in Science and Engineering , publisher=. doi:10.1109/5992.909000 , number=

work page doi:10.1109/5992.909000
[47]

Contractibility and

Brouwer, Andries E and Veldman, Henk J , journal=. Contractibility and. 1987 , publisher=

1987
[48]

Proceedings of the 42nd ACM Symposium on Theory of Computing , pages =

Scott Aaronson , title =. Proceedings of the 42nd ACM Symposium on Theory of Computing , pages =. 2010 , doi =

2010
[49]

Graph Isomorphism Is in the Low Hierarchy , journal =

Uwe Sch. Graph Isomorphism Is in the Low Hierarchy , journal =. 1988 , doi =

1988
[50]

Groups, Graphs, Algorithms: The Graph Isomorphism Problem , booktitle =

L. Groups, Graphs, Algorithms: The Graph Isomorphism Problem , booktitle =
[51]

The quantum query complexity of the hidden subgroup problem is polynomial , volume=

Ettinger, Mark and Høyer, Peter and Knill, Emanuel , year=. The quantum query complexity of the hidden subgroup problem is polynomial , volume=. Information Processing Letters , publisher=. doi:10.1016/j.ipl.2004.01.024 , number=

work page doi:10.1016/j.ipl.2004.01.024 2004
[52]

Quantum algorithms for algebraic problems , author =. Rev. Mod. Phys. , volume =. 2010 , month =. doi:10.1103/RevModPhys.82.1 , url =

work page doi:10.1103/revmodphys.82.1 2010
[53]

2025 , eprint=

High-dimensional quantum Schur transforms , author=. 2025 , eprint=

2025
[54]

On Quantum Algorithms for Noncommutative Hidden Subgroups , journal =

Mark Ettinger and Peter H. On Quantum Algorithms for Noncommutative Hidden Subgroups , journal =. 2000 , eprint =

2000
[55]

Hidden Translation and Orbit Coset in Quantum Computing , journal =

Katalin Friedl and G. Hidden Translation and Orbit Coset in Quantum Computing , journal =. 2003 , eprint =

2003
[56]

Sagan , title =

Bruce E. Sagan , title =
[57]

Trends in Computer Algebra , pages =

Thomas Beth , title =. Trends in Computer Algebra , pages =
[58]

Mathematics of Computation , volume =

Michael Clausen and Ulrich Baum , title =. Mathematics of Computation , volume =. 1993 , doi =

1993
[59]

2025 , eprint=

Mixed state tomography reduces to pure state tomography , author=. 2025 , eprint=

2025
[60]

and Werner, R

Keyl, M. and Werner, R. F. , year=. Estimating the spectrum of a density operator , volume=. Physical Review A , publisher=. doi:10.1103/physreva.64.052311 , number=

work page doi:10.1103/physreva.64.052311
[61]

Chiribella and G

G. Chiribella and G. M. D'Ariano and P. Perinotti and M. F. Sacchi , title =. Physical Review Letters , volume =. 2004 , doi =

2004
[62]

Journal of Physics A: Mathematical and General , volume =

Feng Pan and Lianrong Dai , title =. Journal of Physics A: Mathematical and General , volume =. 1996 , doi =

1996
[63]

R. W. Haase and R. Dirl , title =. Journal of Mathematical Physics , volume =. 1986 , doi =

1986
[64]

Sitzungsberichte der Preussischen Akademie der Wissenschaften zu Berlin, Physikalisch-Mathematische Klasse , pages =

Issai Schur , title =. Sitzungsberichte der Preussischen Akademie der Wissenschaften zu Berlin, Physikalisch-Mathematische Klasse , pages =
[65]

Hermann Weyl , title =
[66]

2005 , eprint=

Applications of coherent classical communication and the Schur transform to quantum information theory , author=. 2005 , eprint=

2005
[67]

Zhandry, Mark , booktitle=. How to. 2019 , organization=

2019
[68]

Asymptotics of quantum relative entropy from a representation theoretical viewpoint , volume=

Hayashi, Masahito , year=. Asymptotics of quantum relative entropy from a representation theoretical viewpoint , volume=. Journal of Physics A: Mathematical and General , publisher=. doi:10.1088/0305-4470/34/16/309 , number=

work page doi:10.1088/0305-4470/34/16/309
[69]

Universal Quantum Information Compression , volume=

Jozsa, Richard and Horodecki, Michał and Horodecki, Paweł and Horodecki, Ryszard , year=. Universal Quantum Information Compression , volume=. Physical Review Letters , publisher=. doi:10.1103/physrevlett.81.1714 , number=

work page doi:10.1103/physrevlett.81.1714
[70]

and Rudolph, Terry and Spekkens, Robert W

Bartlett, Stephen D. and Rudolph, Terry and Spekkens, Robert W. , year=. Classical and Quantum Communication without a Shared Reference Frame , volume=. Physical Review Letters , publisher=. doi:10.1103/physrevlett.91.027901 , number=

work page doi:10.1103/physrevlett.91.027901
[71]

Optimal Compression for Identically Prepared Qubit States , volume=

Yang, Yuxiang and Chiribella, Giulio and Hayashi, Masahito , year=. Optimal Compression for Identically Prepared Qubit States , volume=. Physical Review Letters , publisher=. doi:10.1103/physrevlett.117.090502 , number=

work page doi:10.1103/physrevlett.117.090502
[72]

Journal of Algebra , volume =

Paul Martin , title =. Journal of Algebra , volume =. 1996 , doi =

1996
[73]

2025 , eprint=

Quantum Simulation of Random Unitaries from Clebsch-Gordan Transforms , author=. 2025 , eprint=

2025
[74]

2025 , eprint=

How to Construct Random Unitaries , author=. 2025 , eprint=

2025
[75]

John Watrous , title =
[76]

2026 , note=

Perfectly Recording Queries to Random Unitaries and Other Groups, or How to Lazy-Sample Any Group , author=. 2026 , note=

2026
[77]

Annals of Mathematics , series =

Richard Brauer , title =. Annals of Mathematics , series =. 1937 , doi =

1937
[78]

Majorana Loop Models for Measurement-Only Quantum Circuits , author =. Phys. Rev. X , volume =. 2023 , month =. doi:10.1103/PhysRevX.13.041028 , url =

work page doi:10.1103/physrevx.13.041028 2023
[79]

Nuclear Physics B , volume =

Candu, Constantin and Saleur, Hubert , title =. Nuclear Physics B , volume =. 2009 , doi =

2009
[80]

Journal of High Energy Physics , volume =

Kimura, Yusuke and Ramgoolam, Sanjaye , title =. Journal of High Energy Physics , volume =. 2007 , doi =

2007

Showing first 80 references.