Do all unitary matrices have fast multiplication algorithms?

59 Views Asked by At

One of the most widely known unitary matrices is the DFT matrix, which also has a well known fast multiplication algorithm $(O(n \ \textrm{log} \ n))$, the Fast Fourier Transform. Do all unitary matrices share the property of having a (not necessarily known) fast multiplication algorithm? Or is this unique to the DFT?