2009/06/05 by Srinivas Vamsi Parasa, Parasa, Srinivas V., K. Eswaran +1
Computer Science · Mathematics · #Coding theory and cryptography #FOS: Physical sciences #Mathematical Analysis and Transform Methods #Quantum Computing Algorithms and Architecture #Quantum Physics (quant-ph)
paper · pdf · doi:10.48550/arxiv.0906.1033
openalex publication_date 2009/06/05 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
- In this paper we present a method to compute the coefficients of the fractional Fourier transform (FrFT) on a quantum computer using quantum gates of polynomial complexity of the order O(n3). The FrFt, a generalization of the DFT, has wide applications in signal processing and is particularly useful to implement the Pseudopolar and Radon transforms. Even though the FrFT is a non-unitary operation, to develop its quantum counterpart, we develop a unitary operator called the quantum Pseudo-fraction Fourier Transform (QPFrFT) in a higher-dimensional Hilbert space, in order to computer the coefficients of the FrFT. In this process we develop a unitary operator denoted U by which is an essential step to implement the QPFrFT. We then show the application of the operator U in the problem of quantum phase estimation.