unitaria.FourierTransform¶

class unitaria.FourierTransform(bits: int)[source]¶

Bases: Node

Node representing a discrete Fourier transform F(x)_k = sum_(n = 0)^(2^bits - 1) x_n exp(-i 2 pi k n / 2^bits) Note that this uses the DFT convention with the minus sign in the exponent, which differs from the usual convention for the QFT.

Parameters:: bits – The number of bits that this Node acts on.