Pages that link to "Item:Q5414631"

The following pages link to A lower bound for Fourier transform computation in a linear model over \(2\times 2\) unitary gates using matrix entropy (Q5414631):

Displaying 5 items.

• Entropy of operators or why matrix multiplication is hard for depth-two circuits (Q970107) (← links)
• The complexity of computing (almost) orthogonal matrices with \(\varepsilon\)-copies of the Fourier transform (Q2224843) (← links)
• Paraunitary matrices, entropy, algebraic condition number and Fourier computation (Q2304569) (← links)
• An \(\mathrm{Omega}((n \log n)/R)\) lower bound for Fourier transform computation in the \(R\)-well conditioned model (Q2828217) (← links)
• Tighter Fourier Transform Lower Bounds (Q3448770) (← links)