© 2026 Aqora Quantum S.A.S.

Terms Privacy Legal Notice

arXiv:2504.20649 · IEEE International Conference on Acoustics Speech and Signal Processing

Short-time quantum Fourier transform processing

Sreeraj Rajindran Nair, Benjamin John Southwell, Christopher Ferrie

Published Mar 12, 2025• 3 citations

Abstract

Algorithms for processing data in short-time batches are critical for both online and offline processing of streamed and large data respectively due to the quadratic relation between signal length and computational cost of convolution-based processing schemes. Whilst quantum analogs to some digital signal processing algorithms have been discovered, including the quantum Fourier transform (QFT), there has been no development of short-time processing techniques in the quantum domain. In this manuscript, we introduce the short-time QFT (STQFT) processing technique to bridge this gap in research. We develop a novel overlap-add reconstruction technique in the quantum domain using a permutation gate to combine subsequent windows. With this in mind, we discuss convolution under our novel STQFT processing scheme. We demonstrate filtering in the quantum Fourier domain with a filter stored in a quantum register as well as in a block encoded unitary gate. Throughout the paper, we elaborate upon implementation details such as applying DC offsets to input signals, skipping input data frames whenever necessary, the use of overlap-save as a reconstruction technique and mitigating time-varying scaling due to normalization of the windowed input data and filters.

DOI: 10.1109/icassp49660.2025.10890646

Related papers

QFT-Based Quantum Filtering and other Operations based on a DSP Framework

Alan Jobil Skaria Skaria

This preprint presents a digital signal processing (DSP) framework for interpreting Quantum Fourier Transform (QFT)-based quantum operations. The main contribution is the DSP-to-QFT filtering map, which translates selected z-domain transfer responses into sampled QFT-domain quantum operators. The paper shows that the QFT can be interpreted as sampling a formal z-transform-style representation of a quantum amplitude vector. Under this framework, DSP delay elements become QFT-domain phase ramps and produce cyclic shifts in the computational basis. Circular convolution is interpreted through sampled z-domain multiplication, while ordinary linear convolution is recovered through zero padding into a larger Hilbert space. The purpose of the paper is not to claim a new quantum speedup, but to provide a unified conceptual and mathematical framework connecting DSP ideas such as z-plane sampling, delay, convolution, and filtering with QFT-based quantum operations.

•Oct 5, 2026•0 citations

Quantum methods of image analysis and processing in the frequency domain

Dilnoz Muhamediyeva, Narzullo Mamatov, Nilufar A’loxanovna Niyozmatova +2 more

Quantum methods for image analysis and processing in the frequency domain represent an innovative approach to image processing using quantum computing. One of the key tools in this field is the quantum Fourier transform (QFT), which can be applied to quantum images to analyze and process data in the frequency domain. The process involves several steps, including quantum image preparation, QFT application, frequency domain data processing, and inverse Fourier transform to reconstruct the spatial domain image. Quantum image processing techniques offer new opportunities for solving complex problems in the field of image processing, especially in the context of the use of quantum computing. However, this area is still under active research and requires further research and technology development for practical application.

International Conference on Digital Technologies, Optics, and Materials Science (DTIEE)•Jul 31, 2024•2 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

Quantum Fourier Transform Circuit Simulator

Víctor H. Téllez, Antonio Campero, Cristina Iuga +2 more

Quantum Fourier transform is of primary importance in many quantum algorithms. This paper presents the development of a Quantum Fourier Transform Circuit Simulator system that processes classical analog signals and presents the results of the processing data. The data is acquired by an analog to digital classical converter, on a classical computer. The data stored is processed by computer using an algorithm that executes a Quantum Fast Fourier Transform (QFT).

•Jun 1, 2008•1 citation

EFFICIENT IMPLEMENTATIONS OF THE QUANTUM FOURIER TRANSFORM: AN EXPERIMENTAL PERSPECTIVE

Kavita Dorai, Dieter Suter

The Quantum Fourier transform (QFT) is a key ingredient in most quantum algorithms. We have compared various spin-based quantum computing schemes to implement the QFT from the point of view of their actual time-costs and the accuracy of the implementation. We focus here on an interesting decomposition of the QFT as a product of the non-selective Hadamard transformation followed by multiqubit gates corresponding to square- and higher-roots of controlled-NOT gates. This decomposition requires only O(n) operations and is thus linear in the number of qubits n. The schemes were implemented on a two-qubit NMR quantum information processor and the resultant density matrices reconstructed using standard quantum state tomography techniques. Their experimental fidelities have been measured and compared.

arXiv:quant-ph/0211030•International Journal of Quantum Information•May 31, 2005•16 citations

Efficient implementations of the quantum Fourier transform

Dieter Suter, Kavita Dorai

The Quantum Fourier transform (QFT) is a key ingredient in most quantum algorithms. We have compared various spin-based quantum computing schemes to implement the QFT from the point of view of their actual time-costs and the accuracy of the implementation. We focus here on an interesting decomposition of the QFT as a product of the non-selective Hadamard transformation followed by multiqubit gates corresponding to square- and higher-roots of controlled-NOT gates. This decomposition requires only O(n) operations and is thus linear in the number of qubits n. The schemes were implemented on a two-qubit NMR quantum information processor and the resultant density matrices reconstructed using standard quantum state tomography techniques. Their experimental fidelities have been measured and compared.

•Jun 1, 2005•5 citations

Algorithms for processing data in short-time batches are critical for both online and offline processing of streamed and large data respectively due to the quadratic relation between signal length and computational cost of convolution-based processing schemes. Whilst quantum analogs to some digital signal processing algorithms have been discovered, including the quantum Fourier transform (QFT), there has been no development of short-time processing techniques in the quantum domain. In this manuscript, we introduce the short-time QFT (STQFT) processing technique to bridge this gap in research. We develop a novel overlap-add reconstruction technique in the quantum domain using a permutation gate to combine subsequent windows. With this in mind, we discuss convolution under our novel STQFT processing scheme. We demonstrate filtering in the quantum Fourier domain with a filter stored in a quantum register as well as in a block encoded unitary gate. Throughout the paper, we elaborate upon implementation details such as applying DC offsets to input signals, skipping input data frames whenever necessary, the use of overlap-save as a reconstruction technique and mitigating time-varying scaling due to normalization of the windowed input data and filters.

This preprint presents a digital signal processing (DSP) framework for interpreting Quantum Fourier Transform (QFT)-based quantum operations. The main contribution is the DSP-to-QFT filtering map, which translates selected z-domain transfer responses into sampled QFT-domain quantum operators. The paper shows that the QFT can be interpreted as sampling a formal z-transform-style representation of a quantum amplitude vector. Under this framework, DSP delay elements become QFT-domain phase ramps and produce cyclic shifts in the computational basis. Circular convolution is interpreted through sampled z-domain multiplication, while ordinary linear convolution is recovered through zero padding into a larger Hilbert space. The purpose of the paper is not to claim a new quantum speedup, but to provide a unified conceptual and mathematical framework connecting DSP ideas such as z-plane sampling, delay, convolution, and filtering with QFT-based quantum operations.

Quantum methods for image analysis and processing in the frequency domain represent an innovative approach to image processing using quantum computing. One of the key tools in this field is the quantum Fourier transform (QFT), which can be applied to quantum images to analyze and process data in the frequency domain. The process involves several steps, including quantum image preparation, QFT application, frequency domain data processing, and inverse Fourier transform to reconstruct the spatial domain image. Quantum image processing techniques offer new opportunities for solving complex problems in the field of image processing, especially in the context of the use of quantum computing. However, this area is still under active research and requires further research and technology development for practical application.

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.

The Quantum Fourier transform (QFT) is a key ingredient in most quantum algorithms. We have compared various spin-based quantum computing schemes to implement the QFT from the point of view of their actual time-costs and the accuracy of the implementation. We focus here on an interesting decomposition of the QFT as a product of the non-selective Hadamard transformation followed by multiqubit gates corresponding to square- and higher-roots of controlled-NOT gates. This decomposition requires only O(n) operations and is thus linear in the number of qubits n. The schemes were implemented on a two-qubit NMR quantum information processor and the resultant density matrices reconstructed using standard quantum state tomography techniques. Their experimental fidelities have been measured and compared.

The Quantum Fourier transform (QFT) is a key ingredient in most quantum algorithms. We have compared various spin-based quantum computing schemes to implement the QFT from the point of view of their actual time-costs and the accuracy of the implementation. We focus here on an interesting decomposition of the QFT as a product of the non-selective Hadamard transformation followed by multiqubit gates corresponding to square- and higher-roots of controlled-NOT gates. This decomposition requires only O(n) operations and is thus linear in the number of qubits n. The schemes were implemented on a two-qubit NMR quantum information processor and the resultant density matrices reconstructed using standard quantum state tomography techniques. Their experimental fidelities have been measured and compared.