arXiv Machine Learning By Haruki Emori, Masaki Uchihara, Yuuki Tokunaga

Quantum Federated Learning Based on Bures--Uhlmann Geometry for Heterogeneous Noisy Clients

Read the original on arXiv Machine Learning →

The paper proposes a quantum federated learning framework that extends parameter-space geometry to mixed states, using the Bures metric as a local preconditioner and the mean Uhlmann curvature to create an aggregation rule that down‑weights unreliable clients. It provides theoretical convergence guarantees and demonstrates through trapped‑ion quantum emulator experiments that the method retains high accuracy under device heterogeneity and outperforms standard federated averaging, which suffers under strong noise.

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 Machine Learning.

arXiv Machine Learning
Aug 11

Hybrid Quantum-Classical PINNs for Scientific Computing: A Multi-GPU Open-Source Framework

arXiv:2604. 15645v2 Announce Type: replace Abstract: We present QPINNACLE, an open-source computational framework for physics-informed neural networks (PINNs) that integrates modern training strategies, multi-GPU acceleration, and hybrid quantum-classical architectures within a unified modular workflow.

By Ziv Chen, Hemanth Chandravamsi, Shimon Pisnoy, Aaron Goldgewert, Gal Shaviner, Boris Shragner, Steven H. Frankel
arXiv Machine Learning
Sep 14

Trainability-Oriented Hybrid Quantum Regression via Geometric Preconditioning and Curriculum Optimization

The paper introduces a hybrid quantum–classical regression framework that uses a lightweight classical embedding as a learnable geometric preconditioner to improve the conditioning of a downstream variational quantum circuit. It further incorporates a curriculum optimization protocol that gradually increases circuit depth and switches from SPSA-based exploration to Adam-based fine‑tuning. Experiments on PDE‑informed and standard regression datasets show that this approach consistently outperforms pure QNN baselines, yielding more stable convergence and reduced structured errors, especially in data‑limited regimes.

By Qingyu Meng, Yangshuai Wang