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.
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.
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.
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.
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.
arXiv:2606. 12211v1 Announce Type: cross Abstract: A central principle in quantum machine learning is that an ansatz should be expressive enough to represent the quantum data of interest.
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.
arXiv:2607. 02444v1 Announce Type: cross Abstract: We study stabilizer state testing and learning with limited coherent quantum memory.