Sleep-Disordered Breathing Detection with Quantum Recurrent Neural Networks
Authors: Alejandro Mayorga-Redondo, José Daniel Viqueira, Diego Alvarez-Estevez, Eduardo Mosqueira-Rey, Andrés Gómez
Organizations: Universidade da Coruña, CITIC Departamento de Ciencias de la Computación y Tecnologías de la Información Campus de Elviña, 15071 A Coruña, Spain · CESGA, Galicia Supercomputing Center Universidade de Santiago de Compostela, COGRADE Departamento de Electrónica e Computación Campus Vida, 15782 Santiago de Compostela, Spain · CESGA, Galicia Supercomputing Center 15705 Santiago de Compostela, Spain
This work investigates the application of Quantum Recurrent Neural Networks to the binary classification of sleep-disordered breathing events in time-series data, aiming to distinguish between apneic and normal breathing episodes. A variational classical--quantum architecture is proposed and evaluated against classical Recurrent Neural Network models. Experiments were conducted on multiple real-world datasets with varying levels of complexity to assess the strengths and limitations of the quantum approach. In the comparative analysis, both classical and quantum models showed comparable performance. The quantum model achieved superior performance on the smallest dataset, while yielding slightly weaker results in the most complex setting. However, the quantum approach exhibited notable strengths, such as competitive performance despite a drastically reduced parameter count and low-qubit regime, as well as good generalization capabilities. These results suggest that, despite current hardware and algorithmic limitations, variational quantum recurrent models represent a promising alternative for time-series classification as Quantum Computing technologies continue to mature.
Figures & tables
Data features
Small dataset
Medium dataset
Large dataset
Instances number
300
600
1200
Apneic events
Only apnea
Only apnea
Apnea and hypopnea
Data distribution
50/50/ −
50/50/ −
50/25/25
Used signals
airflow
airflow and SaO 2
airflow and SaO 2
Table 1: Employed datasets with their differential characteristics. Data distribution row reports, in order, the percentage of normal, apnea, and (when included) hypopnea instances.
Figure 1: Examples of airflow and SaO 2 signals for the different samples that compose the datasets. The X-axis represents timesteps, while the Y-axis indicates the corresponding amplitude for each signal.
Figure 2: Diagram of the RNN classifier. We show a recurrent neural network unrolled through time. Each timestep, it processes an input vector, returns an output scalar and transmits memory to the next timestep. The first t0=nT−nwout outputs are discarded and the last nwout enter the averaging phase. After averaging, a function f returns an output value to classify the sample.
Figure 3: Detailed QRNN architecture.
Parameter type
Hyperparameter
Fixed values
Search values
Shared
epochs
500
early stopping (acc)
10
optimizer
Adam
loss function
Binary cross-entropy
nwout
nT−20
batch size
{16,32,64}
Table 2: Employed models and training hyperparameters. Each horizontal line divides the shared values with those applying only to one model. Sets in brackets define those implied in the grid search, while single values are fixed before.
Small dataset
Medium dataset
Large dataset
Model
CRNN
QRNN
CRNN
QRNN
CRNN
QRNN
folds mean acc.
0.6541
0.7225
0.8687
0.8717
0.8200
0.7702
folds mean std. dev.
0.0664
0.1152
0.0358
0.0306
0.0292
0.0469
batch size
16
16
16
32
16
16
learning rate
0.001
0.001
0.001
0.001
0.001
0.001
CRNN layers
4
_
4
_
4
_
Table 3: Best models, their hyperparameter configurations, and their performance in 5-repeated 5-fold cross-validation.
Small dataset
Medium dataset
Large dataset
Metric
Value
CRNN
QRNN
CRNN
QRNN
CRNN
QRNN
Accuracy
Average
0.6900
0.8300
0.8850
0.8783
0.8033
0.7367
std. dev.
0.0898
0.0609
0.0370
0.0113
0.0448
0.0301
F1-score
Average
0.7130
0.8322
0.8775
0.8734
0.7935
0.7139
Std. dev.
0.0539
0.0605
0.0405
0.0157
0.0418
0.0263
Precision
Average
0.6957
0.8417
0.9362
0.9089
0.8420
0.7855
Table 4: Classification performance on the test set. Results are reported as averages over 5 runs and their corresponding standard deviations.
Figure 4: Training loss and accuracy convergence curves for the classical and quantum models. X-axis represents the number of epochs and Y-axis indicates the metric values.
Quantum machine learning has emerged as a promising approach to time series prediction. While quantum reservoir computing has been widely explored for this setting, variational quantum models tailored to sequential data remain comparatively understudied, largely because they are difficult to train. In this work, we present a rigorous benchmark of variational quantum recurrent neural networks (QRNNs) on time series prediction tasks, focusing on two key capabilities: memory and nonlinear processing. We introduce a task-driven methodology that quantifies model capacity, enabling an intuitive and fair comparison across architectures, including classical recurrent baselines. We evaluate the proposed framework on two generic benchmark tasks and on a synthetic dataset describing a chaotic system. Overall, the quantum models achieve performance comparable to their classical counterparts, but classical models scale better with the memory size within the range studied. Notably, one QRNN variant shows higher average capacity on the task designed to jointly probe memory and nonlinear capacity. Moreover, our results show that quantum models offer better capacity when we are able to find a good parameter initialization. However, the increasing sensitivity to initialization leads to a lower probability of finding good solutions as the model size increases. These results provide a principled starting point for designing richer quantum recurrent architectures and for assessing where they may offer practical benefits.
José Daniel Viqueira, Andrés Gómez, David Mera
Galicia Supercomputing Center (CESGA), 15705 Santiago de Compostela, Spain · Computer Graphics and Data Engineering (COGRADE), Departamento de Electrónica e Computación, Universidade de Santiago de Compostela, 15782 Santiago de Compostela, Spain
Forecasting physiological signals can support proactive monitoring and timely clinical intervention by anticipating critical changes in patient status. In this work, we address multivariate multi-horizon forecasting of physiological time series by jointly predicting heart rate, oxygen saturation, pulse rate, and respiratory rate at forecasting horizons of 15, 30, and 60 seconds. We propose a hybrid quantum-classical architecture that integrates a Variational Quantum Circuit (VQC) within a recurrent neural backbone. A GRU encoder summarizes the historical observation window into a latent representation, which is then projected into quantum angles used to parameterize the VQC. The quantum layer acts as a learnable non-linear feature mixer, modeling cross-variable interactions before the final prediction stage. We evaluate the proposed approach on the BIDMC PPG and Respiration dataset under a Leave-One-Patient-Out protocol. The results show competitive accuracy compared with classical and deep learning baselines, together with greater robustness to noise and missing inputs. These findings suggest that hybrid quantum layers can provide useful inductive biases for physiological time series forecasting in small-cohort clinical settings. The code is available at https://github.com/arco-group/quantum-ml.
Irene Iele, Floriano Caprio, Paolo Soda +1
Unit of Artificial Intelligence and Computer Systems, Università Campus Bio-Medico di Roma, Italy · Department of Diagnostics and Intervention, Radiation Physics, Biomedical Engineering, Umeå University, Sweden · Department of Naval, Electrical, Electronics and Telecommunications Engineering, University of Genoa, Italy
A potential path forward is Quantum Machine Learning (QML), which aims to leverage quantum computing in conjunction with classical machine learning to enhance computing efficiency and the expressiveness of models. In this paper, two different quantum classifiers - Variational Quantum Classifier (VQC) and Quantum Kernel Support Vector Machine (QSVM) - are compared with three classical classifiers as baseline classifiers - Logistic Regression, Support Vector Machine (SVM), and a Multi-Layer Perceptron (MLP) - on the Breast Cancer Wisconsin dataset. The quantum circuits were created in the PennyLane framework and simulated on a classical backend. However, in terms of accuracy, classical Logistic Regression performed better with an accuracy of 97.8%, classical SVM and QSVM with an accuracy of 95.6% each, although the Quantum VQC achieved a lower accuracy of 88.9% and had a recall of 100% for the benign class, though it correctly identified only 12 of the 17 malignant cases (a malignant-class recall of approximately 70.6%). The drawback of quantum models is the higher training time; however, since the quantum circuit needs to be classically simulated, the quantum SVM took 23.29 seconds compared to less than 0.01 seconds for the classical linear models. These results indicate that for small structured datasets, classifiers based on quantum computing have not yet surpassed well-tuned classical counterparts. In some respects (e.g., benign-class recall), they perform competitively, though not on malignant-class recall, where the VQC in particular performed worse than the classical baselines, which is worth further investigation on real quantum computers.
Anand Kumar Mishra, Ramanuj Awasthi
School of Engineering & Technology (UIET), CSJM University, Kanpur, Uttar Pradesh, India