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

IEEE Eurasia Conference on IOT, Communication and Engineering (ECICE)

Finite Impulse Response Digital Filter Implementation Using Quantum Computation and Orthogonal Triangular Decomposition

Chien‐Cheng Tseng, Su‐Ling Lee

Published Mar 27, 2026• 1 citation
Publisher

Abstract

In digital signal processing, the finite impulse response (FIR) filter is a fundamental tool for processing discrete-time signals. This paper explores the implementation of FIR filters using quantum computation methods. In this study, a quantum circuit for the FIR filter is designed using a normalized filter coefficient vector, orthogonal triangular decomposition commonly known as QR decomposition, and the transpilation tools provided by IBM’s software Qiskit SDK V2.3. Then, each block of the input signal is normalized to a unit-norm vector, loaded into a quantum register, and processed by the FIR filter quantum circuit to produce an output state. Quantum measurement is then performed on the output state to obtain a histogram, from which the first-bin data are scaled to compute the output sample of the filter. Finally, signal filtering experiments using FIR mean filters are conducted to demonstrate the effectiveness of the proposed quantum computation approach.

DOI
10.3390/engproc2026134004

Related papers

An Implementation Method of Digital FIR Filter Using Quantum State Preparation Circuit

Chien‐Cheng Tseng, Su‐Ling Lee

Digital finite-impulse-response (FIR) filters are a cornerstone of digital signal processing (DSP) and modern communication systems, making their implementation via quantum computation a compelling area of study. Although recent methods have used orthogonal triangular decomposition (OTD) to realize FIR filters through quantum elementary gates, these approaches rely heavily on matrix QR decomposition and IBM Qiskit's transpilation tools, resulting in significant computational overhead. To address these inefficiencies, this paper proposes a new implementation using quantum state preparation (QSP) circuits. By employing only rotation y gate and multi-controlled rotation y gates, the proposed method determines circuit parameters through closed-form solutions derived directly from the input signal and filter coefficient vectors. Experimental results for a digital mean filter demonstrate the effectiveness of this QSP-based approach, showing the reduced implementation complexity compared to the conventional OTD method.

IEEE VTS Asia Pacific Wireless Communications Symposium (APWCS)•Aug 1, 2026•0 citations

Implementing Finite Impulse Response Filters on Quantum Computers

Aishwarya Majumdar, Bojko Bakalov, Dror Baron +1 more

While signal processing is a mature area, its connections with quantum computing have received less attention. In this work, we propose approaches that perform classical discrete-time signal processing using quantum systems. Our approaches encode the classical discrete-time input signal into quantum states, and design unitaries to realize classical concepts of finite impulse response (FIR) filters. We also develop strategies to cascade lower-order filters to realize higher-order filters through designing appropriate unitary operators. Finally, a few directions for processing quantum states on classical systems after converting them to classical signals are suggested for future work.

arXiv:2501.10166•IEEE International Conference on Acoustics Speech and Signal Processing•Mar 12, 2025•1 citation

State-Space-Based FIR Filtering on a Quantum Computer

Roope Salmi, Davide Rocchesso, Vesa Välimäki

Many signal processing tasks require intensive computations. Quantum computing promises to accelerate certain tasks, but algorithms must be designed around the limitations of quantum mechanics. This paper provides a quantum implementation of finite impulse response (FIR) filters, which are a widely used tool in classical signal processing. The filter can be parallelized and composed as part of larger quantum algorithms, with potential for speedups using quantum amplitude estimation and future fault-tolerant quantum hardware. To accomplish these properties, we introduce a state-space framework wherein sample-based signal processing is performed with unitary quantum circuits. We present the quantum delay gate as the quantum analog of the delay line in discrete-time signal processing. Unitary circuits intrinsically describe lossless systems, but we also implement lowpass and other bounded filters by emulating a projection operator. The FIR filter implementation is tested and demonstrated with a quantum circuit simulator.

eess.ASCross-listedarXiv:2609.20331•Sep 18, 2026•0 citations

A Quantum Computation Method for the Graph Fourier Transform of Graph Signals

Chien‐Cheng Tseng, Su‐Ling Lee

The graph Fourier transform (GFT) is a vital tool for processing irregular data collected across diverse structured systems, including sensor, social, transportation, and brain networks. Given its wide utility in graph signal applications like compression, prediction, classification, denoising, detection, and estimation, developing efficient methods for computing the GFT over graphs and networks is a crucial task. This paper presents a quantum computation method for calculating the GFT of a graph signal, executed through five main steps: (1) The graph signal is first normalized to a unit norm during preprocessing. (2) A quantum state preparation circuit loads this unit-norm data into a quantum register, generating a superposition state. (3) The quantum circuit representing the unitary GFT matrix is obtained using the IBM Qiskit transpiler, which is then applied to transform the vertex-domain data into the spectral domain. (4) Repeated quantum measurements are performed to generate a histogram that encodes the spectral-domain data. (5) Finally, the histogram's probability data is scaled by the original input signal's norm to yield the complete GFT result. The effectiveness of this proposed quantum method is demonstrated through the GFT computation of temperature data from a sensor network.

International Conference on Quantum Communications, Networking, and Computing (QCNC)•Apr 6, 2026•0 citations

Hybrid Quantum-Classical Algorithm for Digital Filter Design: Bridging NISQ Optimisation

Lubna Siddiqui, Ashish Mani, Jaspal Singh

In this paper, a novel Hybrid Quantum-Classical Adaptive Rotation and Quantum Walk (HQC-ARQW) algorithm is introduced for optimal design of the Finite Impulse Response (FIR) digital filters. To bridge the gap between the conventional optimisation methods and move into modern times, the proposed framework uses a mixture of quantum-inspired operators with classical genetic algorithms that efficiently handle the complexity of high-dimensional coefficient spaces. The HQC-ARQW algorithm uses adaptive quantum rotation gates with dynamic angle$(\theta \in[0.15 \pi, 0.50 \pi])$for population evolution and quantum walk local search for fine-grained solution refinement. The quantum walk operator empowers adaptive step-size annealing$\left(\alpha_{0}=0.08, T=30\right.{}$steps). Supported on Qiskit's AerSimulator to validate implementations are practically feasible on the near-term quantum hardware. Experimental results on filter orders 9 and 11 show significant performance improvement over the classical GA. The HQC-ARQW provides a 50%-55% reduction in magnitude MSE and more than 2-fold faster convergence to optimum solutions obtained in 25 generations as opposed to 100 generations for the classical approaches. Our results demonstrate the HQCARQW algorithm as a promising solution for computationally demanding optimisation tasks in digital signal processing.

International Conference on Emerging Technologies in Computer Engineering: Machine Learning and Internet of Things (ICETCE)•Nov 21, 2025•0 citations

Velocity Filtering Using Quantum 3D FFT

Γεωργία Κούκιου, V. Anastassopoulos

In this work, the quantum version of 3D FFT is proposed for constructing velocity filters. Velocity filters are desirable when we need to separate moving objects with a specific velocity range in amplitude and direction in a rapidly changing background. These filters are useful in many application fields, such as for monitoring regions for security reasons or inspecting processes in experimental physics. A faster and more attractive way to implement this filtering procedure is through 3D FFT instead of using 3D FIR filters. Additionally, 3D FFT provides the capability to create banks of ready-made filters with various characteristics. Thus, 3D filtering is carried out in the frequency domain by rejecting appropriate frequency bands according to the spectral content of the trajectory of the object to be isolated. The 3D FFT procedure and the corresponding inverse one are required in the beginning and end of the filtering process. Although 3D FFT is computationally effective, it becomes time-consuming when we need to process large data cubes. The implementation of velocity filters by means of the quantum version of 3D FFT is investigated in this work. All necessary quantum circuits and quantum procedures needed are presented in detail. This proposed quantum structure results in velocity filtering with a short execution time. For this purpose, a review of the necessary quantum computational units is presented for the implementation of quantum 3D FFT and representative examples of applications of velocity filtering are provided.

Photonics•Apr 22, 2023•3 citations
In digital signal processing, the finite impulse response (FIR) filter is a fundamental tool for processing discrete-time signals. This paper explores the implementation of FIR filters using quantum computation methods. In this study, a quantum circuit for the FIR filter is designed using a normalized filter coefficient vector, orthogonal triangular decomposition commonly known as QR decomposition, and the transpilation tools provided by IBM’s software Qiskit SDK V2.3. Then, each block of the input signal is normalized to a unit-norm vector, loaded into a quantum register, and processed by the FIR filter quantum circuit to produce an output state. Quantum measurement is then performed on the output state to obtain a histogram, from which the first-bin data are scaled to compute the output sample of the filter. Finally, signal filtering experiments using FIR mean filters are conducted to demonstrate the effectiveness of the proposed quantum computation approach.
Digital finite-impulse-response (FIR) filters are a cornerstone of digital signal processing (DSP) and modern communication systems, making their implementation via quantum computation a compelling area of study. Although recent methods have used orthogonal triangular decomposition (OTD) to realize FIR filters through quantum elementary gates, these approaches rely heavily on matrix QR decomposition and IBM Qiskit's transpilation tools, resulting in significant computational overhead. To address these inefficiencies, this paper proposes a new implementation using quantum state preparation (QSP) circuits. By employing only rotation y gate and multi-controlled rotation y gates, the proposed method determines circuit parameters through closed-form solutions derived directly from the input signal and filter coefficient vectors. Experimental results for a digital mean filter demonstrate the effectiveness of this QSP-based approach, showing the reduced implementation complexity compared to the conventional OTD method.
While signal processing is a mature area, its connections with quantum computing have received less attention. In this work, we propose approaches that perform classical discrete-time signal processing using quantum systems. Our approaches encode the classical discrete-time input signal into quantum states, and design unitaries to realize classical concepts of finite impulse response (FIR) filters. We also develop strategies to cascade lower-order filters to realize higher-order filters through designing appropriate unitary operators. Finally, a few directions for processing quantum states on classical systems after converting them to classical signals are suggested for future work.
Many signal processing tasks require intensive computations. Quantum computing promises to accelerate certain tasks, but algorithms must be designed around the limitations of quantum mechanics. This paper provides a quantum implementation of finite impulse response (FIR) filters, which are a widely used tool in classical signal processing. The filter can be parallelized and composed as part of larger quantum algorithms, with potential for speedups using quantum amplitude estimation and future fault-tolerant quantum hardware. To accomplish these properties, we introduce a state-space framework wherein sample-based signal processing is performed with unitary quantum circuits. We present the quantum delay gate as the quantum analog of the delay line in discrete-time signal processing. Unitary circuits intrinsically describe lossless systems, but we also implement lowpass and other bounded filters by emulating a projection operator. The FIR filter implementation is tested and demonstrated with a quantum circuit simulator.
The graph Fourier transform (GFT) is a vital tool for processing irregular data collected across diverse structured systems, including sensor, social, transportation, and brain networks. Given its wide utility in graph signal applications like compression, prediction, classification, denoising, detection, and estimation, developing efficient methods for computing the GFT over graphs and networks is a crucial task. This paper presents a quantum computation method for calculating the GFT of a graph signal, executed through five main steps: (1) The graph signal is first normalized to a unit norm during preprocessing. (2) A quantum state preparation circuit loads this unit-norm data into a quantum register, generating a superposition state. (3) The quantum circuit representing the unitary GFT matrix is obtained using the IBM Qiskit transpiler, which is then applied to transform the vertex-domain data into the spectral domain. (4) Repeated quantum measurements are performed to generate a histogram that encodes the spectral-domain data. (5) Finally, the histogram's probability data is scaled by the original input signal's norm to yield the complete GFT result. The effectiveness of this proposed quantum method is demonstrated through the GFT computation of temperature data from a sensor network.
In this paper, a novel Hybrid Quantum-Classical Adaptive Rotation and Quantum Walk (HQC-ARQW) algorithm is introduced for optimal design of the Finite Impulse Response (FIR) digital filters. To bridge the gap between the conventional optimisation methods and move into modern times, the proposed framework uses a mixture of quantum-inspired operators with classical genetic algorithms that efficiently handle the complexity of high-dimensional coefficient spaces. The HQC-ARQW algorithm uses adaptive quantum rotation gates with dynamic angle(θ∈[0.15π,0.50π])(\theta \in[0.15 \pi, 0.50 \pi])(θ∈[0.15π,0.50π])for population evolution and quantum walk local search for fine-grained solution refinement. The quantum walk operator empowers adaptive step-size annealing(α0=0.08,T=30\left(\alpha_{0}=0.08, T=30\right.{}(α0​=0.08,T=30steps). Supported on Qiskit's AerSimulator to validate implementations are practically feasible on the near-term quantum hardware. Experimental results on filter orders 9 and 11 show significant performance improvement over the classical GA. The HQC-ARQW provides a 50%-55% reduction in magnitude MSE and more than 2-fold faster convergence to optimum solutions obtained in 25 generations as opposed to 100 generations for the classical approaches. Our results demonstrate the HQCARQW algorithm as a promising solution for computationally demanding optimisation tasks in digital signal processing.
In this work, the quantum version of 3D FFT is proposed for constructing velocity filters. Velocity filters are desirable when we need to separate moving objects with a specific velocity range in amplitude and direction in a rapidly changing background. These filters are useful in many application fields, such as for monitoring regions for security reasons or inspecting processes in experimental physics. A faster and more attractive way to implement this filtering procedure is through 3D FFT instead of using 3D FIR filters. Additionally, 3D FFT provides the capability to create banks of ready-made filters with various characteristics. Thus, 3D filtering is carried out in the frequency domain by rejecting appropriate frequency bands according to the spectral content of the trajectory of the object to be isolated. The 3D FFT procedure and the corresponding inverse one are required in the beginning and end of the filtering process. Although 3D FFT is computationally effective, it becomes time-consuming when we need to process large data cubes. The implementation of velocity filters by means of the quantum version of 3D FFT is investigated in this work. All necessary quantum circuits and quantum procedures needed are presented in detail. This proposed quantum structure results in velocity filtering with a short execution time. For this purpose, a review of the necessary quantum computational units is presented for the implementation of quantum 3D FFT and representative examples of applications of velocity filtering are provided.