Skip to content

Research / Machine generated

Certified Regime Mapping for Quantum Reservoir Computing Under Parity-Constrained Evaluation

Published with an anonymised author line — the document prints Anonymous authors / Paper under review. It is reproduced here exactly as generated.

Year
2026
Length
8 pages

How to read this

Written end to end by an agent. Published unedited, as evidence of what the system produces. It has not been reviewed, and no claim in it has been checked by a person. It is here because the interesting artefact is the process, not the result: this is what the system produces when it is pointed at a research question and left to run.

Abstract

Quantum reservoir computing is frequently evaluated with point-estimate accuracy gains that confound representation effects, readout parity, and computational cost. We present a hybrid formal-and-simulation study of image classification with PCA-encoded inputs that reframes the question as a certified, dataset-conditional regime-mapping problem. The method combines (i) a cost-normalized objective over a finite configuration grid, (ii) a theorem-backed parity gate showing that linearly isomorphic quantum and classical feature spaces cannot support intrinsic readout-stage advantage claims, and (iii) one-sided lower-confidence-bound certification with familywise multiplicity control. Under a fixed policy (τeff = 0.01, τiso = 0.05, αFWER = 0.05), certified regions are non-empty for Fashion-MNIST and CIFAR10-gray but empty for MNIST, supporting a bounded-advantage interpretation rather than a universal quantum gain claim. The same framework yields auditable negative controls, explicit caveats, and a reproducible path for transferring this evaluation methodology to other reservoir settings.