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 VTS Asia Pacific Wireless Communications Symposium (APWCS)

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

Chien‐Cheng Tseng, Su‐Ling Lee

Published Aug 1, 2026• 0 citations
Publisher

Abstract

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.

DOI
10.1109/apwcs71511.2026.11742607

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

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 State Preparation Method Based on Gram-Schmidt Decomposition

Su‐Ling Lee, Chien‐Cheng Tseng

Quantum state preparation (QSP) refers to the process of initializing a quantum circuit into a specific quantum state, which serves as the starting point for several quantum algorithms. In this article, a Gram-Schmidt decomposition (GSD) method is proposed to address the QSP problem. The method involves the following five steps: First, the first column vector of the identity matrix is replaced with the unit-norm data vector to construct an initial matrix. Second, the initial matrix is decomposed into the product of a unitary matrix and an upper triangular matrix using the GSD method. Third, the transpile tool from IBM Qiskit is employed to design a quantum circuit, ensuring that the input and output state vectors correspond to the relationship defined by the obtained unitary matrix. Fourth, when the input state vector of the quantum circuit is set as the zero vector, the output state vector corresponds to the desired data vector to be prepared. Finally, a numerical example using the Iris flower dataset is provided to demonstrate the effectiveness of the proposed method.

IEEE International Conference on Consumer Electronics - Taiwan (ICCE-Taiwan)•Jul 16, 2025•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

Hermitian Matrix Function Synthesis without Block-Encoding

Anuradha Mahasinghe, Kaushika De Silva, Xavier Cadet +3 more

Implementing polynomial functions of Hermitian matrices on quantum hardware is a foundational task in quantum computing, critical for accurate Hamiltonian simulation, quantum linear system solving, high-fidelity state preparation, machine learning kernels, and other advanced quantum algorithms. Existing state-of-the-art techniques, including Qubitization, Quantum Singular Value Transformation (QSVT), and Quantum Signal Processing (QSP), rely heavily on block-encoding the Hermitian matrix. These methods are often constrained by the complexity of preparing the block-encoded state, the overhead associated with the required ancillary qubits, or the challenging problem of angle synthesis for the polynomial's phase factors, which limits the achievable circuit depth and overall efficiency. In this work, we propose a novel and resource-efficient approach to implement arbitrary polynomials of a Hermitian matrix by leveraging the Generalized Quantum Signal Processing (GQSP) framework. Our method circumvents the need for block-encoding and avoids the compounding post-selection overheads characteristic of LCU-based constructions, achieving a stable, degree-independent success probability. We derive closed-form expressions for symmetric polynomial expansions and demonstrate how linear combinations of GQSP circuits can realize the desired transformation. This approach reduces resource overhead and opens new pathways for quantum algorithm design for functions of Hermitian matrices, particularly in settings where the Hermitian operator arises naturally from symmetric combinations of unitaries.

quant-pharXiv:2512.18249•Dec 23, 2025•2 citations
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 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.
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.
Quantum state preparation (QSP) refers to the process of initializing a quantum circuit into a specific quantum state, which serves as the starting point for several quantum algorithms. In this article, a Gram-Schmidt decomposition (GSD) method is proposed to address the QSP problem. The method involves the following five steps: First, the first column vector of the identity matrix is replaced with the unit-norm data vector to construct an initial matrix. Second, the initial matrix is decomposed into the product of a unitary matrix and an upper triangular matrix using the GSD method. Third, the transpile tool from IBM Qiskit is employed to design a quantum circuit, ensuring that the input and output state vectors correspond to the relationship defined by the obtained unitary matrix. Fourth, when the input state vector of the quantum circuit is set as the zero vector, the output state vector corresponds to the desired data vector to be prepared. Finally, a numerical example using the Iris flower dataset is provided to demonstrate the effectiveness of the proposed method.
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.
Implementing polynomial functions of Hermitian matrices on quantum hardware is a foundational task in quantum computing, critical for accurate Hamiltonian simulation, quantum linear system solving, high-fidelity state preparation, machine learning kernels, and other advanced quantum algorithms. Existing state-of-the-art techniques, including Qubitization, Quantum Singular Value Transformation (QSVT), and Quantum Signal Processing (QSP), rely heavily on block-encoding the Hermitian matrix. These methods are often constrained by the complexity of preparing the block-encoded state, the overhead associated with the required ancillary qubits, or the challenging problem of angle synthesis for the polynomial's phase factors, which limits the achievable circuit depth and overall efficiency. In this work, we propose a novel and resource-efficient approach to implement arbitrary polynomials of a Hermitian matrix by leveraging the Generalized Quantum Signal Processing (GQSP) framework. Our method circumvents the need for block-encoding and avoids the compounding post-selection overheads characteristic of LCU-based constructions, achieving a stable, degree-independent success probability. We derive closed-form expressions for symmetric polynomial expansions and demonstrate how linear combinations of GQSP circuits can realize the desired transformation. This approach reduces resource overhead and opens new pathways for quantum algorithm design for functions of Hermitian matrices, particularly in settings where the Hermitian operator arises naturally from symmetric combinations of unitaries.