A Novel Finite Fractional Fourier Transform and its Quantum Circuit Implementation on Qudits
<|reference_start|>A Novel Finite Fractional Fourier Transform and its Quantum Circuit Implementation on Qudits: We present a new number theoretic definition of discrete fractional Fourier transform (DFrFT) . In this approach the DFrFT is defined as the $N \times N$ dimensional unitary representation of the generator of the arithmetic rotational group $SO_{2}[\mathbb{Z}_N]$, which is the finite set of $\bmod N$ integer, $2\times 2$ matrices acting on the points of the discrete toroidal phase space lattice $\mathbb{Z}_N \times \mathbb{Z}_N$, preserving the euclidean distance $\bmod N$. Using known factorization properties of $SO_{2}[\mathbb{Z}_N]$ for any integer $N$ into products of $SO_{2}[\mathbb{Z}_{p^{n}}]$'s where $p^n$ are the prime power factors of $N$ and $n=1,2,\ldots$, it is enough to study the arithmetic rotation group $SO_{2}[\mathbb{Z}_{p^n}]$ which is abelian and cyclic. We show that we can find always an appropriate power of the generator of $SO_{2}[\mathbb{Z}_{p^n}]$, which produces the rotation by $90$ degrees whose the unitary representation is the discrete Fourier transform (DFT). We construct explicitly, using techniques of the Finite Quantum Mechanics (FQM), the $p^n$ dimensional unitary matrix representation of the group $SO_{2}[\mathbb{Z}_{p^n}]$ and especially we work out in detail the one which corresponds to the generator. This is our definition of the arithmetic fractional Fourier transform (AFrFT). Following this definition, we proceed to the construction of efficient quantum circuits for the AFrFT, on sets of $n$ $p$-dimensional qudits with $p$ a prime integer, by introducing novel quantum subcircuits for diagonal operators with quadratic phases as well as new quantum subcircuits for multipliers by a constant. The quantum subcircuits that we introduce provide a set capable to construct quantum circuits for any element of a more general group, the group of Linear Canonical Transformations (LCT), $SL_{2}[\mathbb{Z}_N]$ of the toroidal phase space lattice. As a byproduct, extensions of the diagonal and multiplier quantum circuits for both the qudit and qubit case are given, which are useful alone in various applications. Also, we analyze the depth, width and gate complexity of the efficient AFrFT quantum circuit and we estimate its gate complexity which is of the order $O(n^2)$, its depth which is of the order $O(n)$ with depth $n$, while at the same time it has a structure permitting local interactions between the qudits.<|reference_end|>
@article{floratos2024a,
    title={A Novel Finite Fractional Fourier Transform and its Quantum Circuit
  Implementation on Qudits},
    author={Emmanuel Floratos and Archimedes Pavlidis},
    journal={arXiv preprint arXiv:2409.05759},
    year={2024},
    archivePrefix={arXiv},
    eprint={2409.05759},
    primaryClass={quant-ph cs.ET eess.SP hep-th}
}