Metraipolis › archive › dc_af6d3ff9643f
Efficiently and Reliably Measuring Information Processing Capacity in Dynamical Systems via Kernels — arXiv:2610.03281
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.03281
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-06T08:40:42.826Z
- SHA-256 of the archived text
15171ec59e339a636269899b2b2856b99911b5a7b72f853813683e4420966ad3- Stable URL of this page
https://metraipolis.com/documento/dc_af6d3ff9643f
How to cite
Efficiently and Reliably Measuring Information Processing Capacity in Dynamical Systems via Kernels — arXiv:2610.03281 — arXiv (en), https://arxiv.org/abs/2610.03281 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_af6d3ff9643f (Metraipolis archive dc_af6d3ff9643f, sha256 15171ec59e339a636269899b2b2856b99911b5a7b72f853813683e4420966ad3)
BibTeX
@misc{dcaf6d3ff9643f,
title = {Efficiently and Reliably Measuring Information Processing Capacity in Dynamical Systems via Kernels — arXiv:2610.03281},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.03281},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_af6d3ff9643f; sha256 15171ec59e339a636269899b2b2856b99911b5a7b72f853813683e4420966ad3},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.03281. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Information Processing Capacity (IPC) is a powerful system-agnostic metric for quantifying a dynamical system's computational capability and is widely used in quantum reservoir computing. However, standard IPC suffers from severe computational limitations. Computing IPC involves estimating how well the system can reconstruct, via linear regression, an (in principle) infinite family of orthogonal polynomial functions of delayed inputs. In practice, this evaluation must be made finite, so we need only to consider polynomials up to a chosen maximum degree. Moreover, the computational complexity for computing IPC grows combinatorially with the considered maximum degree and delay. Here, we introduce Kernel-IPC (KIPC), a scalable framework that uses kernel methods to compute the total IPC without explicitly enumerating basis functions. This allows us to account for the full (infinite) basis (without degree truncation). We also provide a null-hypothesis test for statistically comparing the KIPC of two dynamical systems. We validate KIPC on an echo state network and demonstrate its utility for quantum reservoir computing on a disordered spin chain. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-10-05 in math.IT). Categorie arXiv: Quantum Physics (quant-ph) ; Information Theory (cs.IT); Dynamical Systems (math.DS). Pagina del lavoro: https://arxiv.org/abs/2610.03281 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-06T08:19:47.070Z dalla pagina https://arxiv.org/catchup/math.IT/2026-10-05?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).