Quantum Extreme Reservoir Computing Against Matched, Tuned Classical Feature Maps: A Static and Temporal Audit
Nidhi Rajiv Rai, Sandip Tukaram Shingade
Abstract
Quantum Extreme Reservoir Computing (QERC) has been proposed for machine learning on near-term quantum processors. We audit static and temporal QERC against matched, equally tuned classical baselines, following a protocol committed to version control before test-set evaluation. We reproduce the canonical MNIST baseline (N = 10, D = 1024) with test accuracy 0.9688 (published: 0.970). On compact MNIST (N = 6, n_train = 1000), the disordered quantum reservoir exceeds tuned random Fourier features (C-RFF, within the specified search grid) by +3.87 pp (95% CI [+2.69, +5.12]) and shows no significant difference from tuned tanh features (-0.38 pp, 95% CI [-1.07, +0.58]), while parameter-free cosine encoding, raw PCA features and a trained SVM reach higher mean accuracy. The C-RFF gap depends on its selected scale sitting at the lower grid boundary (on an exploratory extended grid it shrinks to +0.33 pp, 95% CI [-0.62, +1.48]), and on MNIST at N = 10 tuned tanh features are significantly more accurate than the reservoir (delta = -0.94 pp, 95% CI [-1.36, -0.45]). In the canonical regime on MNIST, C-RFF is 0.83 pp more accurate than R-CAN-ZZ: the pre-specified superiority hypothesis for R-CAN-ZZ is not supported, although the difference lies within a +/-1 pp equivalence margin. Static QERC has no delayed memory under an independent-input, reset-per-sample protocol; in the temporal density-matrix formulation and hyperparameter grids studied, a matched echo state network has higher memory capacity (8.457 vs 3.352) and lower NARMA10 error (0.304 vs 0.790) at D = 21.