arXiv subjects

Rodrigo Martínez-Peña

Publications and source records attributed to Rodrigo Martínez-Peña.

13 recordsLinked to original sources

arXiv2026

Measurement-enabled online quantum processing with amplitude encoding

We introduce a quantum reservoir computing online protocol that realizes amplitude encoding on quantum hardware. Our scheme combines mid-circuit measurement and reset operations to implement the partial-trace dynamics underlying amplitude encoding, while an indirect measurement scheme provides access to reservoir observables without interrupting temporal processing. In contrast to other approaches, our method preserves online operation, avoids input buffering, and keeps the runtime linear in the number of time steps. We present the theoretical formulation of the protocol and a proof-of-principle implementation on quantum hardware, and we evaluate its performance on two standard benchmark tasks. Our results show that the reservoir dynamics can be monitored through both direct measurements of the input qubits and indirect measurements of the memory qubits, enabling observation of the full system while isolating the internal evolution of the reservoir. This work provides a practical route toward scalable hardware implementations of amplitude-encoded quantum reservoir computing and opens the door to systematic experimental studies of complex quantum reservoirs.

quant-ph↗

arXiv2026

Reconstructing the information processing capacity of physical systems from noisy observations

Driven dynamical systems can compute when their transient states encode complex transformations of past inputs. The information processing capacity (IPC) framework allows for a detailed accounting of these computational properties, however its interpretation in noisy systems has remained incomplete. In this work, we clarify how noise affects the IPC and how one can reconstruct the noiseless IPC. First, we show how to distinguish the dynamics of an unperturbed system from the noise-free component of the stochastic dynamics: The IPC measured for responses averaged over noise realizations is in general not the same as the IPC of the unperturbed system. We explicitly demonstrate that noise can redistribute computational capacity and sometimes even enhance performance on particular tasks, rather than merely degrading a fixed computation. We then introduce covariance reconstruction by orthogonal projection (CROP), which reconstructs the covariance and IPC of the noise-free component directly from noisy observations, without requiring a detailed model of either the system or the noise. At fixed total measurement budget, numerical tests on a classical nonlinear reservoir show that CROP estimates the noise-free IPC more accurately than the standard practice of ensemble averaging over repeated trials. We find the same advantage in a quantum reservoir subject to unavoidable measurement noise. Our results provide a general route to recovering the computational structure of noisy physical systems from finite observations.

nlin.AO↗

arXiv2026

A tensor network approach for chaotic time series prediction

Making accurate predictions of chaotic time series is a complex challenge. Reservoir computing, a neuromorphic-inspired approach, has emerged as a powerful tool for this task. It exploits the memory and nonlinearity of dynamical systems without requiring extensive parameter tuning. However, selecting and optimizing reservoir architectures remains an open problem. Next-generation reservoir computing simplifies this problem by employing nonlinear vector autoregression based on truncated Volterra series, thereby reducing hyperparameter complexity. Nevertheless, the latter suffers from exponential parameter growth in terms of the maximum monomial degree. Tensor networks offer a promising solution to this issue by decomposing multidimensional arrays into low-dimensional structures, thus mitigating the curse of dimensionality. This paper explores the application of a previously proposed tensor network model for predicting chaotic time series, demonstrating its advantages in terms of accuracy and computational efficiency compared to conventional echo state networks. Using a state-of-the-art tensor network approach enables us to bridge the gap between the tensor network and reservoir computing communities, fostering advances in both fields.

cs.LG↗

arXiv2026

Feedback-driven recurrent quantum neural network universality

Quantum reservoir computing uses the dynamics of quantum systems to process temporal data, making it particularly well-suited for machine learning with noisy intermediate-scale quantum devices. Recent developments have introduced feedback-based quantum reservoir systems, which process temporal information with comparatively fewer components and enable real-time computation while preserving the input history. Motivated by their promising empirical performance, in this work, we study the approximation capabilities of feedback-based quantum reservoir computing. More specifically, we are concerned with recurrent quantum neural networks, which are quantum analogues of classical recurrent neural networks. Our results show that regular state-space systems can be approximated using quantum recurrent neural networks without the curse of dimensionality and with the number of qubits only growing logarithmically in the reciprocal of the prescribed approximation accuracy. Notably, our analysis demonstrates that quantum recurrent neural networks are universal with linear readouts, making them both powerful and experimentally accessible. These results pave the way for practical and theoretically grounded quantum reservoir computing with real-time processing capabilities.

quant-ph↗

arXiv2025

Input-dependence in quantum reservoir computing

Quantum reservoir computing is an emergent field in which quantum dynamical systems are exploited for temporal information processing. In previous work, it was found a feature that makes a quantum reservoir valuable: contractive dynamics of the quantum reservoir channel toward input-dependent fixed points. These results are enhanced in this paper by finding conditions that guarantee a crucial aspect of the reservoir's design: distinguishing between different input sequences to ensure a faithful representation of temporal input data. This is implemented by finding a condition that guarantees injectivity in reservoir computing filters, with a special emphasis on the quantum case. We provide several examples and focus on a family of quantum reservoirs that is much used in the literature; it consists of an input-encoding quantum channel followed by a strictly contractive channel that enforces the echo state and the fading memory properties. This work contributes to analyzing valuable quantum reservoirs in terms of their input dependence.

quant-ph↗

arXiv2025

Quantum reservoir computing in finite dimensions

Most existing results in the analysis of quantum reservoir computing (QRC) systems with classical inputs have been obtained using the density matrix formalism. This paper shows that alternative representations can provide better insights when dealing with design and assessment questions. More explicitly, system isomorphisms are established that unify the density matrix approach to QRC with the representation in the space of observables using Bloch vectors associated with Gell-Mann bases. It is shown that these vector representations yield state-affine systems (SAS) previously introduced in the classical reservoir computing literature and for which numerous theoretical results have been established. This connection is used to show that various statements in relation to the fading memory (FMP) and the echo state (ESP) properties are independent of the representation, and also to shed some light on fundamental questions in QRC theory in finite dimensions. In particular, a necessary and sufficient condition for the ESP and FMP to hold is formulated using standard hypotheses, and contractive quantum channels that have exclusively trivial semi-infinite solutions are characterized in terms of the existence of input-independent fixed points.

quant-ph↗

arXiv2024

Role of coherence in many-body Quantum Reservoir Computing

Quantum Reservoir Computing (QRC) offers potential advantages over classical reservoir computing, including inherent processing of quantum inputs and a vast Hilbert space for state exploration. Yet, the relation between the performance of reservoirs based on complex and many-body quantum systems and non-classical state features is not established. Through an extensive analysis of QRC based on a transverse-field Ising model we show how different quantum effects, such as quantum coherence and correlations, contribute to improving the performance in temporal tasks, as measured by the Information Processing Capacity. Additionally, we critically assess the impact of finite measurement resources and noise on the reservoir's dynamics in different regimes, quantifying the limited ability to exploit quantum effects for increasing damping and noise strengths. Our results reveal a monotonic relationship between reservoir performance and coherence, along with the importance of quantum effects in the ergodic regime.

quant-ph↗

arXiv2024

Quantum fidelity kernel with a trapped-ion simulation platform

Quantum kernel methods leverage a kernel function computed by embedding input information into the Hilbert space of a quantum system. However, large Hilbert spaces can hinder generalization capability, and the scalability of quantum kernels becomes an issue. To overcome these challenges, various strategies under the concept of inductive bias have been proposed. Bandwidth optimization is a promising approach that can be implemented using quantum simulation platforms. We propose trapped-ion simulation platforms as a means to compute quantum kernels and demonstrate their effectiveness for binary classification tasks. We compare the performance of the proposed method with an optimized classical kernel and evaluate the robustness of the quantum kernel against noise. The results show that ion trap platforms are well-suited for quantum kernel computation and can achieve high accuracy with only a few qubits.

quant-ph↗

arXiv2024

Dissipation as a resource for Quantum Reservoir Computing

Dissipation induced by interactions with an external environment typically hinders the performance of quantum computation, but in some cases can be turned out as a useful resource. We show the potential enhancement induced by dissipation in the field of quantum reservoir computing introducing tunable local losses in spin network models. Our approach based on continuous dissipation is able not only to reproduce the dynamics of previous proposals of quantum reservoir computing, based on discontinuous erasing maps but also to enhance their performance. Control of the damping rates is shown to boost popular machine learning temporal tasks as the capability to linearly and non-linearly process the input history and to forecast chaotic series. Finally, we formally prove that, under non-restrictive conditions, our dissipative models form a universal class for reservoir computing. It means that considering our approach, it is possible to approximate any fading memory map with arbitrary precision.

quant-ph↗

arXiv2022

Time Series Quantum Reservoir Computing with Weak and Projective Measurements

Quantum machine learning represents a promising avenue for data processing, also for purposes of sequential temporal data analysis, as recently proposed in quantum reservoir computing (QRC). The possibility to operate on several platforms and noise intermediate-scale quantum devices makes QRC a timely topic. A challenge that has not been addressed yet, however, is how to efficiently include quantum measurement in realistic protocols, while retaining the reservoir memory needed for sequential time series processing and preserving the quantum advantage offered by large Hilbert spaces. In this work, we propose different measurement protocols and assess their efficiency in terms of resources, through theoretical predictions and numerical analysis. We show that it is possible to exploit the quantumness of the reservoir and to obtain ideal performance both for memory and forecasting tasks with two successful measurement protocols. One consists in rewinding part of the dynamics determined by the fading memory of the reservoir and storing the corresponding data of the input sequence, while the other employs weak measurements operating online at the trade-off where information can be extracted accurately and without hindering the needed memory. Our work establishes the conditions for efficient protocols, being the fading memory time a key factor, and demonstrates the possibility of performing genuine online time-series processing with quantum systems.

quant-ph↗

arXiv2021

Dynamical phase transitions in quantum reservoir computing

Closed quantum systems exhibit different dynamical regimes, like Many-Body Localization or thermalization, which determine the mechanisms of spread and processing of information. Here we address the impact of these dynamical phases in quantum reservoir computing, an unconventional computing paradigm recently extended into the quantum regime that exploits dynamical systems to solve nonlinear and temporal tasks. We establish that the thermal phase is naturally adapted to the requirements of quantum reservoir computing and report an increased performance at the thermalization transition for the studied tasks. Uncovering the underlying physical mechanisms behind optimal information processing capabilities of spin networks is essential for future experimental implementations and provides a new perspective on dynamical phases.

quant-ph↗

arXiv2021

Opportunities in Quantum Reservoir Computing and Extreme Learning Machines

Quantum reservoir computing (QRC) and quantum extreme learning machines (QELM) are two emerging approaches that have demonstrated their potential both in classical and quantum machine learning tasks. They exploit the quantumness of physical systems combined with an easy training strategy, achieving an excellent performance. The increasing interest in these unconventional computing approaches is fueled by the availability of diverse quantum platforms suitable for implementation and the theoretical progresses in the study of complex quantum systems. In this review article, recent proposals and first experiments displaying a broad range of possibilities are reviewed when quantum inputs, quantum physical substrates and quantum tasks are considered. The main focus is the performance of these approaches, on the advantages with respect to classical counterparts and opportunities.

quant-ph↗

arXiv2021

Gaussian states of continuous-variable quantum systems provide universal and versatile reservoir computing

We establish the potential of continuous-variable Gaussian states of linear dynamical systems for machine learning tasks. Specifically, we consider reservoir computing, an efficient framework for online time series processing. As a reservoir we consider a quantum harmonic network modeling e.g. linear quantum optical systems. We prove that unlike universal quantum computing, universal reservoir computing can be achieved without non-Gaussian resources. We find that encoding the input time series into Gaussian states is both a source and a means to tune the nonlinearity of the overall input-output map. We further show that the full potential of the proposed model can be reached by encoding to quantum fluctuations, such as squeezed vacuum, instead of classical intense fields or thermal fluctuations. Our results introduce a new research paradigm for reservoir computing harnessing the dynamics of a quantum system and the engineering of Gaussian quantum states, pushing both fields into a new direction.

quant-ph↗