New answers tagged fourier-analysis
0
votes
What is the time complexity of fermionic Fourier transform?
It is at most $O(2^L L^2)$
openfermion.circuits.ffft implements the fermionic Fourier transform on a gate quantum computer. One can simulate this algorithm on a classical computer at the ...
Top 50 recent answers are included
Related Tags
fourier-analysis × 69boolean-functions × 45
cc.complexity-theory × 18
co.combinatorics × 14
quantum-computing × 7
circuit-complexity × 7
reference-request × 6
gr.group-theory × 5
ds.algorithms × 4
lg.learning × 4
time-complexity × 3
soft-question × 2
linear-algebra × 2
quantum-information × 2
polynomials × 2
pseudorandomness × 2
pac-learning × 2
intuition × 2
monotone × 2
bounded-degree × 2
fft × 2
graph-theory × 1
np-hardness × 1
complexity-classes × 1
machine-learning × 1