The arXiv preprint (submitted April 2026) outlines an FFT for the non-abelian group SU(2) by discretizing via Euler angles, applying 2D FFTs on angular components, and recursing through Jacobi polynomial properties. This yields sub-quadratic scaling versus naive matrix multiplication. As a preprint it lacks peer review and empirical benchmarks on actual quantum hardware. The approach builds on classic divide-and-conquer ideas but extends them to curved manifolds where representation theory matters. Earlier work by Kostelec and Rockmore (2008) established practical SO(3) FFTs used in crystallography; this SU(2) variant could similarly accelerate spherical CNNs and quantum control pulses. What the paper underplays is numerical stability under finite-precision arithmetic and the absence of comparisons to existing Wigner-D function libraries. It also overlooks potential synergies with quantum FFT variants already prototyped on NISQ devices. If validated, the method may cut costs in high-energy physics Monte Carlo sampling and in processing orientation data for cryo-EM, yet discretization artifacts on the group manifold remain an open risk.