An orchestra tunes up before a concert. Each musician locks into the common rhythm, and order emerges in the hall. A quantum reservoir computer works in a similar way: qubits, like musicians, interact with each other, turning a chaotic signal into a predictable melody.
Reservoir computing has been around for a while. Classical echo-state networks require fine-tuning and large resources. Quantum systems promise rich dynamics thanks to superposition and entanglement, but so far they have only handled one-dimensional signals. This new work is the first to adapt a gate-based quantum reservoir to multidimensional series while accounting for the actual qubit connectivity. It is a step toward practical applications of quantum computing in time-series tasks.
On a noiseless simulator, the model achieves an error of 0.0087 for the Lorenz system and 0.0036 for El Niño, surpassing classical recurrent networks. On the real IBM Heron R2 processor with 156 qubits, accuracy is maintained. For El Niño, noise even improves the result: the error drops to 0.0030. Analysis shows that noise concentrates the variance of features along the leading direction, acting as an implicit regularizer. For Lorenz, the effect is the opposite: noise scatters information and worsens the forecast.
This work demonstrates that gate-based quantum reservoirs can compete with classical methods for multidimensional chaos, even on today's noisy hardware. For the first time, noise is shown to be practically useful as a regularizer for a specific dataset. This opens the way to systematically using hardware noise as a resource rather than an obstacle. The results also highlight the importance of accounting for connectivity topology when designing quantum circuits.
The orchestra has played its concert. The noise of the hall, which usually gets in the way, sometimes accompanies the melody, making it cleaner. The quantum reservoir learns to use that noise to better predict chaos.
The Heron R2 processor used in the study contains 156 superconducting qubits and can execute up to 5000 gates in a single pass. Processing one time series of 990 windows took only about 20 minutes of machine time.