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: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:2607. 22516v1 Announce Type: cross Abstract: A central design principle in modern machine learning and artificial intelligence is to align a model's inductive bias with the structure of its input data.
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.
arXiv:2607. 00063v1 Announce Type: cross Abstract: This paper studies how spectral geometry emerges in quantum learning models and how it can be diagnosed with physically grounded probes.
arXiv:2606. 13422v2 Announce Type: replace-cross Abstract: We develop theoretical foundations for a practical quantum-advantage mechanism in quantum-informed machine learning for chaotic dynamical systems.
arXiv:2606. 31536v1 Announce Type: new Abstract: As Quantum Machine Learning (QML) transitions toward practical implementation, the field faces a critical architectural bottleneck that challenges the fundamental assumptions of classical statistical learning theory.
The paper introduces task‑resolved Fisher spectroscopy for quantum reservoir computing, defining orthonormal score coordinates from prediction targets that reweight labeled histories to produce an affine family of reservoir states and measurement outcomes. It establishes a Fisher‑information hierarchy linking state quantum Fisher information, measurement record Fisher information, and moment matrices up to many‑body order, providing a quadratic form that equals the stationary capacity of the optimal linear readout. The method requires only stationary labeled records and measured outcomes, enabling predictions of held‑out capacities, necessary feature order, and measurement‑budget dependence, and demonstrates how optimizing local measurement axes can recover hidden task information in a five‑spin open reservoir.
arXiv:2607. 20377v1 Announce Type: cross Abstract: Quantum-kernel methods encode a dataset's geometry in a Gram matrix, so learning claims on hardware kernels assume the intended geometry survives execution.
arXiv:2504. 05336v4 Announce Type: replace-cross Abstract: A recurring weakness in quantum machine learning (QML) is that reported ``quantum advantages'' are seldom tested against a \emph{capacity-matched} classical control, leaving it unclear whether a gain comes from the quantum substrate or from the architectural change that accompanies it.
arXiv:2608. 11396v1 Announce Type: cross Abstract: Extracting quantum information from a quantum state is a fundamental task of quantum computation, often requiring the estimation of many non-commuting observables under a finite measurement budget.
arXiv:2607. 16813v1 Announce Type: new Abstract: Sparse-support uncertainty is usually quantified by treating the dictionary as known, an assumption that can produce overconfident, label-dependent conclusions when the dictionary is learned from latent sparse mixtures.
Quantum circuit optimization for fault-tolerant computing requires exact functional equivalence while minimizing expensive non-Clifford resources such as T gates. We study this problem using a compact 44.