Solving the time-complexity problem and tuning the performance of quantum reservoir computing by artificial memory restriction

Abstract

Quantum reservoir computing is a computing approach which aims at utilising 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 reinitialise the reservoir, leading to quadratic time complexity. Overcoming this issue is critical to the hardware implementation of quantum reservoir computing. We propose artificially restricting the memory of the quantum reservoir by only using a small number inputs to reinitialise the reservoir after measurements are performed, leading to linear time complexity. This not only substantially reduces the number of quantum operations needed to perform timeseries prediction tasks, it also provides a means of tuning the nonlinearity of the response of the reservoir, which can lead to significant performance improvement. We numerically study the linear and quadratic algorithms for a fully connected transverse Ising model and a quantum processor model. We find that our proposed linear algorithm not only significantly reduces the computational cost but also provides an experimental accessible means to optimise the task specific reservoir computing performance.

arXiv comment6 pages, 3 figures

References in corpus (21)

• Quantum Machine Learning
• QuTiP 2: A Python framework for the dynamics of open quantum systems
• Harnessing disordered quantum dynamics for machine learning
• Experimental Realization of Quantum Artificial Intelligence
• Quantum Computing with NMR
• Experimental quantum speed-up in reinforcement learning agents
• Opportunities in Quantum Reservoir Computing and Extreme Learning Machines
• Boosting computational power through spatial multiplexing in quantum reservoir computing
• Quantum reservoir computing with a single nonlinear oscillator
• Dynamical phase transitions in quantum reservoir computing
• Temporal Information Processing on Noisy Quantum Computers
• Time Series Quantum Reservoir Computing with Weak and Projective Measurements
• Natural quantum reservoir computing for temporal information processing
• Hybrid quantum-classical reservoir computing of thermal convection flow
• Localization with random time-periodic quantum circuits
• Reservoir Computing Approach to Quantum State Measurement
• The Reservoir Learning Power across Quantum Many-Boby Localization Transition
• Time Shifts to Reduce the Size of Reservoir Computers
• A double quantum dot memristor
• Takens-inspired neuromorphic processor: a downsizing tool for random recurrent neural networks via feature extraction
• Reservoir Computers with Random and Optimized Time-Shifts

Cited by in corpus (10)

• Feedback-driven quantum reservoir computing for time-series analysis
• Chaotic attractor reconstruction using small reservoirs -- the influence of topology
• State estimation with quantum extreme learning machines beyond the scrambling time
• Measurable Krylov Spaces and Eigenenergy Count in Quantum State Dynamics
• Generating Quantum Reservoir State Representations with Random Matrices
• Engineering Quantum Reservoirs through Krylov Complexity, Expressivity and Observability
• From Krylov Complexity to Observability: Capturing Phase Space Dimension with Applications in Quantum Reservoir Computing
• Prediction performance of random reservoirs with different topology for nonlinear dynamical systems with different number of degrees of freedom
• Edge of Many-Body Quantum Chaos in Quantum Reservoir Computing
• Connection between memory performance and optical absorption in quantum reservoir computing