arXiv:2608. 19306v1 Announce Type: cross Abstract: Given a set of input states, we consider the task of predicting the expectation value of a Pauli observable at the output of an unknown quantum evolution, using only a limited number of measurements.
By Jonas J\"ager, Yaroslav Khmelnitskiy, Paolo Braccia, Artur Miroszewski, Diego Garc\'ia-Mart\'in, M. Cerezo, Piotr Czarnik
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.
By Yang Peng
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.
By Peiyong Wang, Udaya Parampalli, Casey R. Myers
arXiv:2607. 07978v1 Announce Type: cross Abstract: Quantum reservoir computing uses a fixed quantum circuit as a feature generator and trains only a simple linear readout on top of it.
By Tushar Pandey
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.
By Kung-Ming Lan
The paper derives a closed‑form expression for the reduced quantum channel of a single‑qubit Interactive Quantum Classifier (IQC), revealing that Hamiltonian parameters directly control the constant, sine, and cosine components of the classifier output. This Fourier interpretation motivates a generalized family of Hamiltonian encodings, including matrix‑parameterized environmental Hamiltonians that produce non‑separable Fourier structures. Numerical experiments on synthetic and real‑world datasets demonstrate that these generalized encodings improve classification performance on several nonlinear benchmarks, with a simpler four‑parameter extension achieving comparable results with fewer trainable parameters.
By F\'abio Novaes, Fernando M. de Paula Neto, Jo\~ao V. M. Cardoso