arXiv AI By Nishikanta Mohanty, Bikash K. Behera, Badshah Mukherjee, Pravat Dash, Christopher Ferrie

Quantum-Inspired Optimization Process for Data Imputation

Read the original on arXiv AI →

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.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

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