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.
An efficient high dimensional quantum schur transform
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
method 1
citation-polarity summary
fields
quant-ph 2years
2026 2verdicts
UNVERDICTED 2roles
method 1polarities
use method 1representative citing papers
Computational constraints exponentially suppress accessible entanglement for some highly entangled quantum states and can make mixed-state min-entropy appear maximal when the information-theoretic version is negative.
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.
-
Accessible Quantum Correlations Under Complexity Constraints
Computational constraints exponentially suppress accessible entanglement for some highly entangled quantum states and can make mixed-state min-entropy appear maximal when the information-theoretic version is negative.