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 $σ_{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.
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 σT=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.
Abstract Reservoir computing (RC) systems, traditionally based on echo state networks (ESN) or liquid state machines, have shown significant potential in dynamic temporal data modeling, such as weather forecasting and astronomical predictions. However, these frameworks are known not being applicable to quantum dynamics-based RC. Tensor networks (TNs), with their efficient representation of high-dimensional quantum information and entanglement, are powerful tools for modeling correlated quantum dynamics. Introducing randomized effects into TNs, akin to randomization of recurrent connections in traditional RC, is expected to generate diverse quantum correlation patterns and provide robust, generalizable quantum-inspired dynamic models through randomization. In this work, we propose a novel randomized TN-based RC scheme, experimentally demonstrating its validity. A theoretical model selection criterion is constructed to find the optimal TNRC hyperparameters. Critical phenomena along with the phase transitions of learnability near the edge of chaos in TN RC are clearly identified. The distribution-independent universality in phase transitions observed in TN RC is captured by the newly developed learning theory and a self-consistent mean-field theory of the spin-glass type. The performance advantage of TNRC over ESN is demonstrated in several forecasting experiments. Our findings lay the groundwork for future explorations into randomized TN quantum machine learning, phase transitions in quantum RC, and the manipulation of critical phenomena in complex systems.
We introduce the Tree Tensor Network-enhanced Quantum-Classical Neural Network (TTN-QNet), a hybrid architecture that leverages the hierarchical structure of Tree Tensor Networks for efficient parameter representation and Variational Quantum Circuits (VQC) for expressive modeling. Unlike Tensor Ring Networks, TTNs reduce parameter redundancy through a tree-based topology, enabling scalable and interpretable computation. The proposed TTN-QNet is evaluated on the Iris, MNIST, and CIFAR-10 datasets, achieving classification accuracies of 93.2%, 85.24%, and 81.67%, respectively, on binary classification tasks. TTN-QNet demonstrates rapid convergence and robustness against barren plateaus, offering a promising direction for deep quantum learning.
We have developed TTNOpt, a software package that utilizes tree tensor networks (TTNs) for quantum spin systems and high-dimensional data analysis. TTNOpt provides efficient and powerful TTN computations by locally optimizing the network structure, guided by the entanglement pattern of the target tensors. For quantum spin systems, TTNOpt searches for the ground state of Hamiltonians with bilinear spin interactions and magnetic fields, and computes physical properties of these states, including the variational energy, bipartite entanglement entropy (EE), single-site expectation values, and two-site correlation functions. Additionally, TTNOpt can target the lowest-energy state within a specified subspace, provided that the Hamiltonian conserves total magnetization. For high-dimensional data analysis, TTNOpt factorizes complex tensors into TTN states that maximize fidelity to the original tensors by optimizing the tensors and the network. When a TTN is provided as input, TTNOpt reconstructs the network based on the EE without referencing the fidelity of the original state. We present three demonstrations of TTNOpt: (1) Ground-state search for the hierarchical chain model with a system size of 256. The entanglement patterns of the ground state manifest themselves in a tree structure, and TTNOpt successfully identifies the tree. (2) Factorization of a quantic tensor of the 2 24 dimensions representing a three-variable function where each variant has a weak bit-wise correlation. The optimized TTN shows that its structure isolates the variables from each other. (3) Reconstruction of the matrix product network representing a 16-variable normal distribution characterized by a tree-like correlation structure. TTNOpt can reveal hidden correlation structures of the covariance matrix.
Quantum computing offers the potential for computational abilities that can go beyond classical machines. However, they are still limited by several challenges such as noise, decoherence, and gate errors. As a result, efficient classical simulation of quantum circuits is vital not only for validating and benchmarking quantum hardware but also for gaining deeper insights into the behavior of quantum algorithms. A promising framework for classical simulation is provided by tensor networks. Recently, the density-matrix renormalization group (DMRG) algorithm was developed for simulating quantum circuits using matrix product states (MPS). Although MPS are efficient for representing quantum states with one-dimensional correlation structures, the fixed linear geometry restricts the expressive power of the MPS. In this work, we extend the DMRG algorithm for simulating quantum circuits to tree tensor networks (TTNs). The framework employs a variational compression scheme that optimizes the TTN to approximate the evolved quantum state. To benchmark the method, we simulate random circuits and the quantum approximate optimization algorithm (QAOA) with various two-qubit gate connectivities. For the random circuits, we devise treelike gate layouts that are suitable for TTN and show that TTN requires less memory than MPS for the simulations. For the QAOA circuits, a naive TTN construction that exploits graph structure significantly improves the simulation fidelities. Our findings show that the DMRG algorithm with TTNs provides a promising framework for simulating quantum circuits, particularly when gate connectivities exhibit clustering or a hierarchical structure.
The hierarchical equations of motion (HEOM) method is a numerically exact open quantum system dynamics approach. The method is rooted in an exponential expansion of the bath correlation function, which in essence strategically reshapes a continuous environment into a set of effective bath modes that allow for more efficient cutoff at finite temperatures. Based on this understanding, one can map the HEOM method into a Schrödinger-like equation, with a non-Hermitian super-Hamiltonian for an extended wave function being the tensor product of the central system wave function and the Fock state of these effective bath modes. In this work, we explore the possibility of representing the extended wave function as a tree tensor network state (TTNS) and the super-Hamiltonian as a tree tensor network operator of the same structure as the TTNS, as well as the application of a time propagation algorithm using the time-dependent variational principle. Our benchmark calculations based on the spin-boson model with a slow-relaxing bath show that the proposed HEOM+TTNS approach yields consistent results with those of the conventional HEOM method, while the computation is considerably sped up. In addition, the simulation with a genuine TTNS is four times faster than a one-dimensional matrix product state decomposition scheme.
Recent developments in quantum computing and machine learning have propelled the interdisciplinary study of quantum machine learning. Sequential modeling is an important task with high scientific and commercial value. Existing VQC or QNN-based methods require significant computational resources to perform the gradient-based optimization of a larger number of quantum circuit parameters. The major drawback is that such quantum gradient calculation requires a large amount of circuit evaluation, posing challenges in current near-term quantum hardware and simulation software. In this work, we approach sequential modeling by applying a reservoir computing (RC) framework to quantum recurrent neural networks (QRNN-RC) that are based on classical RNN, LSTM and GRU. The main idea to this RC approach is that the QRNN with randomly initialized weights is treated as a dynamical system and only the final classical linear layer is trained. Our numerical simulations show that the QRNN-RC can reach results comparable to fully trained QRNN models for several function approximation and time series prediction tasks. Since the QRNN training complexity is significantly reduced, the proposed model trains notably faster. In this work we also compare to corresponding classical RNN-based RC implementations and show that the quantum version learns faster by requiring fewer training epochs in most cases. Our results demonstrate a new possibility to utilize quantum neural network for sequential modeling with greater quantum hardware efficiency, an important design consideration for noisy intermediate-scale quantum (NISQ) computers.