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

IET Quantum Communication

A Generalised Transform Methodology Using Quantum Computation and Its Application for Electrocardiogram (ECG) Classification

Bidisha Dhara, Monika Agrawal, Sumantra Dutta Roy

Published Jan 1, 2025• 4 citations
Publisher

Abstract

ABSTRACT Transforms play a pivotal role in the study of signals and images. With the advent of quantum systems, analysing signals in the quantum domain is of particular interest. In this work, we aim to build a generalised transform circuit in the quantum domain. We have shown the working of this circuit for Wavelet transform, Fourier transform, and Discrete Cosine Transform (DCT) on vector, matrix, and an image respectively. We also take inverse transforms in each of the cases to match with the given initial input. We use simulators for this work, and the results obtained are favourable. We further use this circuit for classification of heart beats as it is an essential task in detection of cardiac diseases. We utilise both classical and quantum computation to classify beats of Electrocardiogram (ECG, hereafter) signals into normal and not‐normal beats (non‐beats and abnormal beats). This novel architecture to carry out transform is quite general and can be used for any arbitrary transform.

DOI
10.1049/qtc2.70012

Related papers

Performance Evaluation of Quantum-Based Machine Learning Algorithms for Cardiac Arrhythmia Classification

Zeynep Özpolat, Murat Karabatak

The electrocardiogram (ECG) is the most common technique used to diagnose heart diseases. The electrical signals produced by the heart are recorded by chest electrodes and by the extremity electrodes placed on the limbs. Many diseases, such as arrhythmia, cardiomyopathy, coronary heart disease, and heart failure, can be diagnosed by examining ECG signals. The interpretation of these signals by experts may take a long time, and there may be differences between expert interpretations. Since technological developments are intertwined with the medical sciences, computer-assisted diagnostic methods have recently come forward. In computer science, machine learning techniques are often preferred for automatic detection. Quantum-based structures have emerged to increase the machine learning algorithm's speed and classification performance. In this study, a quantum-based machine learning algorithm is applied to classify heart rhythms. The ECG properties were converted to qubit structure using principal component analysis (PCA). The resulting qubits are classified using the quantum support vector machine (QSVM) algorithm. Quantum computer simulation over Qiskit was used for classification studies. Within the scope of experimental studies, comparisons between classical SVM and QSVM were made using different data amounts and qubit numbers. In the results of the analysis, classical SVM achieved 86.96% accuracy, and QSVM achieved 84.64% accuracy. Despite the fact that the entire dataset was not used due to various limitations, these successful performances were achieved. Classification of medical data such as that from ECG has shown that quantum-based machine learning frameworks perform well despite current resource constraints. In this respect, the study includes essential contributions to the use of quantum-based machine learning methods on signal data in medicine.

Diagnostics•Mar 14, 2023•73 citations

Quantum Fourier Transform Based Electro Cardio Gram Signal Denoising

Battula Tirumala Krishna, Vegi Sharmila, Muthabattula Subhash +1 more

The goal of this paper is to employ the Quantum Fourier Transform (QFT) to eliminate noise from electrocardiogram (ECG) signals. Power-line interference, muscle (EMG) noise, and baseline drift are only a few of the many types of noise that frequently taint ECG results and seriously impair accurate diagnosis. Therefore, in biomedical signal processing, efficient noise removal methods are crucial. A basic quantum method that effectively converts signals from the time domain into the frequency domain is the Quantum Fourier Transform (QFT). In this research, ECG signals are analysed using QFT to find undesired noise components based on their frequency characteristics. A clearer ECG waveform is subsequently obtained by filtering out these noise components and reconstructing the signal. The suggested method shows how quantum-inspired methods might improve signal processing efficiency. QFT-based techniques are more computationally efficient than traditional techniques like the Fast Fourier Transform (FFT) and offer a viable path for future developments in quantum computing and medical signal processing.

International Conference on VLSI Circuits and Systems (ICVCS)•Jul 1, 2026•0 citations

Efficient Quantum Circuits for the Hilbert Transform

Henry Zhang, Joseph Li

The quantum Fourier transform and quantum wavelet transform have been cornerstones of quantum information processing. However, for non-stationary signals and anomaly detection, the Hilbert transform can be a more powerful tool, yet no prior work has provided efficient quantum implementations for the discrete Hilbert transform. This letter presents a novel construction for a quantum Hilbert transform in polylogarithmic size and logarithmic depth for a signal of length $N$, exponentially fewer operations than classical algorithms for the same mapping. We generalize this algorithm to create any $d$-dimensional Hilbert transform in depth $O(d\log N)$. Simulations demonstrate effectiveness for tasks such as power systems control and image processing, with exact agreement with classical results.

quant-pharXiv:2601.10876•IEEE Signal Processing Letters•Jan 19, 2026•3 citations

Quantum Convolutional Neural Networks for Cardiac Arrhythmia Detection from ECG Signals

Unaffiliated, Owen Burns, Rebekah Herrman +3 more

Electrocardiography (ECG) is a primary diagnostic tool for identifying cardiac arrhythmias, a critical indicator of heart disease. While ECG signals contain vital information about the patient’s health conditions, their high-resolution waveform nature poses significant challenges in effective feature extraction. Recent advancements in quantum computing provide a transformative opportunity to accelerate research in data-driven predictive modeling for healthcare. This paper investigates a variety of Quantum Convolutional Neural Network (QCNN) architectures for ECG signal classification. By leveraging optimized convolutional structures, adaptable pooling layers, and advanced encoding techniques, our QCNN model is designed to preserve essential ECG characteristics while addressing challenges in dimensionality reduction. Experimental results demonstrate that our approach holds significant potential for enhanced arrhythmia classification. This innovative QCNN model has the potential to advance ECG-based diagnostics for heart disease, offering valuable support for clinical decision-making in cardiac care.

IISE Annual Conference & Expo•Aug 1, 2025•0 citations

Quantum Fourier Transform of Atrial Fibrillation

Yu‐Ching Chen, Chih-Yu Chen, T. H. Huang +1 more

Electrocardiograms (ECGs) are crucial for detecting cardiac diseases like atrial fibrillation (AF). Traditional analysis methods like fast Fourier transform (FFT) face challenges with increasing data complexity. This study uses Taipei Veterans General Hospital data to explore quantum Fourier transform (QFT) for ECG analysis. Results show that QFT effectively analyzes ECG signals, matching FFT performance while benefiting from quantum computing's efficiency.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 15, 2024•1 citation

Quantum Wavelet Transforms: Fast Algorithms and Complete Circuits

Amir Fijany, Colin P. Williams

The quantum Fourier transform (QFT), a quantum analog of the classical Fourier transform, has been shown to be a powerful tool in developing quantum algorithms. However, in classical computing there is another class of unitary transforms, the wavelet transforms, which are every bit as useful as the Fourier transform. Wavelet transforms are used to expose the multi-scale structure of a signal and are likely to be useful for quantum image processing and quantum data compression. In this paper, we derive efficient, complete, quantum circuits for two representative quantum wavelet transforms, the quantum Haar and quantum Daubechies $D^{(4)}$ transforms. Our approach is to factor the operators for these transforms into direct sums, direct products and dot products of unitary matrices. In so doing, we find that permutation matrices, a particular class of unitary matrices, play a pivotal role. Surprisingly, we find that operations that are easy and inexpensive to implement classically are not always easy and inexpensive to implement quantum mechanically, and vice versa. In particular, the computational cost of performing certain permutation matrices is ignored classically because they can be avoided explicitly. However, quantum mechanically, these permutation operations must be performed explicitly and hence their cost enters into the full complexity measure of the quantum transform. We consider the particular set of permutation matrices arising in quantum wavelet transforms and develop efficient quantum circuits that implement them. This allows us to design efficient, complete quantum circuits for the quantum wavelet transform.

arXiv:quant-ph/9809004•Presented at•Sep 2, 1998•31 citations
ABSTRACT Transforms play a pivotal role in the study of signals and images. With the advent of quantum systems, analysing signals in the quantum domain is of particular interest. In this work, we aim to build a generalised transform circuit in the quantum domain. We have shown the working of this circuit for Wavelet transform, Fourier transform, and Discrete Cosine Transform (DCT) on vector, matrix, and an image respectively. We also take inverse transforms in each of the cases to match with the given initial input. We use simulators for this work, and the results obtained are favourable. We further use this circuit for classification of heart beats as it is an essential task in detection of cardiac diseases. We utilise both classical and quantum computation to classify beats of Electrocardiogram (ECG, hereafter) signals into normal and not‐normal beats (non‐beats and abnormal beats). This novel architecture to carry out transform is quite general and can be used for any arbitrary transform.
The electrocardiogram (ECG) is the most common technique used to diagnose heart diseases. The electrical signals produced by the heart are recorded by chest electrodes and by the extremity electrodes placed on the limbs. Many diseases, such as arrhythmia, cardiomyopathy, coronary heart disease, and heart failure, can be diagnosed by examining ECG signals. The interpretation of these signals by experts may take a long time, and there may be differences between expert interpretations. Since technological developments are intertwined with the medical sciences, computer-assisted diagnostic methods have recently come forward. In computer science, machine learning techniques are often preferred for automatic detection. Quantum-based structures have emerged to increase the machine learning algorithm's speed and classification performance. In this study, a quantum-based machine learning algorithm is applied to classify heart rhythms. The ECG properties were converted to qubit structure using principal component analysis (PCA). The resulting qubits are classified using the quantum support vector machine (QSVM) algorithm. Quantum computer simulation over Qiskit was used for classification studies. Within the scope of experimental studies, comparisons between classical SVM and QSVM were made using different data amounts and qubit numbers. In the results of the analysis, classical SVM achieved 86.96% accuracy, and QSVM achieved 84.64% accuracy. Despite the fact that the entire dataset was not used due to various limitations, these successful performances were achieved. Classification of medical data such as that from ECG has shown that quantum-based machine learning frameworks perform well despite current resource constraints. In this respect, the study includes essential contributions to the use of quantum-based machine learning methods on signal data in medicine.
The goal of this paper is to employ the Quantum Fourier Transform (QFT) to eliminate noise from electrocardiogram (ECG) signals. Power-line interference, muscle (EMG) noise, and baseline drift are only a few of the many types of noise that frequently taint ECG results and seriously impair accurate diagnosis. Therefore, in biomedical signal processing, efficient noise removal methods are crucial. A basic quantum method that effectively converts signals from the time domain into the frequency domain is the Quantum Fourier Transform (QFT). In this research, ECG signals are analysed using QFT to find undesired noise components based on their frequency characteristics. A clearer ECG waveform is subsequently obtained by filtering out these noise components and reconstructing the signal. The suggested method shows how quantum-inspired methods might improve signal processing efficiency. QFT-based techniques are more computationally efficient than traditional techniques like the Fast Fourier Transform (FFT) and offer a viable path for future developments in quantum computing and medical signal processing.
The quantum Fourier transform and quantum wavelet transform have been cornerstones of quantum information processing. However, for non-stationary signals and anomaly detection, the Hilbert transform can be a more powerful tool, yet no prior work has provided efficient quantum implementations for the discrete Hilbert transform. This letter presents a novel construction for a quantum Hilbert transform in polylogarithmic size and logarithmic depth for a signal of length NNN, exponentially fewer operations than classical algorithms for the same mapping. We generalize this algorithm to create any ddd-dimensional Hilbert transform in depth O(dlog⁡N)O(d\log N)O(dlogN). Simulations demonstrate effectiveness for tasks such as power systems control and image processing, with exact agreement with classical results.
Electrocardiography (ECG) is a primary diagnostic tool for identifying cardiac arrhythmias, a critical indicator of heart disease. While ECG signals contain vital information about the patient’s health conditions, their high-resolution waveform nature poses significant challenges in effective feature extraction. Recent advancements in quantum computing provide a transformative opportunity to accelerate research in data-driven predictive modeling for healthcare. This paper investigates a variety of Quantum Convolutional Neural Network (QCNN) architectures for ECG signal classification. By leveraging optimized convolutional structures, adaptable pooling layers, and advanced encoding techniques, our QCNN model is designed to preserve essential ECG characteristics while addressing challenges in dimensionality reduction. Experimental results demonstrate that our approach holds significant potential for enhanced arrhythmia classification. This innovative QCNN model has the potential to advance ECG-based diagnostics for heart disease, offering valuable support for clinical decision-making in cardiac care.
The quantum Fourier transform (QFT), a quantum analog of the classical Fourier transform, has been shown to be a powerful tool in developing quantum algorithms. However, in classical computing there is another class of unitary transforms, the wavelet transforms, which are every bit as useful as the Fourier transform. Wavelet transforms are used to expose the multi-scale structure of a signal and are likely to be useful for quantum image processing and quantum data compression. In this paper, we derive efficient, complete, quantum circuits for two representative quantum wavelet transforms, the quantum Haar and quantum Daubechies D(4)D^{(4)}D(4) transforms. Our approach is to factor the operators for these transforms into direct sums, direct products and dot products of unitary matrices. In so doing, we find that permutation matrices, a particular class of unitary matrices, play a pivotal role. Surprisingly, we find that operations that are easy and inexpensive to implement classically are not always easy and inexpensive to implement quantum mechanically, and vice versa. In particular, the computational cost of performing certain permutation matrices is ignored classically because they can be avoided explicitly. However, quantum mechanically, these permutation operations must be performed explicitly and hence their cost enters into the full complexity measure of the quantum transform. We consider the particular set of permutation matrices arising in quantum wavelet transforms and develop efficient quantum circuits that implement them. This allows us to design efficient, complete quantum circuits for the quantum wavelet transform.