arXiv Machine Learning

Readout-Rank Laws for Isotropic Quantum Tangents

arXiv:2608. 07628v1 Announce Type: cross Abstract: Deep parameterized quantum circuits may remain sensitive to a parameter change while the observables retained by a learning model barely respond.

arXiv Machine Learning
1d ago

Symmetry Discovery in Quantum Learning: Observable-Level and Task-Level Inference from Finite Measurements

The paper develops a finite‑measurement framework for inferring the symmetry group that a quantum learning model should respect, based on candidate transformations and limited data. It shows that observable‑invisible transformations correspond to the stabilizer of a projected state when the probe span is invariant, and that recovered generators form a valid subgroup with a continuous invisible space identified via its Lie algebra. The authors introduce an unbiased shadow statistic that improves estimation rates, establish optimal gap dependence through a commuting‑qubit lower bound, and provide tools for task validation, bias quantification, and capacity analysis, all illustrated with Ising‑chain calculations.

By Zeyu Chen
arXiv Machine Learning
Jun 11

Higher-Order Token Interactions via Quantum Attention

arXiv:2606. 11673v1 Announce Type: cross Abstract: Standard dot-product self-attention computes, in a single layer, only pairwise (order-2) interactions between tokens; representing a generic order-$k$ interaction is known to require either super-quadratic resources in one layer or composition across depth.

By Jian Xu, Chao Li, Delu Zeng, John Paisley, Qibin Zhao
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 AI
Aug 6

Representational separation between unitary and channel quantum generative models via shared classical randomness at shallow depth

arXiv:2608. 05110v1 Announce Type: cross Abstract: Near-term quantum hardware limits circuit depth and often imposes geometrically local connectivity for quantum generative models, restricting the output distributions accessible to shallow unitary Born models.

By Arunava Majumder, Marius Krumm, Hendrik Poulsen Nautrup, Hans J. Briegel
arXiv Machine Learning
Aug 3

Fisher Information, Training and Bias in Fourier Regression Models

arXiv:2510. 06945v2 Announce Type: replace Abstract: Motivated by the growing interest in quantum machine learning, in particular quantum neural networks (QNNs), we study how recently introduced evaluation metrics based on the Fisher information matrix (FIM) are effective for predicting their training and prediction performance.

By Lorenzo Pastori, Veronika Eyring, Mierk Schwabe