analiza aiqbench
This research investigates how structured brickwall quantum circuits can serve as effective reservoirs for learning temporal correlations, offering a viable alternative to traditional Hamiltonian models. The study demonstrates that specific gate choices in dual-unitary circuits enable faster convergence to unitary designs and allow peak performance at modest circuit depths compared to random Haar gates. These findings provide actionable insights into optimizing quantum hardware configurations for machine learning tasks without relying on complex nonintegrable systems.
Evaluating quantum circuits in the reservoir computing paradigm
arXiv:2605.01253v3 Announce Type: replace Abstract: Reservoir computing is a framework for learning temporal correlations in time series data by leveraging the intrinsic dynamics of an underlying physical system. In quantum implementations, the reservoir is commonly realised through the ergodic dynamics of nonintegrable Hamiltonian models. In our present work, we investigate the relation between reservoir performance and underlying dynamics in an analogous setting wherein a structured brickwall quantum circuit functions as the reservoir. We focus on the manner in which the choice of constituent two qubit gates influences task performance correlating the same with known results on the dynamical nature of the circuit in question. Our primary analysis involves the class of dual-unitary circuits, for which features governing the global dynamics are tunable and exactly solvable. We further study a class of circuits constructed out of non-random two qubit gates satisfying a specific solvability condition under the Cartan decomposition, for which the second moment spectrum can be determined analytically. For sufficiently large entangling power of gates, the said circuit converges to unitary designs faster than an equivalent brickwall arrangement of Haar random two qubit gates. In both cases considered, the dynamics are respectively characterised by analytically accessible exact measures of system level complexity. Our results show that reservoir performance is strongly influenced by the choice of local two-qubit operations, and that structured quantum circuits can function as effective reservoirs, where the peak performance can be accessed in relatively modest circuit depths when compared to conventional Hamiltonian reservoirs.
Abstract:Reservoir computing is a framework for learning temporal correlations in time series data by leveraging the intrinsic dynamics of an underlying physical system. In quantum implementations, the reservoir is commonly realised through the ergodic dynamics of nonintegrable Hamiltonian models. In our present work, we investigate the relation between reservoir performance and underlying dynamics in an analogous setting wherein a structured brickwall quantum circuit functions as the reservoir. We focus on the manner in which the choice of constituent two qubit gates influences task performance correlating the same with known results on the dynamical nature of the circuit in question. Our primary analysis involves the class of dual-unitary circuits, for which features governing the global dynamics are tunable and exactly solvable. We further study a class of circuits constructed out of non-random two qubit gates satisfying a specific solvability condition under the Cartan decomposition, for which the second moment spectrum can be determined analytically. For sufficiently large entangling power of gates, the said circuit converges to unitary designs faster than an equivalent brickwall arrangement of Haar random two qubit gates. In both cases considered, the dynamics are respectively characterised by analytically accessible exact measures of system level complexity. Our results show that reservoir performance is strongly influenced by the choice of local two-qubit operations, and that structured quantum circuits can function as effective reservoirs, where the peak performance can be accessed in relatively modest circuit depths when compared to conventional Hamiltonian reservoirs.
26 pages and 17 figures. Revised version includes additional classical benchmarks. Comments and feedback are welcome
arXiv:2605.01253 [quant-ph]
(or arXiv:2605.01253v3 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2605.01253 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 346 cuvinte
Subiecte conexe

Quantum Reservoir Expressivity Confirmed on IBM Hardware via ORS Score
Quantum Zeitgeist · 13 iul. 2026
From Digital to Physical Reservoir Computing: Co-Optimizing Soft Robotic Reservoirs via Dynamics Matching
arXiv · 4 aug. 2026
Beyond Low-Pass Dynamics: Frequency-Selective Spiking Reservoirs with Resonant Neurons
arXiv · 31 oct. 2026
Context-dependent time-series prediction via HyperReservoirs
arXiv · 30 sept. 2026