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:2609.20331

State-Space-Based FIR Filtering on a Quantum Computer

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

eess.AScs.SDeess.SPquant-phSubmitted Sep 17, 2026• Announced Sep 18, 2026• 0 citations
arXivHTMLPDF

Abstract

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.

AI Summary

The paper asks how sample-by-sample linear filtering can be implemented coherently on a quantum computer and composed with subsequent processing without intermediate measurement. Signals are amplitude-encoded, while input/output amplitudes and persistent system-state variables occupy orthogonal subspaces. A unitary state-space realization processes each sample, with transpositions routing samples between the signal buffer and processing subspace. The construction implements delays as cyclic permutations and emulates a projection by moving unwanted amplitudes into a delay buffer of length $p$. This reproduces discarding over at most $p$ processing steps, using resources logarithmic in $p$ for the delay. Bounded real FIR filters, satisfying $|H(e^{i\omega})|\leq1$, are implemented through a classical lossless lattice decomposition into rotations and unit delays. An order-$M$ filter uses $M+1$ rotation parameters, obtained from the desired response and a power-complementary filter through spectral factorization and recursive reduction. Additional registers allow the same circuit to process multiple amplitude-encoded signals in superposition. A Qiskit simulation filters two $N=32$ signals with an order-$12$ lowpass filter, using projection delay $p=32$. The transpiled circuit contains 59,292 gates and has depth 38,387; signed output amplitudes are estimated with 1,024-shot Hadamard tests. No quantum amplitude estimation is demonstrated. The paper notes that arbitrary input preparation costs $\mathcal{O}(N)$ gates, circuit length grows with the number of processed samples, and these depths require fault-tolerant hardware. The presented filter uses real coefficients and requires a power complement. Speedups from parallel processing and amplitude estimation are prospective rather than established end-to-end.

No sign of AI-generated textIncrementalOverclaimsMissing comparison

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
Submitted to ICASSP 2027

Related papers

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

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

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

Signal-based classical emulation of a universal quantum computer

Brian R. La Cour, Granville E. Ott

In this paper we present a novel approach to emulating a universal quantum computer with a classical system, one that uses a signal of bounded duration and amplitude to represent an arbitrary quantum state. The signal may be of any modality (e.g., acoustic, electromagnetic, etc), but we focus our discussion here on electronic signals. Unitary gate operations are performed using analog electronic circuit devices, such as four-quadrant multipliers, operational amplifiers, and analog filters, although non-unitary operations may be performed as well. In this manner, the Hilbert space structure of the quantum state, as well as a universal set of gate operations, may be fully emulated classically. The required bandwidth scales exponentially with the number of qubits, however, thereby limiting the scalability of the approach, but the intrinsic parallelism, ease of construction, and classical robustness to decoherence may nevertheless lead to capabilities and efficiencies rivaling that of current high performance computers.

arXiv:2104.12027•New Journal of Physics•May 13, 2015•34 citations

Classifying Phase-Only DSP Filters as QFT-Diagonal Quantum Operators

Alan Jobil Skaria Skaria

This paper presents a theoretical classification framework for phase-only digital signal processing filters interpreted as Quantum Fourier Transform diagonal quantum operators. It builds on an earlier DSP-to-QFT filtering framework and focuses on identifying which DSP-inspired filter responses can be directly implemented as valid quantum operations.The main result is that only phase-only sampled filter responses are directly compatible with unitary quantum gates. This means that ordinary magnitude-changing filters, such as classical low-pass or high-pass filters, cannot be implemented directly as quantum gates without additional methods such as ancilla systems, block encoding, post-selection, or unitary dilation.The paper connects the framework to circulant operator theory, showing that direct QFT-diagonal quantum filters correspond to circulant unitary operators. This gives the framework a clearer mathematical foundation and separates valid unitary quantum filters from non-unitary classical filtering operations.Several structured examples are analysed, including delay filters, linear phase filters, polynomial phase filters, and chirp-like filters. Delay filters are shown to produce cyclic shifts in the computational basis, making them useful as simple building blocks for modular shifts and quantum-walk-style operations. The paper also discusses how structured phase filters can have compact descriptions, while arbitrary phase filters may require exponentially many parameters.The central design principle is that direct QFT-diagonal quantum filters must be phase-only, while practical or efficient implementations require compact phase structure. The paper does not claim a new quantum speedup, but instead provides a DSP-inspired classification and design perspective for valid unitary QFT-diagonal quantum filters.

•Oct 9, 2026•0 citations

Parallel Quantum Computing Emulation

Brian R. La Cour, S. Andrew Lanham, Corey I. Ostrove

Quantum computers provide a fundamentally new computing paradigm that promises to revolutionize our ability to solve broad classes of problems. Surprisingly, the basic mathematical structures of gate-based quantum computing, such as unitary operations on a finite-dimensional Hilbert space, are not unique to quantum systems but may be found in certain classical systems as well. Previously, it has been shown that one can represent an arbitrary multi-qubit quantum state in terms of classical analog signals using nested quadrature amplitude modulated signals. Furthermore, using digitally controlled analog electronics one may manipulate these signals to perform quantum gate operations and thereby execute quantum algorithms. The computational capacity of a single signal is, however, limited by the required bandwidth, which scales exponentially with the number of qubits when represented using frequency-based encoding. To overcome this limitation, we introduce a method to extend this approach to multiple parallel signals. Doing so allows a larger quantum state to be emulated with the same gate time required for processing frequency-encoded signals. In the proposed representation, each doubling of the number of signals corresponds to an additional qubit in the spatial domain. Single quit gate operations are similarly extended so as to operate on qubits represented using either frequency-based or spatial encoding schemes. Furthermore, we describe a method to perform gate operations between pairs of qubits represented using frequency or spatial encoding or between frequency-based and spatially encoded qubits. Finally, we describe how this approach may be extended to represent qubits in the time domain as well.

arXiv:1908.06445•IEEE International Conference on Rebooting Computing (ICRC)•Nov 1, 2018•5 citations
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 paper asks how sample-by-sample linear filtering can be implemented coherently on a quantum computer and composed with subsequent processing without intermediate measurement. Signals are amplitude-encoded, while input/output amplitudes and persistent system-state variables occupy orthogonal subspaces. A unitary state-space realization processes each sample, with transpositions routing samples between the signal buffer and processing subspace.
The construction implements delays as cyclic permutations and emulates a projection by moving unwanted amplitudes into a delay buffer of length ppp. This reproduces discarding over at most ppp processing steps, using resources logarithmic in ppp for the delay. Bounded real FIR filters, satisfying ∣H(eiω)∣≤1|H(e^{i\omega})|\leq1∣H(eiω)∣≤1, are implemented through a classical lossless lattice decomposition into rotations and unit delays. An order-MMM filter uses M+1M+1M+1 rotation parameters, obtained from the desired response and a power-complementary filter through spectral factorization and recursive reduction. Additional registers allow the same circuit to process multiple amplitude-encoded signals in superposition.
A Qiskit simulation filters two N=32N=32N=32 signals with an order-121212 lowpass filter, using projection delay p=32p=32p=32. The transpiled circuit contains 59,292 gates and has depth 38,387; signed output amplitudes are estimated with 1,024-shot Hadamard tests. No quantum amplitude estimation is demonstrated.
The paper notes that arbitrary input preparation costs O(N)\mathcal{O}(N)O(N) gates, circuit length grows with the number of processed samples, and these depths require fault-tolerant hardware. The presented filter uses real coefficients and requires a power complement. Speedups from parallel processing and amplitude estimation are prospective rather than established end-to-end.
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.
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.
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.
In this paper we present a novel approach to emulating a universal quantum computer with a classical system, one that uses a signal of bounded duration and amplitude to represent an arbitrary quantum state. The signal may be of any modality (e.g., acoustic, electromagnetic, etc), but we focus our discussion here on electronic signals. Unitary gate operations are performed using analog electronic circuit devices, such as four-quadrant multipliers, operational amplifiers, and analog filters, although non-unitary operations may be performed as well. In this manner, the Hilbert space structure of the quantum state, as well as a universal set of gate operations, may be fully emulated classically. The required bandwidth scales exponentially with the number of qubits, however, thereby limiting the scalability of the approach, but the intrinsic parallelism, ease of construction, and classical robustness to decoherence may nevertheless lead to capabilities and efficiencies rivaling that of current high performance computers.
This paper presents a theoretical classification framework for phase-only digital signal processing filters interpreted as Quantum Fourier Transform diagonal quantum operators. It builds on an earlier DSP-to-QFT filtering framework and focuses on identifying which DSP-inspired filter responses can be directly implemented as valid quantum operations.The main result is that only phase-only sampled filter responses are directly compatible with unitary quantum gates. This means that ordinary magnitude-changing filters, such as classical low-pass or high-pass filters, cannot be implemented directly as quantum gates without additional methods such as ancilla systems, block encoding, post-selection, or unitary dilation.The paper connects the framework to circulant operator theory, showing that direct QFT-diagonal quantum filters correspond to circulant unitary operators. This gives the framework a clearer mathematical foundation and separates valid unitary quantum filters from non-unitary classical filtering operations.Several structured examples are analysed, including delay filters, linear phase filters, polynomial phase filters, and chirp-like filters. Delay filters are shown to produce cyclic shifts in the computational basis, making them useful as simple building blocks for modular shifts and quantum-walk-style operations. The paper also discusses how structured phase filters can have compact descriptions, while arbitrary phase filters may require exponentially many parameters.The central design principle is that direct QFT-diagonal quantum filters must be phase-only, while practical or efficient implementations require compact phase structure. The paper does not claim a new quantum speedup, but instead provides a DSP-inspired classification and design perspective for valid unitary QFT-diagonal quantum filters.
Quantum computers provide a fundamentally new computing paradigm that promises to revolutionize our ability to solve broad classes of problems. Surprisingly, the basic mathematical structures of gate-based quantum computing, such as unitary operations on a finite-dimensional Hilbert space, are not unique to quantum systems but may be found in certain classical systems as well. Previously, it has been shown that one can represent an arbitrary multi-qubit quantum state in terms of classical analog signals using nested quadrature amplitude modulated signals. Furthermore, using digitally controlled analog electronics one may manipulate these signals to perform quantum gate operations and thereby execute quantum algorithms. The computational capacity of a single signal is, however, limited by the required bandwidth, which scales exponentially with the number of qubits when represented using frequency-based encoding. To overcome this limitation, we introduce a method to extend this approach to multiple parallel signals. Doing so allows a larger quantum state to be emulated with the same gate time required for processing frequency-encoded signals. In the proposed representation, each doubling of the number of signals corresponds to an additional qubit in the spatial domain. Single quit gate operations are similarly extended so as to operate on qubits represented using either frequency-based or spatial encoding schemes. Furthermore, we describe a method to perform gate operations between pairs of qubits represented using frequency or spatial encoding or between frequency-based and spatially encoded qubits. Finally, we describe how this approach may be extended to represent qubits in the time domain as well.