Enhancing the performance of quantum reservoir computing and solving the time-complexity problem by artificial memory restriction

Abstract

We propose a scheme that can enhance the performance and reduce the computational cost of quantum reservoir computing. Quantum reservoir computing is a computing approach which aims at utilizing the complexity and high dimensionality of small quantum systems, together with the fast trainability of reservoir computing, in order to solve complex tasks. The suitability of quantum reservoir computing for solving temporal tasks is hindered by the collapse of the quantum system when measurements are made. This leads to the erasure of the memory of the reservoir. Hence, for every output, the entire input signal is needed to reinitialize the reservoir, leading to quadratic time complexity. Another critical issue for the hardware implementation of quantum reservoir computing is the need for an experimentally accessible means of tuning the nonlinearity of the quantum reservoir. We present an approach which addresses both of these issues. We propose artificially restricting the memory of the quantum reservoir by only using a small number inputs to reinitialize the reservoir after measurements are performed. This strongly influences the nonlinearity of the reservoir response due to the influence of the initial reservoir state, while also substantially reducing the number of quantum operations needed to perform time-series prediction tasks due to the linear rather than quadratic time complexity. The reinitialization length therefore provides an experimental accessible means of tuning the nonlinearity of the response of the reservoir, which can lead to significant task-specific performance improvement. We numerically study the linear and quadratic algorithms for a fully connected transverse Ising model and a quantum processor model.