Theory and interpretability of Quantum Extreme Learning Machines: a Pauli-transfer matrix approach
Organizations: Institute for AI Safety and Security, German Aerospace Center (DLR), Sankt Augustin and Ulm, Germany
Abstract
Quantum reservoir computers (QRCs) have emerged as a promising approach to quantum machine learning, since they utilize the natural dynamics of quantum systems for data processing and are simple to train. Here, we consider -qubit quantum extreme learning machines (QELMs) with initial-state encoding and continuous-time reservoir dynamics. We apply the Pauli transfer matrix (PTM) formalism to theoretically analyze the influence of encoding, reservoir dynamics, and measurement operations (including temporal multiplexing) on the QELM performance. This formalism reveals the complete set of (nonlinear) features generated by the encoding, and shows how the subsequent quantum channels linearly transform these Pauli features before they are probed by the chosen measurement operators. Optimizing such a QELM can therefore be cast as a decoding problem in which one shapes the channel-induced transformations such that task-relevant features become available to the regressor, effectively reversing the information scrambling of a unitary. Operator spreading under unitary evolution determines decodability of Pauli features, which underlies the nonlinear processing capacity of the reservoir. When paired with certain observables, structured Hamiltonians can reduce model expressivity, as reflected in a low readout rank. We trace this effect to Hamiltonian symmetries and derive asymptotic rank estimates for symmetry-resolved observable families. The PTM formalism yields a nonlinear vector (auto-)regression model as an interpretable classical representation of a QELM. As a specific application, we focus on forecasting nonlinear dynamical systems and show that a QELM trained on such trajectories learns a surrogate-approximation to the underlying flow map.
Figures & tables
| Feature | |||
|---|---|---|---|
| Factor in observable | Amplitude on | Amplitude on | Rotational |
| Hamiltonian | Observables | Asymptotic saturated rank |
|---|---|---|
| , | ||
| (up to poly. factors) | ||
| (up to poly. factors) | ||
| , | (near full) | |
| (up to poly. factors) |
| System | type | QELM setup | ||||
|---|---|---|---|---|---|---|
| Lorenz-63 | std. | ampl. enc. , Eq. 8 | - | |||
| Lorenz-63 | resc. | ampl. enc. , Eq. 8 | 0.005 | |||
| Halvorsen | std. | ampl. enc. , Eq. 8 | - | |||
| Halvorsen | std. | …+ add squares to readout vector | - | |||
| Halvorsen | resc. | ampl. enc. , Eq. 8 | 0.027 | |||
| Halvorsen | resc. | …+ add squares to readout vector | 0.027 |
| Symbol | Meaning |
|---|---|
| Hilbert space | |
| Space of Hermitian operators on | |
| Number of qubits | |
| Hilbert space dimension ( ) | |
| Input data dimension | |
| Number of training samples |
Appendix figures & tables1 asset
Supplementary material from the paper’s appendix.
Appendix
Quantum Machine Learning
Quantum machine learning uses quantum circuits and quantum data to build learning algorithms and study their computational and statistical limits.
See all 256 papers