Blood pressure monitoring is of paramount importance in the assessment of a human’s cardiovascular health. The state-of-the-art method remains the usage of an upper-arm cuff sphygmomanometer. However, this device suffers from severe limitations—it only provides a static blood pressure value pair, is incapable of capturing blood pressure variations over time, is inaccurate, and causes discomfort upon use. This work presents a radar-based approach that utilizes the movement of the skin due to artery pulsation to extract pressure waves. From those waves, a set of 21 features was collected and used—together with the calibration parameters of age, gender, height, and weight—as input for a neural network-based regression model. After collecting data from 55 subjects from radar and a blood pressure reference device, we trained 126 networks to analyze the developed approach’s predictive power. As a result, a very shallow network with just two hidden layers produced a systolic error of $9.2\pm 8.3$ mmHg (mean error ± standard deviation) and a diastolic error of $7.7\pm 5.7$ mmHg. While the trained model did not reach the requirements of the AAMI and BHS blood pressure measuring standards, optimizing network performance was not the goal of the proposed work. Still, the approach has displayed great potential in capturing blood pressure variation with the proposed features. The presented approach therefore shows great potential to be incorporated into wearable devices for continuous blood pressure monitoring for home use or screening applications, after improving this approach even further.

We investigate the use of quantum computing algorithms on real quantum hardware to tackle the computationally intensive task of feature selection for light-weight medical image datasets. Feature selection is often formulated as a k of n selection problem, where the complexity grows binomially with increasing k and n. Quantum computers, particularly quantum annealers, are well-suited for such problems, which may offer advantages under certain problem formulations. We present a method to solve larger feature selection instances than previously demonstrated on commercial quantum annealers. Our approach combines a linear Ising penalty mechanism with subsampling and thresholding techniques to enhance scalability. The method is tested in a toy problem where feature selection identifies pixel masks used to reconstruct small-scale medical images. We compare our approach against a range of feature selection strategies, including randomized baselines, classical supervised and unsupervised methods, combinatorial optimization via classical and quantum solvers, and learning-based feature representations. The results indicate that quantum annealing-based feature selection is effective for this simplified use case, demonstrating its potential in high-dimensional optimization tasks. However, its applicability to broader, real-world problems remains uncertain, given the current limitations of quantum computing hardware. While learned feature representations such as autoencoders achieve superior reconstruction performance, they do not offer the same level of interpretability or direct control over input feature selection as our approach.

Our study explores the feasibility of quantum computing in emission tomography reconstruction, addressing a noisy ill-conditioned inverse problem. In current clinical practice, this is typically solved by iterative methods minimizing a $L^2$ norm. After reviewing quantum computing principles, we propose the use of a commercially available quantum annealer and employ corresponding hybrid solvers, which combine quantum and classical computing to handle more significant problems. We demonstrate how to frame image reconstruction as a combinatorial optimization problem suited for these quantum annealers and hybrid systems. Using a toy problem, we analyze reconstructions of binary and integer-valued images with respect to their image size and compare them to conventional methods. Additionally, we test our method’s performance under noise and data underdetermination. In summary, our method demonstrates competitive performance with traditional algorithms for binary images up to an image size of $32\times 32$ on the toy problem, even under noisy and underdetermined conditions. However, scalability challenges emerge as image size and pixel bit range increase, restricting hybrid quantum computing as a practical tool for emission tomography reconstruction until significant advancements are made to address this issue.