Generalizes QFT to semisimple algebras and gives poly(n, log d, log(1/ε)) gate algorithms that approximate the transform to error (d^{-1/2} + ε) poly(|A|) on partition, Brauer, and walled Brauer algebras when d is large.
Trends in Computer Algebra , pages =
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Efficient Quantum Fourier Transforms For Semisimple Algebras
Generalizes QFT to semisimple algebras and gives poly(n, log d, log(1/ε)) gate algorithms that approximate the transform to error (d^{-1/2} + ε) poly(|A|) on partition, Brauer, and walled Brauer algebras when d is large.