Evaluating quantum circuits in the reservoir computing paradigm
Gaurav Rudra Malik, Amit Kumar Jaiswal, S. Aravinda, Sunil Kumar Mishra

TL;DR
This paper investigates the effectiveness of structured quantum circuits, specifically brickwall configurations with various two-qubit gates, in reservoir computing for time-series prediction, highlighting their potential for improved performance.
Contribution
It introduces a systematic analysis of structured quantum circuits with different gate types, demonstrating their reservoir computing capabilities and potential advantages over random circuits.
Findings
Structured circuits with specific gates outperform Haar-random circuits in reservoir tasks.
Tunable ergodic properties of dual-unitaries influence reservoir performance.
Krylov space analytics can reliably predict effective circuit reservoirs.
Abstract
Reservoir computing is a framework which is primarily used for temporal information processing, using the intrinsic dynamics of an underlying physical system. The framework, in a quantum setup, is implemented using ergodic dynamics associated with Hamiltonian models. The computational power of the reservoir is closely tied to this underlying dynamical nature, and to probe this further, we study the effectiveness of a reservoir that is made using structured brickwall circuits built from two-qubit gates. Here, the global ergodic nature of the circuit model results from the said arrangement, which has an important role in extracting useful performance with a minimal setup that is independent of an associated Hamiltonian. We focus on the nature of the gates used in this setup and evaluate the resulting reservoir performance, correlating the same with known results on the dynamical nature of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
