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

Journal of Quantum Information Science

Quantum-Classical Algorithm for an Instantaneous Spectral Analysis of Signals: A Complement to Fourier Theory

Mario Mastriani

Published Jan 1, 2018• 4 citations
Publisher

Abstract

A quantum time-dependent spectrum analysis, or simply, quantum spectral analysis (QSA) is presented in this work, and it’s based on Schrödinger’s equation. In the classical world, it is named frequency in time (FIT), which is used here as a complement of the traditional frequency-dependent spectral analysis based on Fourier theory. Besides, FIT is a metric which assesses the impact of the flanks of a signal on its frequency spectrum, not taken into account by Fourier theory and lets alone in real time. Even more, and unlike all derived tools from Fourier Theory (i.e., continuous, discrete, fast, short-time, fractional and quantum Fourier Transform, as well as, Gabor) FIT has the following advantages, among others: 1) compact support with excellent energy output treatment, 2) low computational cost, O(N) for signals and O(N2) for images, 3) it does not have phase uncertainties (i.e., indeterminate phase for a magnitude = 0) as in the case of Discrete and Fast Fourier Transform (DFT, FFT, respectively). Finally, we can apply QSA to a quantum signal, that is, to a qubit stream in order to analyze it spectrally.

DOI
10.4236/jqis.2018.82005

Related papers

Application of the Quantum Fourier Transform (QFT) for Spectral Analysis of Signals

Ilimdar Muratov, Olga Alexandrovna Safaryan, Vladimir N. Taran

This paper examines the application of the quantum Fourier transform (QFT) to spectral signal analysis. A theoretical overview of the QFT algorithm's operating principles is presented, and its practical simulation is conducted on the Qiskit Aer quantum computing simulator. A quantum transform scheme for a time series containing several harmonic components is implemented, with step-by-step observation of the qubit states during the computation. The obtained results demonstrate that the amplitude-frequency spectrum calculated by the QFT method corresponds to the classical fast Fourier transform (FFT), confirming the correctness of the algorithm's implementation. The advantage of the quantum approach, consisting of exponential acceleration of computations due to superposition and parallel processing of qubit states, is noted. The prospects for applying the QFT method to turbulence analysis and processing of complex physical signals in simulating the motion of high-speed vehicles are discussed.

International Russian Automation Conference (RusAutoCon)•Sep 1, 2026•0 citations

Quantum Discrete Fourier Transform with Classical Output for Signal Processing

Chao-Yang Pang, Ben-Qiong Hu

Discrete Fourier transform (DFT) is the base of modern signal or information processing. 1-Dimensional fast Fourier transform (1D FFT) and 2D FFT have time complexity O(NlogN) and O(N^2logN) respectively. Quantum 1D and 2D DFT algorithms with classical output (1D QDFT and 2D QDFT) are presented in this paper. And quantum algorithm for convolution estimation is also presented in this paper. Compared with FFT, QDFT has two advantages at least. One of advantages is that 1D and 2D QDFT has time complexity O(sqrt(N)) and O(N) respectively. The other advantage is that QDFT can process very long signal sequence at a time. QDFT and quantum convolution demonstrate that quantum signal processing with classical output is possible.

arXiv:0706.2451•Jun 17, 2007•3 citations

Advancements in Fourier Analysis: The Quantum Perspective

S. T., Aniverthy Amrutesh

Fourier Transform (FT) is an important signal processing technique that translates time-domain signals to frequency-domain forms. It is widely used in several applications, including 5G networks, image processing, & spectrum analysis. In 5G networks, efficient frequency analysis is critical for noise reduction, channel optimisation, and signal dependability.This study explores the implementation of Classical Fourier Transform, Fast Fourier Transform, and Quantum Fourier Transform using Python (NumPy, Pandas, Matplotlib) and Qiskit. The FFT significantly improves processing speed, making it suitable for real-time applications. On the other hand, QFT leverages quantum superposition and entanglement, offering promising advancements for future high-speed communication and secure data transmission. Additionally, the signal is successfully reconstructed using both the Inverse Fast Fourier Transform (IFFT) and the Inverse Quantum Fourier Transform (IQFT). While IFFT efficiently restores the original signal with minimal numerical artifacts, IQFT ensures exact reconstruction without errors. The study also includes execution on IBM Quantum’s real hardware, showcasing the practical feasibility of quantum-based signal processing.

IEEE Space, Aerospace and Defence Conference (SPACE)•Jul 21, 2025•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

A review on quantum Fourier transform

Tomás Barros, Pablo Álvarez, Bárbara Vidal +1 more

This survey presents a comprehensive analysis of the quantum Fourier transform (QFT), a fundamental tool in quantum computing, in comparison to its classical counterpart, the fast Fourier transform (FFT). The study begins with an introduction to the classical Fourier transform, which is widely used in different disciplines such as signal and image processing. The article introduces the QFT as a quantum version of the Fourier transform, detailing how it leverages quantum parallelism and superposition to reduce the time complexity of the operation, and highlighting its crucial role in quantum algorithms like Shor’s algorithm for integer factorization. The analysis also addresses the mathematical foundations of the QFT, its implementation in quantum circuits, and the key advantages and challenges associated with its use, such as measurement precision and quantum decoherence. Finally, it concludes with an exploration of the current and potential applications of QFT in quantum computing.

Quantum Information Processing•Jan 27, 2026•2 citations

Windowed Quantum Phase Estimation: Signal Processing Approach to a Quantum Algorithm

Xue Wen

Quantum phase estimation (QPE) is a key ingredient to some of the most important results of quantum computing. In this paper we examine the QPE algorithm through the looking glass of signal processing. This perspective helps to reveal a relation between the distribution of quantum phase estimates and the shape of the discrete Fourier transform (DFT) of a pure complex sinusoid. Guided by spectral shaping theory, we design a class of quantum circuits that are the quantum equivalents to classical windowing operators, for a family of window functions that have compact support in the DFT. These circuits have complexity linear in the number of target qubits, strictly lower than QPE itself. Using these circuits we are able to reshape QPE's performance characteristics. In particular, the asymptotic marginal cost for 2x reduction in fail rate (2x improvement in reliability) is reduced from one qubit to 1/3 qubit or lower, which can help reduce the qubit budget for a preset accuracy-reliability target, especially in high-reliability scenarios. This makes a demonstration of the value of signal processing principles in designing quantum algorithms.

IEEE International Conference on Acoustics Speech and Signal Processing•Mar 12, 2025•0 citations
A quantum time-dependent spectrum analysis, or simply, quantum spectral analysis (QSA) is presented in this work, and it’s based on Schrödinger’s equation. In the classical world, it is named frequency in time (FIT), which is used here as a complement of the traditional frequency-dependent spectral analysis based on Fourier theory. Besides, FIT is a metric which assesses the impact of the flanks of a signal on its frequency spectrum, not taken into account by Fourier theory and lets alone in real time. Even more, and unlike all derived tools from Fourier Theory (i.e., continuous, discrete, fast, short-time, fractional and quantum Fourier Transform, as well as, Gabor) FIT has the following advantages, among others: 1) compact support with excellent energy output treatment, 2) low computational cost, O(N) for signals and O(N2) for images, 3) it does not have phase uncertainties (i.e., indeterminate phase for a magnitude = 0) as in the case of Discrete and Fast Fourier Transform (DFT, FFT, respectively). Finally, we can apply QSA to a quantum signal, that is, to a qubit stream in order to analyze it spectrally.
This paper examines the application of the quantum Fourier transform (QFT) to spectral signal analysis. A theoretical overview of the QFT algorithm's operating principles is presented, and its practical simulation is conducted on the Qiskit Aer quantum computing simulator. A quantum transform scheme for a time series containing several harmonic components is implemented, with step-by-step observation of the qubit states during the computation. The obtained results demonstrate that the amplitude-frequency spectrum calculated by the QFT method corresponds to the classical fast Fourier transform (FFT), confirming the correctness of the algorithm's implementation. The advantage of the quantum approach, consisting of exponential acceleration of computations due to superposition and parallel processing of qubit states, is noted. The prospects for applying the QFT method to turbulence analysis and processing of complex physical signals in simulating the motion of high-speed vehicles are discussed.
Discrete Fourier transform (DFT) is the base of modern signal or information processing. 1-Dimensional fast Fourier transform (1D FFT) and 2D FFT have time complexity O(NlogN) and O(N^2logN) respectively. Quantum 1D and 2D DFT algorithms with classical output (1D QDFT and 2D QDFT) are presented in this paper. And quantum algorithm for convolution estimation is also presented in this paper. Compared with FFT, QDFT has two advantages at least. One of advantages is that 1D and 2D QDFT has time complexity O(sqrt(N)) and O(N) respectively. The other advantage is that QDFT can process very long signal sequence at a time. QDFT and quantum convolution demonstrate that quantum signal processing with classical output is possible.
Fourier Transform (FT) is an important signal processing technique that translates time-domain signals to frequency-domain forms. It is widely used in several applications, including 5G networks, image processing, & spectrum analysis. In 5G networks, efficient frequency analysis is critical for noise reduction, channel optimisation, and signal dependability.This study explores the implementation of Classical Fourier Transform, Fast Fourier Transform, and Quantum Fourier Transform using Python (NumPy, Pandas, Matplotlib) and Qiskit. The FFT significantly improves processing speed, making it suitable for real-time applications. On the other hand, QFT leverages quantum superposition and entanglement, offering promising advancements for future high-speed communication and secure data transmission. Additionally, the signal is successfully reconstructed using both the Inverse Fast Fourier Transform (IFFT) and the Inverse Quantum Fourier Transform (IQFT). While IFFT efficiently restores the original signal with minimal numerical artifacts, IQFT ensures exact reconstruction without errors. The study also includes execution on IBM Quantum’s real hardware, showcasing the practical feasibility of quantum-based signal processing.
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.
This survey presents a comprehensive analysis of the quantum Fourier transform (QFT), a fundamental tool in quantum computing, in comparison to its classical counterpart, the fast Fourier transform (FFT). The study begins with an introduction to the classical Fourier transform, which is widely used in different disciplines such as signal and image processing. The article introduces the QFT as a quantum version of the Fourier transform, detailing how it leverages quantum parallelism and superposition to reduce the time complexity of the operation, and highlighting its crucial role in quantum algorithms like Shor’s algorithm for integer factorization. The analysis also addresses the mathematical foundations of the QFT, its implementation in quantum circuits, and the key advantages and challenges associated with its use, such as measurement precision and quantum decoherence. Finally, it concludes with an exploration of the current and potential applications of QFT in quantum computing.
Quantum phase estimation (QPE) is a key ingredient to some of the most important results of quantum computing. In this paper we examine the QPE algorithm through the looking glass of signal processing. This perspective helps to reveal a relation between the distribution of quantum phase estimates and the shape of the discrete Fourier transform (DFT) of a pure complex sinusoid. Guided by spectral shaping theory, we design a class of quantum circuits that are the quantum equivalents to classical windowing operators, for a family of window functions that have compact support in the DFT. These circuits have complexity linear in the number of target qubits, strictly lower than QPE itself. Using these circuits we are able to reshape QPE's performance characteristics. In particular, the asymptotic marginal cost for 2x reduction in fail rate (2x improvement in reliability) is reduced from one qubit to 1/3 qubit or lower, which can help reduce the qubit budget for a preset accuracy-reliability target, especially in high-reliability scenarios. This makes a demonstration of the value of signal processing principles in designing quantum algorithms.