Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1002.3908 · Journal of Geometry and Physics

Fractional Fourier transform and geometric quantization

Witold Chmielowiec, Jerzy Kijowski

Published Feb 25, 2012• 4 citations
arXivHTMLPDF
DOI
10.1016/j.geomphys.2012.02.008

Related papers

Geometric Quantization, Parallel Transport and the Fourier Transform

William D. Kirwin, Siye Wu

arXiv:math/0409555•Communications in Mathematical Physics•Jul 6, 2006•42 citations

The quantum fractional Fourier transform

Nga T. T. Nguyen, Rolando D. Somma

Bulletin of the American Physical Society•Mar 6, 2014•0 citations

Quantum Fractional Fourier Transform

Yesid Madrid, Martha Lucía Molina Prado, Rafael Torres

Fourier transform has taken place in different areas and applications, in this paper has been revised an important new form of application in the paradigm of quantum computing. Quantum Fourier transforms have gained increased attention with the rise of quantum walks, boson sampling, and quantum metrology [2]. In the Shor’s Algorithm it is used for find discrete logarithms on a quantum computer with two modular exponentiations and two quantum Fourier transforms [1]. Our propose consist in show a new quantum gate that can perform the Fractional Fourier Transform defined by Namias as a tool to solve the differential equation of the quantum mechanical oscillator [3], which it can satisfy the condition of to be unitary. We apply the quantum gate in different states through of a real quantum computer offered by IBM for check that it carry out the transform successfully, it results were compared with results of Quantum Fourier Transform for can understand its application. In the geometric point of view showed in the figure (2a) and (2c) through of Bloch Sphere, we can see the difference between the application of Quantum Fourier Transform (QFT) and Quantum Fractional Fourier Transform (with our quantum gate) to the basis state |0〉, while in the figure (2b) and (2d) is possible see with a theoretical result that probability density is equal for both.

Frontiers in Optics•Jan 1, 2018•2 citations

Geometry and dynamics in the fractional discrete Fourier transform

Kurt Bernardo Wolf, Guillermo Krötzsch

The N x N Fourier matrix is one distinguished element within the group U(N) of all N x N unitary matrices. It has the geometric property of being a fourth root of unity and is close to the dynamics of harmonic oscillators. The dynamical correspondence is exact only in the N-->infinity contraction limit for the integral Fourier transform and its fractional powers. In the finite-N case, several options have been considered in the literature. We compare their fidelity in reproducing the classical harmonic motion of discrete coherent states.

Journal of the Optical Society of America A•Feb 14, 2007•34 citations

Quantum Fourier Transform and Its Applications

Weng-Long Chang, Athanasios V. Vasilakos

Studies in big data•Dec 21, 2020•2 citations

Circuit of Quantum Fractional Fourier Transform

Tieyu Zhao, Yingying Chi

In this paper, we first use the quantum Fourier transform (QFT) and quantum phase estimation (QPE) to realize the quantum fractional Fourier transform (QFrFT). As diverse definitions of the discrete fractional Fourier transform (DFrFT) exist, the relationship between the QFrFT and a classical algorithm is then established; that is, we determine the classical algorithm corresponding to the QFrFT. Second, we observe that many definitions of the multi-fractional Fourier transform (mFrFT) are flawed: when we attempt to propose a design scheme for the quantum mFrFT, we find that there are many invalid weighting terms in the definition of the mFrFT. This flaw may have very significant impacts on relevant algorithms for signal processing and image encryption. Finally, we analyze the circuit of the QFrFT and the reasons for the observed defects.

Fractal and Fractional•Oct 8, 2023•1 citation
Fourier transform has taken place in different areas and applications, in this paper has been revised an important new form of application in the paradigm of quantum computing. Quantum Fourier transforms have gained increased attention with the rise of quantum walks, boson sampling, and quantum metrology [2]. In the Shor’s Algorithm it is used for find discrete logarithms on a quantum computer with two modular exponentiations and two quantum Fourier transforms [1]. Our propose consist in show a new quantum gate that can perform the Fractional Fourier Transform defined by Namias as a tool to solve the differential equation of the quantum mechanical oscillator [3], which it can satisfy the condition of to be unitary. We apply the quantum gate in different states through of a real quantum computer offered by IBM for check that it carry out the transform successfully, it results were compared with results of Quantum Fourier Transform for can understand its application. In the geometric point of view showed in the figure (2a) and (2c) through of Bloch Sphere, we can see the difference between the application of Quantum Fourier Transform (QFT) and Quantum Fractional Fourier Transform (with our quantum gate) to the basis state |0〉, while in the figure (2b) and (2d) is possible see with a theoretical result that probability density is equal for both.
The N x N Fourier matrix is one distinguished element within the group U(N) of all N x N unitary matrices. It has the geometric property of being a fourth root of unity and is close to the dynamics of harmonic oscillators. The dynamical correspondence is exact only in the N-->infinity contraction limit for the integral Fourier transform and its fractional powers. In the finite-N case, several options have been considered in the literature. We compare their fidelity in reproducing the classical harmonic motion of discrete coherent states.
In this paper, we first use the quantum Fourier transform (QFT) and quantum phase estimation (QPE) to realize the quantum fractional Fourier transform (QFrFT). As diverse definitions of the discrete fractional Fourier transform (DFrFT) exist, the relationship between the QFrFT and a classical algorithm is then established; that is, we determine the classical algorithm corresponding to the QFrFT. Second, we observe that many definitions of the multi-fractional Fourier transform (mFrFT) are flawed: when we attempt to propose a design scheme for the quantum mFrFT, we find that there are many invalid weighting terms in the definition of the mFrFT. This flaw may have very significant impacts on relevant algorithms for signal processing and image encryption. Finally, we analyze the circuit of the QFrFT and the reasons for the observed defects.