Quantum Kernel Estimation for the Discovery of Early Lung Cancer Detection
Summary
This paper evaluates quantum-classical hybrid machine learning for lung cancer detection using cfDNA fragmentomics and methylation data, showing competitive performance of quantum kernel models against classical baselines.
View Cached Full Text
Cached at: 08/21/26, 10:21 AM
# Quantum Kernel Estimation for the Discovery of Early Lung Cancer Detection
Source: [https://arxiv.org/html/2608.19304](https://arxiv.org/html/2608.19304)
Alex Zajichek2Hakan Doga3Laxmi Parida3Filippo Utro∗,3and Peter J\. Mazzone∗,4Address: 1Department of Computational Life Sciences, Cleveland Clinic Research, Cleveland, Ohio, USA\. 2Department of Quantitative Health Sciences, Cleveland Clinic Research, Cleveland, Ohio, USA\. 3IBM Quantum, IBM Thomas J Watson Research Center, Yorktown Heights, NY, USA\. 4Pulmonary Department, Cleveland Clinic, Cleveland, Ohio, USA\. ∗corresponding author: futro@us\.ibm\.com and mazzonp@ccf\.org
###### Abstract
quantum machine learning, quantum kernel estimation, cfDNA fragmentomics, DNA methylation, lung cancer\.
Abstract\.Lung cancer screening with low\-dose chest computed tomography reduces mortality, but its impact is limited by uptake, adherence, and management challenges\. Blood\-based cell\-free DNA \(cfDNA\) biomarkers offer a complementary approach, although early detection remains difficult because of lung cancer heterogeneity and high\-dimensional, nonlinear molecular signals\. We evaluated quantum\-classical hybrid machine learning for lung cancer detection using DNA fragmentomics and DNA methylation\. After feature selection, models were trained using 20\- and 40\-feature subsets\. Features were encoded into quantum Hilbert space using angle and dense\-angle feature maps with multiple entanglement strategies\. Fidelity\-based quantum kernels were computed with exact statevector simulation and integrated with precomputed\-kernel SVM and kernel\-PCA logistic regression and compared with an SVM model trained on the original features\.
This framework enabled systematic evaluation of how encoding and entanglement design affect classification\. Across repeated held\-out evaluations, quantum\-kernel models achieved competitive performance on both datasets\. For fragmentomics, several 20\-feature configurations improved AUC relative to a classical SVM baseline, suggesting effective capture of nonlinear cfDNA fragmentation structure\. For methylation, the classical SVM achieved the highest AUC, although selected quantum models remained competitive and improved specificity in some cases\. Increasing features from 20 to 40 did not consistently improve performance and often increased variability\. Overall, these results support quantum kernel methods as a promising approach for cfDNA\-based lung cancer detection\.
††footnotetext:Article version: 19th August 2026 h\\currenttimeCET## 1Introduction
Lung cancer screening with an annual low\-dose chest CT scan \(LDCT\) has been shown to reduce mortality among individuals at elevated risk who are suitable candidates for early\-stage intervention\[[7](https://arxiv.org/html/2608.19304#bib.bib1),[1](https://arxiv.org/html/2608.19304#bib.bib2)\]\. However, the overall impact of screening programs has been attenuated by slow uptake among eligible populations, low adherence to annual screening, and channelnges in management of screen detected findings, such as indeterminate pulmonary nodules\.
More accurate, accessible, and lower\-risk diagnostic tools could help to improve the implementation of lung cancer screening and help optimize the balance between clinical benefits and harm at the population level\. In this context, blood based molecular biomarkers, including cell\-free DNA \(cDNA\) assay are being explored\. However, lung cancer is a biologically heterogeneous disease arising in diverse patient populations, which complicates the identification of robust and generalizable molecular signature\. Existing biomarkers approaches oftern exhibit a trad\-off between sensitivity and specificity, limiting their clinical utility\.
Classical machine learning models may struggle by the high dimensionality and complex potentially nonlinear interactions present in molecular data\. Quantum and quantum\-classical hybrid machine learning approaches offer an alternative framework for encoding and processing such data, with the potential to capture richer feature representations\. In this study, we evaluate quantum\-classical hybrid models for early lung cancer detection using two cfDNA biomarker datasets: a fragmentomics\-based assay derived from\[[5](https://arxiv.org/html/2608.19304#bib.bib3),[6](https://arxiv.org/html/2608.19304#bib.bib4)\], and a methylation\-based signature from a the second a discovery\-level study study\.
## 2Data and Methods
Two datasets derived from studies aimed at developing blood based tests for lung cancer screening were analized\.
The first dataset consists of a cfDNA methylation\-based assay\. This dataset includes methylation measurements of 56 genomic targets, identified by a methylation\-sensitive restriction endonuclease approach\. The cohort comprises 813 individuals enrolled in a case\-control biomarker development study \(currently unpublished\)\. All participants met eligible criteria for standard of care lung cancer screening based on age and smoking history\. Among them, 188 \(23%\) individuals had lung cancer, of whom 150 \(80%\) were stage I\-III\. The mean age was 67 years\.
The second is a publicly available cDNA fragmentomics dataset\[[5](https://arxiv.org/html/2608.19304#bib.bib3)\]\. It includes fragment lengths profiles from 718 individuals\. Of these, 365 individual with concerning symptoms or suspicious findings on chest imaging were used as the training cohort in the original study\. The remaining samples were obtained from participants enrolled in colorectal cancer screening trials, supplemented with early\-stage lung cancer cases from a biorepository\. In particular, the dataset includes 172 \(24%\) individuals with lung cancer, of whom 99 \(58%\) were stage I\-III\. The mean age of the cohort was 60 years\. Low\-coverage whole\-genome sequencing was used to derive cfDNA fragment features, computed as ratios of short to long fragments across 473 non\-overlapping 5 MB regions \(each containing approximately 80,000 fragments\), spanning 2\.4 GB of the genome\.
In both dataset, all cancers \(stages I\-IV\) and controls were included in the final analyses\. Feature selection was performed using L1\-penalized logistic regression\[[2](https://arxiv.org/html/2608.19304#bib.bib8)\]\. Within the training data, features were standardized and a logistic regression model with L1 regularization was fitted using stratified cross\-validation, with the regularization parameter selected to maximize the area under the receiver operating characteristic curve \(AUC\)\. Features were ranked by the absolute value of their model coefficients, and the top\-ranked 20 or 40 features were retained for downstream modeling\. These selected feature were subsequently used as inputs for both classical and quantum\-kernel methods\.
### 2\.1Quantum Kernel Estimation
We implemented a quantum kernel estimation \(QKE\) framework to construct nonlinear similarity matrices from classically selected features\. In QKE, classical inputs are embedded into a quantum Hilbert space via a parameterized feature map, and sample similarity is defined by the fidelity between the resulting quantum states\[[8](https://arxiv.org/html/2608.19304#bib.bib5),[3](https://arxiv.org/html/2608.19304#bib.bib6)\]\. This formulation induces an implicit nonlinear kernel though the quatum circuit, while downstream classification is performed using classical methods\.
Let𝐱i∈ℝd\\mathbf\{x\}\_\{i\}\\in\\mathbb\{R\}^\{d\}denote the selected feature vector for sampleii, withd∈\{20,40\}d\\in\\\{20,40\\\}\. Features were scaled to\[0,π/2\]\[0,\\pi/2\]using statistics computed on the training\-set:
x~ij=xij−min\(xj\)max\(xj\)−min\(xj\)⋅π2\.\\tilde\{x\}\_\{ij\}=\\frac\{x\_\{ij\}\-\\min\(x\_\{j\}\)\}\{\\max\(x\_\{j\}\)\-\\min\(x\_\{j\}\)\}\\cdot\\frac\{\\pi\}\{2\}\.\(1\)The scaling parameters were fitted exclusively on the training set and subsequently applied to validation and held\-out test data to prevent information leakage\.
Two quantum encoding strategies were evaluated independently\. In angle encoding, one feature was mapped to each qubit, yeieldingnq=dn\_\{q\}=d\. In dense\-angle encoding, two features were assigned per qubit, yieldingnq=d/2n\_\{q\}=d/2\. Each scaled feature vector was then encoded into a quantum state\|ϕ\(𝐱~\)⟩=Uϕ\(𝐱~,θ\)\|0⟩⊗nq\|\\phi\(\\tilde\{\\mathbf\{x\}\}\)\\rangle=U\_\{\\phi\}\(\\tilde\{\\mathbf\{x\}\};\\theta\)\|0\\rangle^\{\\otimes n\_\{q\}\}, andθ=π2\.\\theta=\\frac\{\\pi\}\{2\}\.The feature map consisted of a globalRy\(θ\)R\_\{y\}\(\\theta\)layer, followed by a controlled\-ZZentangling layer, and data\-dependent sinlge\-qubit rotations\. Three entanglement maps were considered as separate experiments configurations: \(i\) correlation\-sorted linear, \(ii\) custom scoring\-based, and \(iii\) shuffled linear connectivity\. Correlation\-sorted linear entanglement uses Pearson correlation to determine feature order within a fixed linear qubit chain, whereas custom scoring\-based entanglement uses Pearson\-correlation\-derived scores to directly select the strongest qubit\-pair connections\. As a control, shuffled linear entanglement uses the same fixed linear chain after randomly shuffling the feature order, allowing us to assess whether correlation\-informed ordering improves the quantum kernel representation\.
For angle encoding, the feature map was
Uangle\(𝐱~,θ\)=\[∏q=1nqRz\(q\)\(−2x~q\)\]\[∏\(q,r\)∈ℰCZq,r\]\[∏q=1nqRy\(q\)\(θ\)\]\.U\_\{\\mathrm\{angle\}\}\(\\tilde\{\\mathbf\{x\}\};\\theta\)=\\left\[\\prod\_\{q=1\}^\{n\_\{q\}\}R\_\{z\}^\{\(q\)\}\(\-2\\tilde\{x\}\_\{q\}\)\\right\]\\left\[\\prod\_\{\(q,r\)\\in\\mathcal\{E\}\}CZ\_\{q,r\}\\right\]\\left\[\\prod\_\{q=1\}^\{n\_\{q\}\}R\_\{y\}^\{\(q\)\}\(\\theta\)\\right\]\.\(2\)For dense\-angle encoding, the feature map was
Udense\(𝐱~,θ\)=\[∏q=1nqRz\(q\)\(−2x~2q\+1\)Rx\(q\)\(−2x~2q\)\]\[∏\(q,r\)∈ℰCZq,r\]\[∏q=1nqRy\(q\)\(θ\)\]\.U\_\{\\mathrm\{dense\}\}\(\\tilde\{\\mathbf\{x\}\};\\theta\)=\\left\[\\prod\_\{q=1\}^\{n\_\{q\}\}R\_\{z\}^\{\(q\)\}\(\-2\\tilde\{x\}\_\{2q\+1\}\)R\_\{x\}^\{\(q\)\}\(\-2\\tilde\{x\}\_\{2q\}\)\\right\]\\left\[\\prod\_\{\(q,r\)\\in\\mathcal\{E\}\}CZ\_\{q,r\}\\right\]\\left\[\\prod\_\{q=1\}^\{n\_\{q\}\}R\_\{y\}^\{\(q\)\}\(\\theta\)\\right\]\.\(3\)
The quantum kernel between samples was defined as the squared state overlap of their corresposning quantum statesK\(𝐱i,𝐱j\)=\|⟨ϕ\(𝐱~i\)\|ϕ\(𝐱~j\)⟩\|2K\(\\mathbf\{x\}\_\{i\},\\mathbf\{x\}\_\{j\}\)=\\left\|\\langle\\phi\(\\tilde\{\\mathbf\{x\}\}\_\{i\}\)\|\\phi\(\\tilde\{\\mathbf\{x\}\}\_\{j\}\)\\rangle\\right\|^\{2\}\. This fidelity kernel is the standard quantum kernel used in quantum feature\-space learning and fidelity\-based quantum kernel classifiers\[[8](https://arxiv.org/html/2608.19304#bib.bib5),[3](https://arxiv.org/html/2608.19304#bib.bib6)\]\. In this work, kernels were computed using exact statevector simulation, which enables precise estimation of the quantum feature\-space similarity\. Extension to quantum hardware would involve finite sampling and device noise, which may affect kernel quality and will be investigated in future work\[[4](https://arxiv.org/html/2608.19304#bib.bib7)\]\.
Let𝐒train\\mathbf\{S\}\_\{\\mathrm\{train\}\}and𝐒test\\mathbf\{S\}\_\{\\mathrm\{test\}\}denote matrices of simulated statevectors for training and test sample, respectively\. Kernel matrices were computed as𝐊train=\|𝐒train𝐒train†\|∘2,𝐊test=\|𝐒test𝐒train†\|∘2\.\\mathbf\{K\}\_\{\\mathrm\{train\}\}=\\left\|\\mathbf\{S\}\_\{\\mathrm\{train\}\}\\mathbf\{S\}\_\{\\mathrm\{train\}\}^\{\\dagger\}\\right\|^\{\\circ 2\},\\qquad\\mathbf\{K\}\_\{\\mathrm\{test\}\}=\\left\|\\mathbf\{S\}\_\{\\mathrm\{test\}\}\\mathbf\{S\}\_\{\\mathrm\{train\}\}^\{\\dagger\}\\right\|^\{\\circ 2\}\.The training kernel was symmetrized, its diagonal was set to one, and all entries were clipped to\[0,1\]\[0,1\]to mitigate numerical instabilities\.
The precomputed quantum kernels were passed to two downstream classifiers: an SVM trained directly on𝐊train\\mathbf\{K\}\_\{\\mathrm\{train\}\}, and logistic regression on a kernel principal component analysis \(KPCA\) embedding, with data split 80/20 into training and held\-out test sets\. As a classical comparator, a separate SVM was trained on raw features to mirror the SVM used with the quantum kernel, isolating kernel construction \(classical vs\. quantum\) as the sole variable of comparison; its kernel type \(linear, RBF, polynomial, sigmoid\) and hyperparameters were jointly optimized via Optuna \(TPE sampler\) to maximize mean AUC under stratified 5\-fold cross\-validation\.
Figure 1:Held\-out and cross\-validation performanceAUC and specificity at a fixed sensitivity of 80% are shown for classical SVM, quantum\-kernel SVM, and QPCA models across feature\-selection, encoding, and entanglement configurations\. Boxplots summarize repeated held\-out test performance over 10 runs, while black diamond markers indicate cross\-validation estimates\.
## 3Results
### 3\.1DNA methylation Dataset
The performance comparison on the DNA methylation dataset is shown in Fig\.[1](https://arxiv.org/html/2608.19304#S2.F1)A\-B\. Overall, the classical SVM baseline using the top 20 features achieved the highest held\-out AUC among the evaluated models, with values centered around approximately 83–84%\. Quantum\-kernel models, including both the SVM and KPCA classifiers, achieved competitive but generally lower AUC values, typically ranging from approximately 80–82\.5% across the 20\-feature configurations\.
Within the 20\-feature quantum experiments, KPCA\-based models generally achieved slightly higher AUC than the precomputed\-kernel SVM, particularly for both angle and dense\-angle encoding schemes\. Among these, the dense\-angle linear configuration yielded one of the strongest AUC performances results\. In contrast, increasing the selected features from 20 to 40 did not consistently improve performance\. Several 40\-feature dense\-angle configurations showed reduced AUC, in some cases decreasing to approximately 79–80%, suggesting that the additional features may induced redundancy, noise, or less stable quantum similarity structure\.
Specificity exhibited greater variability than AUC across repeated held\-out evaluations, as shown in Fig\.[1](https://arxiv.org/html/2608.19304#S2.F1)B\. The classical SVM with 20 selected features achieved specificity values centered around approximately 72–74%, whereas the 40\-feature variant showed reduced specificityapproximately 65–67%\. Among quantum\-kernel models, KPCA showed relatively strong specificity in selected 40\-feature dense\-angle configurations, reaching approximately 75–78%, although with increased variability\. Precomputed\-kernel SVM models generally showed moderate specificity, often ranging 65–71%, depending on the encoding and entanglement configuration\.
Overall, these results indicate that quantum\-kernel models can achieve performance competitive with classical baselines, although their effectiveness is sensitive to feature selection, encoding strategy, and entanglement design\. The lack of consistent improvement when increasing feature dimensionality suggests that larger feature sets do not necessarily translate into better generalization for quantum kernel methods in this setting\.
### 3\.2cfDNA fragmentomics Dataset
The corresponding results for the DNA fragmentomics dataset are shown in Fig\.[1](https://arxiv.org/html/2608.19304#S2.F1)C\-D\. In contrast to the methylation dataset, quantum\-kernel models achieved consistently strong AUC across several 20\-feature configurations\. Most 20\-feature quantum experiments produced AUC values around 81–82%, exceeding the classical SVM baseline, which was centered near approximately 78–79%\. This trend suggests that the quantum\-kernel representation captured useful nonlinear structure in the fragmentomic feature space\.
Across AUC results, the KPCA\-based model were frequently among the best\-performing approaches, particularly in the 20\-feature angle and dense\-angle settings\. These configurations also showed relatively compact held\-out distributions, indicating stable performance across repeated runs\. In the 40\-feature setting, performance remained competitive for some configurations, especially the scoring\-based dense\-angle configuration, but other showed increased variability\. This effect was especially evident for the quantum\-kernel SVM, where some 40\-feature configurations exhibit broader AUC dispersion\.
Specificity followed a similar pattern but showed greater variability than AUC across repeated held\-out evalation\. The 20\-feature quantum\-kernel models generally improved specificity relative to the classical SVM baseline, with several models reaching approximately 65–70%\. The strongest specificity values were observed for selected SVM\-based quantum\-kernel, particularly in dense\-angle and scoring\-based experiments\. In contrast, the 40\-feature classical SVM baseline showed reduced specificity compared to the 20\-feature setting, consistent with the trend observed in the methylation dataset\.
Overall, these results indicate that quantum\-kernel models can improve AUC relative to the classical baseline in fragmentomics\-based classification under selected configurations, particularly in the lower\-dimensional \(20\-feature\) setting\. However, as observed in the methylation dataset, increasing the feature dimensionality to 40 did not consistently improve performance and often introduced additional variability\.
## 4Discussion
Across both datasets, AUC was more stable than specificity, while specificity exhibited greater variability across repeated held\-out evaluations\. This pattern indicates that the models were generally more consistent in ranking samples than in achieving a fixed\-threshold operating point\. The methylation dataset favored stronger classical SVM performance, particularly in the 20 features, whereas the fragmentomics models showed clearer improvement from quantum\-kernel approaches\.
The comparison between 20\-feature and 40\-feature configurations suggests that increasing the number of selected features did not systematically improve performance\. In several cases, 40\-feature models exhibited either reduced AUC or increased variability, suggesting that the lower\-ranked features may introduce noise or alter the kernel geometry in a way that reduces generalization\. This effect was most apparent in the methylation dataset and in selected fragmentomic SVM configurations\.
Overall, three main observations emerge\. First, quantum\-kernel models achieved performance competitive with classical baselines across both datasets\. Second, KPCA\-based approaches were often more stable than precomputed\-kernel SVMs in terms of AUC\. Third, the 20\-feature setting consistently provided a more favorable balance between predictive performance and stability than the 40\-feature setting\. It is important to note, however, that the features used in these experiments were originally selected from millions of candidates using classical machine learning and statistical approaches for cancer classification\. As a result, these features may be inherently biased toward classical ML methods, potentially limiting the achievable performance of quantum models\. This effect is particularly evident in the methylation dataset, where only 56 sites were provided from millions of DNA methylation loci\. In future work, we plan to explore feature selection strategies that are better aligned with quantum models, for example by leveraging representations that enhance non\-linear structure or are more suitable for quantum downstream tasks\.
## 5Conclusion
Overall, this work presents a proof\-of\-concept evaluation of quantum kernel estimation for liquid\-biopsy\-based lung cancer biomarker discovery\. Future work will examine alternative feature maps, kernel designs, larger and multimodal feature sets, and adaptive kernel\-learning strategies to improve classification while preserving stability\. We will also assess performance under realistic hardware constraints, including finite sampling and noise\.
## References
- \[1\]H\. J\. de Koning, C\. M\. van der Aalst, P\. A\. de Jong, E\. T\. Scholten, K\. Nackaerts, M\. A\. Heuvelmans, J\. J\. Lammers, C\. Weenink, U\. Yousaf\-Khan, N\. Horeweg,et al\.\(2020\)Reduced lung\-cancer mortality with volume ct screening in a randomized trial\.New England Journal of Medicine382\(6\),pp\. 503–513\.External Links:[Document](https://dx.doi.org/10.1056/NEJMoa1911793)Cited by:[§1](https://arxiv.org/html/2608.19304#S1.p1.1)\.
- \[2\]T\. Hastie, R\. Tibshirani, and J\. Friedman\(2009\)The elements of statistical learning: data mining, inference, and prediction\.2 edition,Springer\.Cited by:[§2](https://arxiv.org/html/2608.19304#S2.p4.1)\.
- \[3\]V\. Havlíček, A\. D\. Córcoles, K\. Temme, A\. W\. Harrow, A\. Kandala, J\. M\. Chow, and J\. M\. Gambetta\(2019\)Supervised learning with quantum\-enhanced feature spaces\.Nature567\(7747\),pp\. 209–212\.External Links:[Document](https://dx.doi.org/10.1038/s41586-019-0980-2)Cited by:[§2\.1](https://arxiv.org/html/2608.19304#S2.SS1.p1.1),[§2\.1](https://arxiv.org/html/2608.19304#S2.SS1.p5.1)\.
- \[4\]T\. Hubregtsen, D\. Wierichs, E\. Gil\-Fuster, P\. H\. S\. Derks, P\. K\. Faehrmann, and J\. J\. Meyer\(2022\)Training quantum embedding kernels on near\-term quantum computers\.Physical Review A106\(4\),pp\. 042431\.External Links:[Document](https://dx.doi.org/10.1103/PhysRevA.106.042431)Cited by:[§2\.1](https://arxiv.org/html/2608.19304#S2.SS1.p5.1)\.
- \[5\]D\. Mathios, J\. S\. Johansen, S\. Cristiano, J\. E\. Medina, J\. Phallen, K\. R\. Larsen, D\. C\. Bruhm, N\. Niknafs, M\. G\. Ferreira, V\. Adleff,et al\.\(2021\)Detection and characterization of lung cancer using cell\-free dna fragmentomes\.Nature Communications12,pp\. 5060\.External Links:[Document](https://dx.doi.org/10.1038/s41467-021-24994-w)Cited by:[§1](https://arxiv.org/html/2608.19304#S1.p3.1),[§2](https://arxiv.org/html/2608.19304#S2.p3.1)\.
- \[6\]P\. J\. Mazzone, P\. B\. Bach, J\. Carey, C\. A\. Schonewolf, K\. Bognar, M\. S\. Ahluwalia, M\. Cruz\-Correa, D\. Gierada, S\. Kotagiri, K\. Lloyd,et al\.\(2024\)Clinical validation of a cell\-free dna fragmentome assay for augmentation of lung cancer early detection\.Cancer Discovery14\(11\),pp\. 2224–2242\.External Links:[Document](https://dx.doi.org/10.1158/2159-8290.CD-24-0519)Cited by:[§1](https://arxiv.org/html/2608.19304#S1.p3.1)\.
- \[7\]National Lung Screening Trial Research Team\(2011\)Reduced lung\-cancer mortality with low\-dose computed tomographic screening\.New England Journal of Medicine365\(5\),pp\. 395–409\.External Links:[Document](https://dx.doi.org/10.1056/NEJMoa1102873)Cited by:[§1](https://arxiv.org/html/2608.19304#S1.p1.1)\.
- \[8\]M\. Schuld and N\. Killoran\(2019\)Quantum machine learning in feature hilbert spaces\.Physical Review Letters122\(4\),pp\. 040504\.External Links:[Document](https://dx.doi.org/10.1103/PhysRevLett.122.040504)Cited by:[§2\.1](https://arxiv.org/html/2608.19304#S2.SS1.p1.1),[§2\.1](https://arxiv.org/html/2608.19304#S2.SS1.p5.1)\.Similar Articles
Detecting pneumonia with quantum AI
LMU researchers developed a Quantum Boltzmann Machine model for pneumonia detection from chest X-rays. Using fewer than 9,000 parameters (vs. millions in classical CNNs), the model achieves 84–86% accuracy, demonstrating potential advantages of quantum machine learning for small medical datasets.
Supervised Latent Restructuring for Small-Data Quantum Learning in Plant Phenomics
This paper proposes a hybrid quantum-classical workflow for plant phenomics classification under small-data regimes, using supervised latent restructuring (PCA + LDA) to improve geometric separability before quantum kernel alignment. Experiments show improved separability but highlight compression trade-offs and the difficulty of achieving strong quantum performance.
LUNG-KGMM: Knowledge-Guided Multimodal Learning for Lung Cancer Incidence Prediction
The paper proposes LUNG-KGMM, a knowledge-guided multimodal framework for predicting lung cancer incidence by integrating EHR, radiology data, and clinical guidelines, demonstrating superior performance on the MIMIC dataset and real-world validation.
Hybrid Quantum-inspired Kolmogorov-Arnold Networks for Privacy-Aware Federated Biosignal Learning
This paper introduces a hybrid quantum-inspired Kolmogorov-Arnold network for privacy-aware federated learning of ECG data, demonstrating reduced parameters and communication costs while improving classification metrics compared to traditional MLP.
Image classification via a quantum-inspired strategy involving a mixture of experts
Proposes a quantum-inspired hybrid classical-quantum framework for image classification using a mixture of experts, demonstrating improved performance and reduced failure rate on MNIST and Fashion-MNIST datasets.