arXiv Machine Learning By Jian Xu, Delu Zeng, John Paisley, Qibin Zhao

Entanglement as a Structural Complexity Axis: A PAC-Bayesian View of Generalization in Quantum Policies and Value Functions

Read the original on arXiv Machine Learning →

arXiv:2607. 06230v1 Announce Type: cross Abstract: Parameterized quantum circuits (PQCs) are increasingly used as policies and value functions in quantum reinforcement learning, yet it remains unclear when and why quantum policies generalize.

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 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
Sep 22

Watching Quantum Models Think: Hilbert-Space Interpretability in Quantum Transformer Blocks

The paper demonstrates that quantum transformer blocks can be intrinsically interpretable by tracking quantum mutual information, entanglement entropy, and state fidelity across layers. Experiments on four synthetic tasks show that learned mutual information aligns with task structure, entanglement is essential for accuracy, and mutual information predicts prediction correctness. These findings are validated on IBM Quantum hardware, illustrating that quantum computation’s physics can provide observable interpretability signals.

By Diego Iacopetta, Andrea Gasparini
arXiv Machine Learning
Sep 25

Learning and interpreting policies for simultaneous entanglement requests in quantum networks

The paper presents a reinforcement‑learning approach to schedule link‑level entanglement in quantum networks, using a Markov Decision Process and double deep Q‑networks with message‑passing neural networks. The resulting policies achieve 100% success rates even when the link activation probability is reduced by up to 71% compared to baseline heuristics, and maintain at least 80% success when task placements are hardware‑restricted. The authors also develop metrics to interpret the learned policy and employ a large language model to generate a heuristic that matches the DQN performance, suggesting a scalable method for extracting interpretable strategies in large quantum networks.

By Leon Rode, Sumeet Khatri, Supartha Podder
arXiv Machine Learning
Jun 24

Reinforcement Learning to Disentangle Multiqubit Quantum States from Partial Observations

arXiv:2406. 07884v3 Announce Type: replace-cross Abstract: Using partial knowledge of a quantum state to control multiqubit entanglement is a largely unexplored paradigm in the emerging field of quantum interactive dynamics with the potential to address outstanding challenges in quantum state preparation and compression, quantum control, and quantum complexity.

By Pavel Tashev, Stefan Petrov, Matthew T. Diaz, Friederike Metz, Alaina M. Green, Norbert M. Linke, Marin Bukov