arXiv Machine Learning By Weijie Xiong, Zo\"e Holmes, Armando Angrisani, Yudai Suzuki, Thiparat Chotibut, Supanut Thanasilp

Role of scrambling and noise in temporal information processing with quantum systems

Read the original on arXiv Machine Learning →

The paper investigates quantum reservoir computing using highly scrambling quantum systems modeled by high‑order unitary designs. It shows that in noiseless settings, measurement readouts become exponentially concentrated as the reservoir size grows, but this concentration does not worsen with repeated iterations, while memory of early inputs decays exponentially with both reservoir size and iterations. In noisy environments, memory also decays exponentially over time for local noisy channels, and the study introduces new proof techniques for bounding concentration in temporal quantum models. Numerical results indicate that even physical reservoirs, such as an Ising model in a quantum‑chaotic phase, can exhibit exponential concentration, whereas reservoirs in a many‑body localized phase or at the edge of chaos do not.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning
Jul 22

Quantum Reservoir Computing: Recent Advances and Future Directions

arXiv:2607. 18552v1 Announce Type: cross Abstract: Quantum reservoir computing (QRC) uses the dynamics of a fixed or weakly tuned quantum system to transform temporal and sequential inputs into measured features, while training is typically confined to a classical readout.

By Shehbaz Tariq, Muhammad Talha, Arshid Ali, Muhammad Diyan, Symeon Chatzinotas
arXiv Machine Learning
Aug 27

Quantum Scrambling Born Machine

The paper introduces the Quantum Scrambling Born Machine, a quantum generative model that uses a fixed entangling unitary—acting as a scrambling reservoir—to generate multi‑qubit entanglement while only optimizing single‑qubit rotations. Three types of entanglers are examined: a Haar random unitary, a finite‑depth brickwork random circuit, and analog time evolution under nearest‑neighbor spin‑chain Hamiltonians. The study finds that once the entangler achieves near‑Haar‑typical entanglement, the model can learn benchmark distributions with little sensitivity to the specific scrambler, and that making the Hamiltonian couplings trainable turns the task into a variational Hamiltonian problem with performance competitive with classical generative models at comparable parameter counts.

By Marcin P{\l}odzie\'n
arXiv Machine Learning
Jun 2

Quantum Reservoir Computing and Risk Bounds

arXiv:2501. 08640v2 Announce Type: replace Abstract: We propose a way to bound the generalisation errors of several classes of quantum reservoirs using the Rademacher complexity.

By Naomi Mona Chmielewski (L2S), Nina Amini (L2S, CNRS), Joseph Mikael