Search arXivSearch

arXiv · 2510.25183

Sustained Performance and Energy Accounting for Nonlinear Forecasting Across Classical and Simulated Quantum Models

Abstract

Energy-efficient AI should be evaluated across the full application pipeline, not only by lowest error or shortest training time. We study this through nonlinear time-series forecasting using simulated quantum reservoir computing (QRC) as an emerging-computing case study. Our evaluation spans 33 forecasting configurations and 825 completed runs on NARMA-10, NARMA-20, Mackey--Glass, Lorenz-63, and Santa Fe laser data. The core benchmark includes 775 fully instrumented runs across statistical, linear, reservoir, neural, continuous-variable Gaussian QRC, and gate-based statevector QRC models, with 50 additional variational QNN runs extending the trainable-quantum comparison. We measure NRMSE, RMSE, MAE, wall time, inference latency, peak CPU/GPU memory, parameter count, operational energy, and carbon. Since a fixed QRC encoder can generate reusable features for multiple readouts, we report both cold-start and amortized costs. We also use a Sustainable Forecasting Score (SFS), a diagnostic geometric mean of normalized predictive skill and log-scaled carbon efficiency, while retaining raw measurements and Pareto analyses. The best mean NRMSE is achieved by continuous-variable QRC with a Transformer readout (0.332), followed closely by classical TCN (0.341) and QRC+TCN (0.340). However, ESN and ridge-lag deliver the strongest sustained efficiency, with average amortized carbon of 0.014 and 0.012 gCO2 per run and SFS values of 0.814 and 0.805. Larger QRC feature maps increase cost without improving average accuracy, while gate-based statevector simulation is not competitive. These results support three practices for emerging AI systems: expose stage-level energy, use reuse-aware accounting boundaries, and co-design the feature generator or accelerator with the classical readout.

Explore related subjects

Keep this discovery

BibTeXRIS

Avyay Kodali, Priyanshi Singh, Pranay Pandey, Krishna Bhatia, Shalini Devendrababu, Srinjoy Ganguly. 2026-09-04. Sustained Performance and Energy Accounting for Nonlinear Forecasting Across Classical and Simulated Quantum Models. https://arxiv.org/abs/2510.25183

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

Quantum Machine Learning for Finance

Quantum computers are expected to surpass the computational capabilities of classical computers during this decade, and achieve disruptive impact on numerous industry sectors, particularly finance. In fact, finance is estimated to be the first industry sector to benefit from Quantum Computing not only in the medium and long terms, but even in the short term. This review paper presents the state of the art of quantum algorithms for financial applications, with particular focus to those use cases that can be solved via Machine Learning.

quant-ph

Learning Quantum Data Distribution via Chaotic Quantum Diffusion Model

Generative models for quantum data pose significant challenges but hold immense potential in fields such as chemoinformatics and quantum physics. Quantum denoising diffusion probabilistic models (QuDDPMs) enable efficient learning of quantum data distributions by progressively scrambling and denoising quantum states. However, existing implementations typically rely on circuit-based random unitary dynamics, which can be costly to implement and sensitive to control imperfections, particularly on analog quantum hardware. We propose the chaotic quantum diffusion model, a framework that generates projected ensembles via chaotic Hamiltonian time evolution, providing a flexible and hardware-compatible diffusion mechanism. Requiring only global, time-independent control, our approach substantially reduces implementation overhead across diverse analog quantum platforms while achieving accuracy comparable to QuDDPMs. This method improves trainability and robustness, broadening the applicability of quantum generative modeling.

quant-ph

Learning to Concatenate Quantum Codes

Concatenating quantum error correction codes scales error correction capability by driving logical error rates down double-exponentially across levels. However, the noise structure shifts under concatenation, making it hard to choose an optimal code sequence. We automate this choice by estimating the effective noise channel after each level and selecting the next code accordingly. In particular, we use learning-based methods to tailor small, non-additive encoders when the noise exhibits sufficient structure, then switch to standard codes once the noise is nearly uniform. In simulations, this level-wise adaptation achieves a target logical error rate with far fewer qubits than concatenating stabilizer codes alone--reducing qubit counts by up to two orders of magnitude for strongly structured noise. Therefore, this hybrid, learning-based strategy offers a promising tool for early fault-tolerant quantum computing.

quant-ph