Skip to content
Preprint

Tree Tensor Network Reservoir Computing: Hierarchical Ensemble with Invariant Phase Boundaries

Jul 2026 · 0 citations · 26 references
Physics

TL;DR

These analyses identify an asymptotic stability boundary at $\sigma_{T}=\sqrt{2}$ in the large per-tree-size limit, where several theoretical indicators converge, and clarify how hierarchical reservoir topology controls stability and nonlinear information processing.

Abstract

We propose Tree Tensor Network Reservoir Computing (TTN-RC), a quantum-inspired reservoir computing framework for time-series prediction that uses the hierarchical structure of Tree Tensor Networks as a random reservoir. To control the exponential concentration or divergence of TTN outputs, we introduce a hierarchical ensemble method that partitions a fixed-size reservoir into multiple independent sub-reservoirs. In the tested NARMA benchmarks, TTN-RC achieves competitive or improved performance compared with conventional Echo State Networks, especially for tasks requiring higher-order nonlinear processing and longer contextual dependence. We also derive an expected contraction rate based on the reservoir Jacobian and develop a mean-field description of the reservoir-state statistics. These analyses identify an asymptotic stability boundary at $\sigma_{T}=\sqrt{2}$ in the large per-tree-size limit, where several theoretical indicators converge. Our results provide a design principle for tensor-network-based reservoir computing and clarify how hierarchical reservoir topology controls stability and nonlinear information processing.

View source

Similar papers

#protein folding Preprint Aug 2026

Scalable quantum simulation of continuous-time generative models via tensor networks

The first numerical study of continuous-time flow and diffusion models is presented, in which time-dependent potentials and states are represented as tensor networks, and a coherent amplitude encoding is prepared that can be post-processed by quantum algorithms offering a quadratic advantage over Monte Carlo sampling.

Nathan X. Kodama, L. Wray, S. Cochran et al. · 0 citations
Open access Oct 2026

An enhanced quantum reservoir computing framework for hydrological time series modeling

Accurate streamflow forecasting is essential for water resource management, yet it remains challenging due to the highly non-stationary and volatile nature of hydrological time series. This study examines an enhanced Quantum Reservoir Computing (QRC) framework for one-step-ahead monthly dischage forecasting of the Buză...

Liu Zhen, Alina Bărbulescu · 0 citations
Preprint Aug 2026

Free-Probability Kernels for Zero-Rollout Hyperparameter Selection in Reservoir Computing

This work introduces a deterministic, pilot-informed selector for leaky linear reservoirs followed by coordinate-wise nonlinear features and positions free-probability kernels as deterministic surrogates for selecting reservoir operating regimes when validation rollouts are scarce.

Sara Malacarne, Andrea Ceni, Claudio Gallicchio · 0 citations
#artificial intelligence Preprint Sep 2026

Feasibility and Memory Mechanisms of Chern-Simons Context Reservoir Computation

We investigate whether a Chern-Simons (CS) context reservoir is a viable computational substrate and whether evolving its gauge connection provides a benefit beyond simpler mechanisms. The reservoir state is a density fluctuation on a two-dimensional context manifold, whose drift is generated by a density-sourced conne...

Jyotiranjan Beuria, Venkatesh H. Chembrolu · 0 citations
Review Oct 2026

Dynamical Low-Rank Matrix and Tensor-Network Methods in Fluid Mechanics

Fluid flows exhibit correlated structures across space and time. Dynamical low-rank approximation begins by representing the state variable as a matrix or tensor, extracting and exploiting its evolving correlated structure on the fly to construct efficient reduced-order models directly from the governing equations. Ten...

H. Babaee · 0 citations
Preprint Oct 2026

Robust second-order time integration of tree tensor networks

We propose and analyze two second-order basis-update \&Galerkin (BUG) time integration methods for dynamical low-rank approximation on Tucker tensors and tree tensor networks. Both are built from a sequential pre-computation sweep, after which the differential equations for all basis matrices and connecting tensors are...

Jonas Kusch, Dominik Sulz · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.