arXiv Machine Learning By Yibin Wang

Sequential Capacity of Quantum Processes with Finite Memory

Read the original on arXiv Machine Learning →

arXiv:2610. 02068v1 Announce Type: cross Abstract: How complex can the responses of a quantum device become as it runs longer with a fixed internal memory?

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
Sep 24

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

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.

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

Quantum Gaussian processes for prediction of channel observations

arXiv:2608. 19306v1 Announce Type: cross Abstract: Given a set of input states, we consider the task of predicting the expectation value of a Pauli observable at the output of an unknown quantum evolution, using only a limited number of measurements.

By Jonas J\"ager, Yaroslav Khmelnitskiy, Paolo Braccia, Artur Miroszewski, Diego Garc\'ia-Mart\'in, M. Cerezo, Piotr Czarnik