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:quant-ph/0005134

Quantum Time-Frequency Transforms

Ettinger, J. Mark

Published May 31, 2000• 2 citations
arXivHTMLPDF

Abstract

Time-frequency transforms represent a signal as a mixture of its time domain representation and its frequency domain representation. We present efficient algorithms for the quantum Zak transform and quantum Weyl-Heisenberg transform.
DOI
10.48550/arxiv.quant-ph/0005134

Related papers

Quantum Fourier Transform

Andreas Wichert

A periodic function can be represented in the frequency space. The frequency is the number of occurrences of a repeating event per one unit of time. If something changes rapidly, then we say that it has a high frequency. If it does not change rapidly, i.e., it changes smoothly, we say that it has a low frequency. The discrete Fourier transform (DFT) converts discrete time-based or space-based data into the frequency domain.

Chapman & Hall/CRC eBooks•Nov 28, 2023•1 citation

Quantum Inverse Fast Fourier Transform

Roy, Mayank, Devi Maheswaran

In this paper, an algorithm for Quantum Inverse Fast Fourier Transform (QIFFT) is developed to work for quantum data. Analogous to a classical discrete signal, a quantum signal can be represented in Dirac notation, application of QIFFT is a tensor transformation from frequency domain to time domain. If the tensors are merely complex entries, then we get the classical scenario. We have included the complete formulation of QIFFT algorithm from the classical model and have included butterfly diagram. QIFFT outperforms regular inversion of Quantum Fourier Transform (QFT) in terms of computational complexity, quantum parallelism and improved versatility.

arXiv:2409.07983•Sep 12, 2024•0 citations

FOURIER TRANSFORM ANALYSIS USING QUANTUM COMPUTATION METHOD

Surya P, U. Pavan Kumar, Ch. Arun Prakash +2 more

signals into frequency-domain forms is the Fourier Transform (FT). It is extensively utilized in several fields, such as spectrum analysis, audio and video processing, and 5G networks. Effective frequency analysis is essential for channel optimization, signal reliability, and noise reduction in 5G networks. The FFT is appropriate for real-time applications since it greatly increases processing speed. However, the Quantum Fourier Transform makes use of quantum entanglement and superposition, providing exciting new developments for secure data transfer and high-speed communication in the future. Furthermore, both the Inverse Fast Fourier Transform (IFFT) and the Inverse Quantum Fourier Transform are used to correctly recreate the signal. Implementation of Quantum's real valued computing of quantum-based signal processing is also covered in the survey.

International Journal of Advanced Research•Feb 21, 2026•0 citations

The Heisenberg Uncertainty Principle and Time-Frequency Decompositions

Barbara Burke Hubbard

It is sometimes said that one can't localize a signal simultaneously in time and frequency. This can be misleading. It's not that we can't localize the signal in time and frequency. The signal itself can't be concentrated simultaneously in time and in frequency. The Heisenberg uncertainty principle does not limit what we can know about reality; it describes that reality. The shorter-lived a function, the wider the band of frequencies given by its Fourier transform; the narrower the band of frequencies of its Fourier transform, the more the function is spread out in time.

A K Peters/CRC Press eBooks•May 30, 1998•0 citations

A Metaplectic Perspective of Uncertainty Principles in the Linear Canonical Transform Domain

Nuno Costa Dias, Maurice A. de Gosson, João Nuno Prata

We derive Heisenberg uncertainty principles for pairs of Linear Canonical Transforms of a given function, by resorting to the fact that these transforms are just metaplectic operators associated with free symplectic matrices. The results obtained synthesize and generalize previous results found in the literature, because they apply to all signals, in arbitrary dimension and any metaplectic operator (which includes Linear Canonical Transforms as particular cases). Moreover, we also obtain a generalization of the Robertson-Schrödinger uncertainty principle for Linear Canonical Transforms. We also propose a new quadratic phase-space distribution, which represents a signal along two intermediate directions in the time-frequency plane. The marginal distributions are always non-negative and permit a simple interpretation in terms of the Radon transform. We also give a geometric interpretation of this quadratic phase-space representation as a Wigner distribution obtained upon Weyl quantization on a non-standard symplectic vector space. Finally, we derive the multidimensional version of the Hardy uncertainty principle for metaplectic operators and the Paley-Wiener theorem for Linear Canonical Transforms.

arXiv:2405.10651•Journal of Functional Analysis•Jan 1, 2022•15 citations

Quantum Fourier transforms

Shinil Cho

Fourier transform has been applied to applications of quantum computation. In this chapter, we explain how quantum Fourier transform (QFT) is defined to apply to quantum computation problems such as Shor’s algorithm and quantum walks.

Institute of Physics eBooks•Dec 1, 2023•0 citations
In this paper, an algorithm for Quantum Inverse Fast Fourier Transform (QIFFT) is developed to work for quantum data. Analogous to a classical discrete signal, a quantum signal can be represented in Dirac notation, application of QIFFT is a tensor transformation from frequency domain to time domain. If the tensors are merely complex entries, then we get the classical scenario. We have included the complete formulation of QIFFT algorithm from the classical model and have included butterfly diagram. QIFFT outperforms regular inversion of Quantum Fourier Transform (QFT) in terms of computational complexity, quantum parallelism and improved versatility.
signals into frequency-domain forms is the Fourier Transform (FT). It is extensively utilized in several fields, such as spectrum analysis, audio and video processing, and 5G networks. Effective frequency analysis is essential for channel optimization, signal reliability, and noise reduction in 5G networks. The FFT is appropriate for real-time applications since it greatly increases processing speed. However, the Quantum Fourier Transform makes use of quantum entanglement and superposition, providing exciting new developments for secure data transfer and high-speed communication in the future. Furthermore, both the Inverse Fast Fourier Transform (IFFT) and the Inverse Quantum Fourier Transform are used to correctly recreate the signal. Implementation of Quantum's real valued computing of quantum-based signal processing is also covered in the survey.
It is sometimes said that one can't localize a signal simultaneously in time and frequency. This can be misleading. It's not that we can't localize the signal in time and frequency. The signal itself can't be concentrated simultaneously in time and in frequency. The Heisenberg uncertainty principle does not limit what we can know about reality; it describes that reality. The shorter-lived a function, the wider the band of frequencies given by its Fourier transform; the narrower the band of frequencies of its Fourier transform, the more the function is spread out in time.
We derive Heisenberg uncertainty principles for pairs of Linear Canonical Transforms of a given function, by resorting to the fact that these transforms are just metaplectic operators associated with free symplectic matrices. The results obtained synthesize and generalize previous results found in the literature, because they apply to all signals, in arbitrary dimension and any metaplectic operator (which includes Linear Canonical Transforms as particular cases). Moreover, we also obtain a generalization of the Robertson-Schrödinger uncertainty principle for Linear Canonical Transforms. We also propose a new quadratic phase-space distribution, which represents a signal along two intermediate directions in the time-frequency plane. The marginal distributions are always non-negative and permit a simple interpretation in terms of the Radon transform. We also give a geometric interpretation of this quadratic phase-space representation as a Wigner distribution obtained upon Weyl quantization on a non-standard symplectic vector space. Finally, we derive the multidimensional version of the Hardy uncertainty principle for metaplectic operators and the Paley-Wiener theorem for Linear Canonical Transforms.