arXiv AI

Quantum-Inspired Optimization Process for Data Imputation

The paper introduces a quantum‑inspired data imputation framework that combines Principal Component Analysis with quantum rotation‑based reconstruction. Rotation angles are chosen using gradient‑free optimizers (Simulated Annealing, COBYLA, Differential Evolution) and the top three solutions per method are retained to reconstruct missing values within realistic bounds. Benchmarks on the UCI Pima Indians Diabetes dataset show that the quantum‑inspired variants achieve substantially lower Wasserstein W1 distances and better preserve variance compared to classical and modern baseline imputers.

arXiv AI
Jun 3

Scalable On-Hardware Training of Quantum Neural Networks and Application to Clinical Data Imputation

arXiv:2606. 03517v1 Announce Type: cross Abstract: Training quantum neural networks (QNNs) on quantum hardware is currently bottlenecked by the cost of gradient estimation: standard parameter-shift methods require a number of circuit evaluations that grows quadratically with the number of trainable parameters, making hardware-based optimisation impractical beyond small system sizes.

By Natansh Mathur, Panagiotis Kl. Barkoutsos, Masako Yamada, Martin Roetteler, Iordanis Kerenidis
arXiv Machine Learning
Jun 15

Hybrid Classical-Quantum (HCQ) Alzheimer's Classification via Supervised $\beta$-VAE and Quantum Kernels

arXiv:2606. 14194v1 Announce Type: cross Abstract: This paper presents a two-stage Hybrid Classical-Quantum (HCQ) pipeline for binary Alzheimer's disease (AD) classification from 3D T1-weighted structural MRI volumes, where the classical and quantum components are designed to complement each other rather than operate independently.

By Tia Tiwari, Vamshi Krishna Kancharla, Neelam Sinha
arXiv Machine Learning
Aug 19

Dynamic Entanglement-Weighted Pruning for Quantum Federated Unlearning in Supply-Chain Risk Prediction

The paper proposes Entanglement-Weighted Pruning (EWP), a method for unlearning a client’s contribution from a federated quantum classifier without retraining from scratch. EWP scores each trainable circuit parameter by combining a Fisher‑information estimate on the target client’s data with a structural entanglement weight, pruning the lowest‑scoring parameters and optionally fine‑tuning the remaining ones. Experiments on a four‑qubit data‑re‑uploading ansatz trained with FedAvg across five simulated supply‑chain‑risk clients show that EWP achieves accuracy comparable to full retraining while reducing forgetting and wall‑clock time by about sixteenfold, outperforming random, Fisher‑only, or entanglement‑only pruning.

By Aditya Kumar, Sumit Chongder
arXiv Machine Learning
Oct 2

Hybrid Methods for Robust Tabular Data Imputation

The paper introduces two hybrid imputation methods, NuclearForest and SoftForest, that combine a low‑rank initialization (using Singular Value Thresholding or SoftImpute) with a single Random Forest refinement. These methods capture global covariance patterns and local nonlinear dependencies, respectively, and are benchmarked against seven existing techniques across MCAR, MAR, and MNAR scenarios. Results show comparable or superior imputation accuracy to state‑of‑the‑art iterative methods while achieving significant speedups of roughly 5.8× and 9.5× over MissForest.

By Jinwei Li, Michelle Bruch, Daniel Tenbrinck
arXiv Machine Learning
Sep 14

Classical and quantum kernel fusion for two-sample testing

The paper introduces MMD-FUSE, a two-sample test that remains effective on small datasets by fusing classical and quantum kernels. By combining the inductive biases of classical kernels with the expressive power of quantum kernels, the hybrid approach achieves higher test power, especially for small, high‑dimensional data. Experiments on synthetic and real clinical datasets confirm that the method consistently outperforms purely classical counterparts and adapts robustly to varied data characteristics.

By Yu Terada, Yugo Ogio, Ken Arai, Hiroyuki Tezuka, Yu Tanaka