Papers › Computing with two quantum reservoirs connected via optimized two-qubit nonselective...

Computing with two quantum reservoirs connected via optimized two-qubit nonselective measurements

18 Jan 2022arXiv:2201.07969links table onlyarchive 2025-07-28

Stephen Vintskevich, Dmitry Grigoriev

The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.

Currently, quantum reservoir computing is one of the most promising and experimentally accessible techniques for hybrid, quantum-classical machine learning. However, its applications are limited due to practical restrictions on the size of quantum systems and the influence of noise. Here we propose a novel approach to connect two quantum reservoirs in a network to overcome these issues and enhance their computing performance. To transfer information between quantum reservoirs, we perform optimized two-qubit non-selective measurements. We suggest a general heuristic optimization strategy based on tensor network language and matrix representation of two-qubit quantum channels specified for quantum reservoir computing. In addition, we introduce a single qubit purification channel and its optimization for further enhancement of quantum reservoir computing. We also demonstrate that the optimized channels applied to a seven-qubit network can efficiently transfer information between its parts with the resulting performance comparable to a network up to twenty-five qubits connected via a classical information link.

PaperPDFCode

Code

stephenvintskevich/qrc officialmentioned in papermentioned on GitHub report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections