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:2501.10166 · IEEE International Conference on Acoustics Speech and Signal Processing

Implementing Finite Impulse Response Filters on Quantum Computers

Aishwarya Majumdar, Bojko Bakalov, Dror Baron, Yuan Liu

Published Mar 12, 2025• 1 citation
arXivHTMLPDF

Abstract

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.

DOI
10.1109/icassp49660.2025.10887919

Related papers

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

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

Chien‐Cheng Tseng, Su‐Ling Lee

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.

IEEE Eurasia Conference on IOT, Communication and Engineering (ECICE)•Mar 27, 2026•1 citation

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

Quantum signal processing by single-qubit dynamics

Guang Hao Low

Quantum computation is the most powerful realizable model of computation, and is uniquely positioned to solve specialized problems intractable to classical computers. This quantum advantage arises from directly exploiting the strangeness of quantum mechanics that is fundamental to reality. As such, one expects our understanding of quantum processes in physical systems to be indispensable to the design and execution of quantum algorithms. We present quantum signal processing, which exploits the dynamics of simple quantum systems to perform non-trivial computations. Such systems applied as computational modules in larger quantum algorithms, offer a natural physical alternative to standard tasks such as the calculation of elementary functions with integer arithmetic. The quantum advantage of this approach, based on simple physics, is of significant practical relevance. In cases, arbitrary bits of precision may be emulated using only constant space. Moreover, the simplicity and performance of quantum signal processing is such that it is the final missing ingredient for realizing a number of optimal quantum algorithms, particularly in Hamiltonian simulation. Quantum signal processing realizes a useful fusion of analog and digital models of quantum computation. At the physical level, we focus on how even a simple two-level system - the qubit, computes through optimal discrete-time quantum control. Whereas quantum control is typically used to synthesize unitary quantum gates, we solve the synthesis problem of unitary quantum functions with a fully characterization of achievable functions, and efficient techniques for their implementation. This furnishes a surprisingly rich framework in the analog model of quantum computation for computing functions. The generality of this model is realized by many applications, often with no modification, to quantum algorithms designed for digital quantum computers, in particular for matrix manipulation. In this manner, we solve a number of open problem related to optimal amplitude amplification algorithms, optimally computing on matrices with a quantum computer, and the simulation of physical systems.

•Jan 1, 2017•7 citations

Quantum computing and a unified approach to fast unitary transforms

Sos С. Agaian, Andreas Klappenecker

A quantum computer directly manipulates information stored in the state of quantum mechanical systems. The available operations have many attractive features but also underly severe restrictions, which complicate the design of quantum algorithms. We present a divide-and-conquer approach to the design of various quantum algorithms. The class of algorithm includes many transforms which are well-known in classical signal processing applications. We show how fast quantum algorithms can be derived for the discrete Fourier transform, the Walsh-Hadamard transform, the Slant transform, and the Hartley transform. All these algorithms use at most O(log^2 N) operations to transform a state vector of a quantum computer of length N.

arXiv:quant-ph/0201120•Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•May 23, 2002•6 citations

Toward Mixed Analog-Digital Quantum Signal Processing: Quantum AD/DA Conversion and the Fourier Transform

Yuan Liu, John M. Martyn, Jasmine Sinanan-Singh +3 more

Signal processing stands as a pillar of classical computation and modern information technology, applicable to both analog and digital signals. Recently, advancements in quantum information science have suggested that quantum signal processing (QSP) can enable more powerful signal processing capabilities. However, the developments in QSP have primarily leverageddigitalquantum resources, such as discrete-variable (DV) systems like qubits, rather thananalogquantum resources, such as continuous-variable (CV) systems like quantum oscillators. Consequently, there remains a gap in understanding how signal processing can be performed on hybrid CV-DV quantum computers. Here we address this gap by developing a new paradigm of mixed analog-digital QSP. We demonstrate the utility of this paradigm by showcasing how it naturally enables analog-digital conversion of quantum signals— specifically, the transfer of states between DV and CV quantum systems. We then show that such quantum analog-digital conversion enables new implementations of quantum algorithms on CV-DV hardware. This is exemplified by realizing the quantum Fourier transform of a state encoded on qubits via the free-evolution of a quantum oscillator, albeit with a runtime exponential in the number of qubits due to information theoretic arguments. Collectively, this work marks a significant step forward in hybrid CV-DV quantum computation, providing a foundation for scalable analog-digital signal processing on quantum processors.

arXiv:2408.14729•IEEE Transactions on Signal Processing•Jan 1, 2025•23 citations
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.
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.
Quantum computation is the most powerful realizable model of computation, and is uniquely positioned to solve specialized problems intractable to classical computers. This quantum advantage arises from directly exploiting the strangeness of quantum mechanics that is fundamental to reality. As such, one expects our understanding of quantum processes in physical systems to be indispensable to the design and execution of quantum algorithms. We present quantum signal processing, which exploits the dynamics of simple quantum systems to perform non-trivial computations. Such systems applied as computational modules in larger quantum algorithms, offer a natural physical alternative to standard tasks such as the calculation of elementary functions with integer arithmetic. The quantum advantage of this approach, based on simple physics, is of significant practical relevance. In cases, arbitrary bits of precision may be emulated using only constant space. Moreover, the simplicity and performance of quantum signal processing is such that it is the final missing ingredient for realizing a number of optimal quantum algorithms, particularly in Hamiltonian simulation. Quantum signal processing realizes a useful fusion of analog and digital models of quantum computation. At the physical level, we focus on how even a simple two-level system - the qubit, computes through optimal discrete-time quantum control. Whereas quantum control is typically used to synthesize unitary quantum gates, we solve the synthesis problem of unitary quantum functions with a fully characterization of achievable functions, and efficient techniques for their implementation. This furnishes a surprisingly rich framework in the analog model of quantum computation for computing functions. The generality of this model is realized by many applications, often with no modification, to quantum algorithms designed for digital quantum computers, in particular for matrix manipulation. In this manner, we solve a number of open problem related to optimal amplitude amplification algorithms, optimally computing on matrices with a quantum computer, and the simulation of physical systems.
A quantum computer directly manipulates information stored in the state of quantum mechanical systems. The available operations have many attractive features but also underly severe restrictions, which complicate the design of quantum algorithms. We present a divide-and-conquer approach to the design of various quantum algorithms. The class of algorithm includes many transforms which are well-known in classical signal processing applications. We show how fast quantum algorithms can be derived for the discrete Fourier transform, the Walsh-Hadamard transform, the Slant transform, and the Hartley transform. All these algorithms use at most O(log^2 N) operations to transform a state vector of a quantum computer of length N.
Signal processing stands as a pillar of classical computation and modern information technology, applicable to both analog and digital signals. Recently, advancements in quantum information science have suggested that quantum signal processing (QSP) can enable more powerful signal processing capabilities. However, the developments in QSP have primarily leverageddigitalquantum resources, such as discrete-variable (DV) systems like qubits, rather thananalogquantum resources, such as continuous-variable (CV) systems like quantum oscillators. Consequently, there remains a gap in understanding how signal processing can be performed on hybrid CV-DV quantum computers. Here we address this gap by developing a new paradigm of mixed analog-digital QSP. We demonstrate the utility of this paradigm by showcasing how it naturally enables analog-digital conversion of quantum signals— specifically, the transfer of states between DV and CV quantum systems. We then show that such quantum analog-digital conversion enables new implementations of quantum algorithms on CV-DV hardware. This is exemplified by realizing the quantum Fourier transform of a state encoded on qubits via the free-evolution of a quantum oscillator, albeit with a runtime exponential in the number of qubits due to information theoretic arguments. Collectively, this work marks a significant step forward in hybrid CV-DV quantum computation, providing a foundation for scalable analog-digital signal processing on quantum processors.