Skip to content
aiqbench takeQuantum Computing

aiqbench analysis

This research demonstrates a practical Quantum Reservoir Computing (QRC) scheme on IBM superconducting devices that leverages repeated quantum non-demolition measurements to reduce execution time while maintaining high accuracy. By optimizing the balance between information retention and dissipation, the study successfully processed temporal data over 1,000 timesteps using 120 qubits, validating the scalability of this approach for large-scale quantum machine learning tasks.
Source coveringarXiv
What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

Quantum reservoir computing with repeated measurements on superconducting devices

arXiv2 min read

arXiv:2310.06706v2 Announce Type: replace Abstract: Reservoir computing is a machine learning framework that uses artificial or physical dissipative dynamics to predict time-series data using nonlinearity and memory properties of dynamical systems. Quantum systems are considered promising physical reservoirs, and several quantum reservoir computing (QRC) schemes that exploit intrinsic quantum mechanical properties as computational resources have been proposed. This paper focuses on a particular QRC scheme that was theoretically proposed to use the repeated quantum non-demolition measurement to generate a time series, mainly for the purpose of reducing the total execution time compared to the conventional method without repeated measurement. We experimentally implemented this scheme on IBM superconducting devices and demonstrated that shorter execution time and higher accuracy can be achieved than with a specific conventional method. Then, we study the temporal information processing capacity to quantify the computational capability of the proposed QRC; in particular, we use this quantity to identify the measurement strength that finds the best balance between the amount of available information and the strength of dissipation. An experimental demonstration with a soft robot is also provided, where repeated measurement over 1,000 timesteps was effectively implemented. Finally, we implemented the repeated-measurement QRC scheme using 120 qubits, to test the potential computational power of a large-scale QRC.

Authors:Toshiki Yasuda, Yudai Suzuki, Tomoyuki Kubota, Kohei Nakajima, Qi Gao, Wenlong Zhang, Satoshi Shimono, Atsushi Matsuo, Janani Ananthanarayanan, Hendra I. Nurdin, Naoki Yamamoto

Abstract:Reservoir computing is a machine learning framework that uses artificial or physical dissipative dynamics to predict time-series data using nonlinearity and memory properties of dynamical systems. Quantum systems are considered promising physical reservoirs, and several quantum reservoir computing (QRC) schemes that exploit intrinsic quantum mechanical properties as computational resources have been proposed. This paper focuses on a particular QRC scheme that was theoretically proposed to use the repeated quantum non-demolition measurement to generate a time series, mainly for the purpose of reducing the total execution time compared to the conventional method without repeated measurement. We experimentally implemented this scheme on IBM superconducting devices and demonstrated that shorter execution time and higher accuracy can be achieved than with a specific conventional method. Then, we study the temporal information processing capacity to quantify the computational capability of the proposed QRC; in particular, we use this quantity to identify the measurement strength that finds the best balance between the amount of available information and the strength of dissipation. An experimental demonstration with a soft robot is also provided, where repeated measurement over 1,000 timesteps was effectively implemented. Finally, we implemented the repeated-measurement QRC scheme using 120 qubits, to test the potential computational power of a large-scale QRC.

23 pages, 7 figures. Substantially revised version with newly performed experiments, additional analysis, expanded discussion and references, and an updated author list

arXiv:2310.06706 [quant-ph]

(or arXiv:2310.06706v2 [quant-ph] for this version)

Full text under the publisher's open licence · 257 words

Related coverage