betaFeedback

WorksPhysics and Astronomy

Efficient Parameter Estimation through Quantum Extreme Learning

Abstract

Quantum sensing protocols rely on the efficient processing of measurement outcomes to infer unknown physical parameters. Conventional optimal estimators, such as Bayesian inference and maximum likelihood estimation, require to construct a likelihood function whose efficient classical construction requires full knowledge of the dynamics, which may practically be infeasible. Model-free experimental construction of the likelihood is also very resource intensive. Here, we propose a quantum extreme learning-based framework for quantum parameter estimation which avoids the explicit construction of the likelihood function. We demonstrate the effectiveness of this approach using the transverse-field Ising model for estimating the external transverse field. Our results show that high estimation accuracy can be achieved using measurements at only a small number of training points. We further develop an interrogation-time optimization strategy that minimizes the estimation inaccuracy while keeping sampling fluctuations below a prescribed threshold. We further extend the framework to a two-time measurement protocol, in which measurement outcomes obtained at two distinct times are combined to enrich the feature space, thereby significantly enhancing the estimation accuracy. Our analysis shows that the estimation precision improves monotonically with the number of training points, while increasing the system size generally enhances the sensing performance, albeit non-monotonically. Finally, the protocol is shown to be robust against dephasing, making it suitable for near-term quantum devices.

Introduction

Quantum sensing has emerged as one of the most promising applications of quantum technologies [1, 2, 3, 4, 5], offering unprecedented precision in estimation of physical parameters through exploiting quantum features such as entanglement [6, 7, 8], squeezing [9] and criticality [10, 11]. A typical quantum sensing protocol involves four essential steps: (i) preparation of an appropriate quantum probe; (ii) encoding of the unknown parameter through the dynamics of the probe; (iii) measurement of a suitable observable on the evolved probe; and (iv) feeding the measurement outcomes into an estimator to infer the unknown parameter. Ideally, for a given probe, one has to optimize both the measurement and the estimator to achieve the best possible performance. However, in many practical scenarios, measurement operations are constrained by experimental limitations and are often restricted to specific local measurement bases. In contrast, estimators offer greater flexibility, as they are part of the classical post-processing of the measurement data.

Bayesian inference and its closely related maximum likelihood estimation are proven to be the optimal estimators in the asymptotic limit of large measurement samples [12, 13, 14, 15, 16, 17, 18, 19, 20]. These estimators aim to infer the unknown parameter hh by constructing a probability distribution, known as the posterior, conditioned on the observed measurement outcomes. Based on Bayes’ theorem, the posterior probability distribution p(h∣data)p(h|\mathrm{data}) can be written as p(h∣data)∝p(data∣h)p(h)p(h|\mathrm{data}) \propto p(\mathrm{data}|h)p(h). Here, p(h)p(h) is the prior distribution, which quantifies the information available about the unknown parameter before any measurements are performed, and p(data∣h)p(\mathrm{data}|h) is the likelihood function, which describes the probability of observing the measured data given that the unknown parameter takes the value hh. Efficient construction of the likelihood function on a classical computer requires having full knowledge about the probe and its evolution. Moreover, in practice, experimental imperfections often prevent us from having such complete knowledge, as, for instance, Hamiltonian parameters or decoherence effects may not be precisely known. Even if full knowledge of the evolution exists, classical simulation of large quantum systems is in general limited by curse of dimensionality. A possible way to circumvent the classical construction of the likelihood is to adopt a model-free approach, in which the likelihood function is constructed experimentally without any assumption about the details of the evolution. However, this approach is often highly resource-intensive, as it requires a large number of measurement samples to accurately estimate the probability distributions at different, carefully controlled values of hh across the parameter range of interest. This typically involves sampling over a sufficiently fine parameter grid to achieve the desired accuracy (see, e.g., Refs. [22] [21]). This naturally raises an important question: can one develop a model-free and resource-efficient estimator that can infer unknown physical parameters without explicitly constructing the likelihood function?

A possible solution to address the above question is to exploit machine-learning techniques, where the relationship between the unknown parameter and the corresponding measurement outcomes can be learned directly from a set of training data [23, 24, 25, 26, 27, 28], thereby avoiding the explicit construction of the likelihood function. In this context, quantum reservoir computing voir computing [29] and one of its variants, Quantum Extreme Learning (QEL) [30], have recently emerged as promising frameworks that exploit the complex dynamics of quantum systems for solving various tasks, including entanglement detection [31], quantum state characterization [32], time-series analysis [32, 33, 34, 35, 36, 37, 38, 39, 40, 41], solving nonlinear difference equations [42, 43, 44], chaos characterization [35, 45] and image processing [46]. In these reservoir-based learning methods, the input information is encoded into a quantum system, whose dynamics generate a high-dimensional representation of the input. The resulting information is extracted through measurements of selected observables and processed using a trainable classical readout layer [29, 30]. Unlike conventional variational quantum algorithms [47], which require optimizing a large number of parameters governing the quantum dynamics, these reservoir-based computing methods rely on fixed reservoir dynamics, with training restricted to the classical readout. Thus, one may wonder whether QEL can also be used as an efficient estimator that can directly infer the unknown physical parameters through measurement data.

In this work, we propose a QEL-based framework for estimating an unknown parameter encoded in the reservoir Hamiltonian. Unlike conventional QEL approaches, in which the quantum system serves as a processor for externally supplied information, our protocol keeps the input state fixed and instead exploits the parameter-dependent system dynamics to infer the unknown parameter. We demonstrate the effectiveness of our approach using the transverse-field Ising model, where the external transverse field is the parameter to be estimated. Our results show that it is possible to achieve high sensing precision using measurements at only a small number of controlled values of the parameter as the training points. Furthermore, we develop an interrogation-time optimization procedure that minimizes the estimation error while ensuring that sample fluctuations remain below a prescribed threshold. This optimization reveals that the protocol efficiently reaches high accuracy at a fairly fast evolution time. We further extend the QEL framework to a two-time measurement protocol, in which measurement outcomes at two different times are combined to enlarge the feature space, thereby significantly enhancing the estimation precision. Moreover, our results show that the estimation precision improves monotonically with the number of training points. Increasing the system size also generally enhances the estimation precision, although the improvement is not strictly monotonic. Finally, the protocol is shown to be robust against dephasing and thus can be used in existing quantum devices.

The paper is organized as follows: In Sec. II, we begin by introducing the protocol for estimating the parameter using QEL. Then, in Sec. III, we consider the transverse-field Ising spin chain to demonstrate the efficiency of the proposed scheme. We discuss the numerical findings in Sec. IV. The robustness of the method in the presence of the environment is addressed in Sec. V. Finally, we conclude in Sec. VI.

Quantum Extreme Learning-Based Sensing

QEL has emerged as a paradigm for quantum machine learning with various applications [31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46]. Conventionally, information is encoded in the initial state of the system which is subsequently evolved by a fixed quantum reservoir [48]. After the evolution, some local operators are measured and their averages are used for estimating the parameter of interest [29, 30]. In contrast, our proposed approach considers a quantum reservoir whose Hamiltonian itself depends on an unknown parameter that we aim to estimate. Consequently, the parameter is not encoded in the initial state but in the reservoir dynamics. By measuring suitable observables of the evolved state, we extract information about the unknown parameter and use a trained classical readout to estimate its value.

Consider a reservoir whose Hamiltonian HhH_h depends on an unknown parameter hh. Our objective is to estimate this parameter using QEL. The proposed protocol consists of four steps. (i) Preparation of initial state: To encode the parameter, we consider an initial state ∣ψ(0)⟩|\psi(0)\rangle that should not be an eigenstate of HhH_h. (ii) Encoding via evolution: At first, let us assume that the system is a closed system and the parameter is encoded in the initial state via unitary evolution governed by the unitary Uh=exp⁡(−iHht)U_h=\exp(-\mathrm{i}H_ht). The evolved state reads as ∣ψh(t)⟩=Uh∣ψ(0)⟩|\psi_h(t)\rangle=U_h|\psi(0)\rangle, where tt is the total time of evolution. (iii) Readout: After the system evolves for a time tt, the expectation values of a set of LL local observables {Oj}\{O_j\}, j=1,2,…,Lj=1,2,\ldots,L, are computed. The expectation values are collected into a vector with LL elements as

V(h,t)=(⟨O1⟩,⟨O2⟩,…,⟨OL⟩)T(1)\mathbf{V}(h,t)=\left(\langle O_1\rangle,\langle O_2\rangle,\ldots,\langle O_L\rangle\right)^{T} \tag*{(1)}

where ⟨Oj⟩=⟨ψh(t)∣Oj∣ψh(t)⟩\langle O_j\rangle=\langle\psi_h(t)|O_j|\psi_h(t)\rangle represents the average of the operator OjO_j with respect to ∣ψh(t)⟩|\psi_h(t)\rangle. (iv) Parameter estimation: We assume that the parameter hh can be estimated from the measurement vector V(h,t)\mathbf{V}(h,t) through linear regression hest=W(t)V(h,t)h_{\mathrm{est}}=\mathbf{W}(t)\mathbf{V}(h,t), where W(t)\mathbf{W}(t) is a trainable weight matrix of size 1×L1\times L.

The key point in the above protocol is to find the optimal weight matrix W\mathbf{W}. To train the matrix W\mathbf{W}, we choose NtrN_{\mathrm{tr}} samples of the parameter hh and make a vector htr=(h1,h2,…,hNtr)T\mathbf{h}_{\mathrm{tr}}=(h_1,h_2,\ldots,h_{N_{\mathrm{tr}}})^{T} from a specified interval h∈[hmin⁡,hmax⁡]h\in[h_{\min},h_{\max}]. For each of these training points, the corresponding feature vector V(h,t)\mathbf{V}(h,t) is constructed from the expectation values of the measured observables. These feature vectors are then arranged column-wise to form the training matrix

Mtr=[V(h1,t),V(h2,t),…,V(hNtr,t)].(2)\mathbf{M}_{\mathrm{tr}}=\left[\mathbf{V}(h_1,t),\mathbf{V}(h_2,t),\ldots,\mathbf{V}(h_{N_{\mathrm{tr}}},t)\right]. \tag*{(2)}

The task of parameter estimation is then reduced to determining an optimal set of classical readout weights W\mathbf{W} that maps the measured features to the corresponding parameter values. To this end, we employ ridge regression and minimize the loss function, defined via the Frobenius norm

L(W)=∥WMtr−htr∥F2,(3)\mathcal{L}(\mathbf{W})=\left\|\mathbf{W}\mathbf{M}_{\mathrm{tr}}-\mathbf{h}_{\mathrm{tr}}\right\|_{F}^{2}, \tag*{(3)}

Minimizing this loss function with respect to matrix W\mathbf{W} yields the optimal readout weights [49, 50, 51]

Wopt(t)=htrMtrT(MtrMtrT+ϵI)−1.(4)\mathbf{W}^{\mathrm{opt}}(t)=\mathbf{h}_{\mathrm{tr}}\mathbf{M}_{\mathrm{tr}}^{T}\left(\mathbf{M}_{\mathrm{tr}}\mathbf{M}_{\mathrm{tr}}^{T}+\epsilon\mathbf{I}\right)^{-1}. \tag*{(4)}

Here, ϵ>0\epsilon>0 is a small regularization parameter to ensure the matrix remains non-singular. For all numerical calculations, the regularization parameter is fixed at ϵ=10−8\epsilon=10^{-8}.

Once the training is completed, the optimal weights are kept fixed. To see the effectiveness of the protocol, we should test its performance on unseen values of hh which are not included in the training set htr\mathbf{h}_{\mathrm{tr}}. Thus, we consider a test set h=(h1,h2,…,hNtest)T\mathbf{h}=(h_1,h_2,\ldots,h_{N_{\mathrm{test}}})^T and construct its corresponding matrix from the measurement outcomes Mtest(h,t)\mathbf{M}_{\mathrm{test}}(h,t). The estimated value is obtained as

hest(t)=Wopt(t)Mtest(h,t).(5)\mathbf{h}_{\mathrm{est}}(t)=\mathbf{W}^{\mathrm{opt}}(t)\mathbf{M}_{\mathrm{test}}(h,t). \tag*{(5)}

where, hest(t)=(h^1(t),h^2(t),…,h^Ntest(t))T\mathbf{h}_{\mathrm{est}}(t)=(\hat{h}_1(t),\hat{h}_2(t),\ldots,\hat{h}_{N_{\mathrm{test}}}(t))^T. To quantify the accuracy of the estimation protocol, we calculate the root-mean-square error (RMSE), defined as

RMSE(t)=1Ntest∑k=1Ntest[h^k(t)−hk]2.(6)\mathrm{RMSE}(t)=\sqrt{\frac{1}{N_{\mathrm{test}}}\sum_{k=1}^{N_{\mathrm{test}}}\left[\hat{h}_k(t)-h_k\right]^2}. \tag*{(6)}

Note that RMSE(t)(t) is also a function of the total number of qubits NN, and the number of training points NtrN_{\mathrm{tr}}.

It is worth emphasizing that while RMSE provides a good figure of merit for quantifying the accuracy of our sensing protocol, it requires to measure expectation values of several local operators, see Eq. (1). Those expectation values, however, must be interpreted in the limit of infinite samplings. For any finite number of samples per qubit MM, the expectation value of the local operator OjO_j can only be estimated within a precision range determined by statistical fluctuations given by [⟨Oj2⟩−⟨Oj⟩2]/M\sqrt{[\langle O_j^2\rangle-\langle O_j\rangle^2]/M}. Consequently, a protocol exhibiting a small RMSE may still require a large number of measurements to achieve the desired estimation precision. Therefore, to provide a more comprehensive assessment of the proposed scheme, it is important to investigate how these measurement fluctuations propagate into the estimated parameter. To quantify this effect, we introduce the standard deviation σ\sigma of the estimated parameter for a single-shot measurement, i.e. M=1M=1, defined as

σ(h,t)=∑j=12NWj2(t)[⟨Oj2⟩−⟨Oj⟩2].(7)\sigma(h,t)=\sqrt{\sum_{j=1}^{2N}W_j^2(t)\left[\langle O_j^2\rangle-\langle O_j\rangle^2\right]}. \tag*{(7)}

which characterizes its statistical uncertainty arising from quantum measurement fluctuations. For finite MM, the fluctuations can always be estimated from this single-shot quantity as σ(h,t)/M\sigma(h,t)/\sqrt{M}. Note that in the above equation, we assume that every local operator OjO_j is measured independently. If one measures those operators simultaneously, then covariances of multi-body operators have to be included in the computation of the above standard deviation. For simplicity and without loss of generality, we restrict ourselves to Eq. (7). Thus, to make sure that the statistical error does not become larger than a specified threshold, one has to choose the samples size per qubit MM accordingly. The total measurement cost of the protocol then would be MLML.

In order to get a quantity independent of the unknown parameter hh one can compute the average of σ\sigma with respect to hh as

σ‾(t)=1Ntest∑k=1Ntestσ(hk,t).(8)\overline{\sigma}(t)=\frac{1}{N_{\mathrm{test}}}\sum_{k=1}^{N_{\mathrm{test}}}\sigma(h_k,t). \tag*{(8)}

It is worth emphasizing that, in the quantum sensing community, sensing “accuracy” refers to the deviation from the true parameter value and is thus quantified by RMSE. On the other hand, sensing “precision” refers to the statistical uncertainty for a finite number of samples and is quantified by σ(h,t)\sigma(h,t). If this quantity remains almost independent of hh, as we will see is the case in our model, then one can use σ‾(t)\overline{\sigma}(t) as a measure of precision. Throughout this paper we use the same terminology and refer to RMSE as the accuracy and σ‾(t)\overline{\sigma}(t) as precision.

the Model

To demonstrate the effectiveness of the proposed scheme, we consider a transverse field Ising chain of size NN with open boundary conditions. The Hamiltonian reads as

H=−J[∑i=1N−1XiXi+1+h∑i=1NZi],(9)H=-J\left[\sum_{i=1}^{N-1}X_iX_{i+1}+h\sum_{i=1}^{N}Z_i\right], \tag*{(9)}

where XX and ZZ are the Pauli matrices. JJ is the interaction strength between the nearest-neighbor qubits and hh is a dimensionless quantity denoting the strength of the transverse field with respect to the exchange coupling. For all the numerical simulations, we restrict the value of h∈[0,2]h\in[0,2]. We consider an initial state as

∣ψ(0)⟩=⨂j=1N/2(∣02j−1⟩⊗∣+2j⟩),(10)|\psi(0)\rangle=\bigotimes_{j=1}^{N/2}\left(|0_{2j-1}\rangle\otimes|+_{2j}\rangle\right), \tag*{(10)}

where ∣0⟩|0\rangle and ∣+⟩|+\rangle are the eigenbasis of ZZ and XX, respectively. The motivation for choosing this initial state is that it is not an eigenstate of the Hamiltonian throughout the entire range of the parameter hh. Consequently, the state exhibits nontrivial dynamics in both limiting cases, allowing information about the Hamiltonian parameters to be encoded in its time evolution. The transverse-field Ising model is exactly solvable through the Jordan–Wigner transformation [52], which maps the spin operators onto fermionic operators. By introducing Majorana operators, the Hamiltonian in Eq. (9) can be expressed in the quadratic form H=(i/4)γTAγH=(i/4)\gamma^T A\gamma, where AA is a real antisymmetric matrix of dimension 2N×2N2N\times2N. This representation avoids the exponential growth of the Hilbert-space dimension encountered in exact diagonalization and enables efficient numerical simulations for substantially larger system sizes [53]. The details of the Hamiltonian diagonalization is given in Appendix § 1.3.1.

Let us consider a set of NtrN_{\mathrm{tr}} training values of the parameter hh, denoted by Htr=(h1tr,…,hNtrtr)\mathcal{H}_{\mathrm{tr}}=(h^{\mathrm{tr}}_1,\ldots,h^{\mathrm{tr}}_{N_{\mathrm{tr}}}). For each training value hitrh_i^{\mathrm{tr}}, the corresponding parameter-encoded state ∣ψ(hitr,t)⟩\lvert\psi(h_i^{\mathrm{tr}},t)\rangle is obtained by evolving the initial state under the unitary operator U(hitr,t)=exp⁡[−iH(hitr)t]U(h_i^{\mathrm{tr}},t)=\exp[-iH(h_i^{\mathrm{tr}})t]. For this model, we calculate the feature vector as

V(hitr,t)=(⟨X1⟩,⟨X2⟩,…,⟨XN⟩,⟨Z1⟩,…,⟨ZN⟩)T(11)\mathbf{V}(h_i^{\mathrm{tr}},t)=\left(\langle X_1\rangle,\langle X_2\rangle,\ldots,\langle X_N\rangle,\langle Z_1\rangle,\ldots,\langle Z_N\rangle\right)^T \tag*{(11)}

where, ⟨Xi⟩=⟨ψ(t)∣Xi∣ψ(t)⟩\langle X_i\rangle=\langle\psi(t)|X_i|\psi(t)\rangle and ⟨Zi⟩=⟨ψ(t)∣Zi∣ψ(t)⟩\langle Z_i\rangle=\langle\psi(t)|Z_i|\psi(t)\rangle. Therefore, the feature vector V(hitr,t)\mathbf{V}(h_i^{\mathrm{tr}},t) has dimensions 2N×12N\times1, namely L=2NL=2N. For large system sizes NN, these time-dependent local spin expectation values, which serve as reservoir features, can be calculated using the corresponding Majorana correlation functions, see Appendix § 1.3.1 for more details.

Numerical Results

Having established the training procedure and the transverse Ising model as our reservoir, we now investigate the performance of the proposed quantum extreme learning-based parameter estimation protocol. In Figure 1(a)-(Figure 1c) we plot the estimated value h^\hat{h} as a function of true value hh for a system of size N=18N=18 and fixing time to t=0.25N/Jt=0.25N/J for different number of training points NtrN_{\mathrm{tr}}. Here, we consider 200 test values of hh in the interval h∈[0,2]h \in[0,2]. As the figure shows, by increasing the number of training points the estimated values of the transverse magnetic field approach their corresponding true values over the entire interval. Remarkably, even with Ntr=15N_{\mathrm{tr}}=15 training points, the maximum absolute error MAE=max⁡1≤k≤Ntest∣h^k(t)−hk∣\mathrm{MAE}=\max_{1\leq k\leq N_{\mathrm{test}}}|\hat{h}_k(t)-h_k| is as low as 0.01342 demonstrating the effectiveness of the proposed estimation protocol (see Table I).

Comparison of parameter estimation accuracy for different numbers of training points

Figure 1. Comparison of parameter estimation accuracy for different numbers of training points NtrN_{\mathrm{tr}}. Upper panel: Estimated parameter (h^\hat{h}) as a function of its true value (hh) for different training-set sizes NtrN_{\mathrm{tr}}, at a fixed evolution time t=0.25N/Jt=0.25N/J. The black dashed line represents perfect estimation h^=h\hat{h}=h, while the blue circles indicate the training points. Lower panel: Root-mean-square error (RMSE) as a function of the normalized evolution time (Jt/NJt/N) for the corresponding training-set sizes. Here N=18N=18 and h∈[0,2]h \in[0,2].

To see the effect of time on the performance of the protocol, in Figure 1(d)-(Figure 1f) we plot RMSE as a function of time for a reservoir of size N=18N=18 for different number of training points NtrN_{\mathrm{tr}}. As expected, the RMSE is maximum at t=0t=0, since the initial state does not contain any information about the unknown parameter hh. Interestingly, as the evolution time increases, the RMSE decreases and reaches a minimum at an optimal time t=t∗t=t^*, beyond which it increases again and eventually tends to stabilize. Nonetheless, the minimum of RMSE

NtrN_{\mathrm{tr}}MAEhhh^\hat{h}
50.5621890.251256-0.310933
100.3349471.0050250.670078
150.0134151.9396981.953114

caption: Maximum absolute error in the estimation of the transverse magnetic field hh for different numbers of training points NtrN_{\mathrm{tr}}. The corresponding true and estimated values of hh at which the maximum error occurs are also reported.

decreases by increasing the training points and the optimal time t∗t^* changes as NtrN_{\mathrm{tr}} varies. This behavior highlights the crucial role of the evolution time in determining the performance of the proposed sensing protocol.

Note that in non-equilibrium quantum sensing protocols in which the probe undergoes a unitary evolution, typically the ultimate precision limit (which assumes optimal measurements), quantified by quantum Fisher information [54, 55, 56], scales quadratically in time (i.e. ∼t2\sim t^2) [57, 58, 59], whereas our restricted local-Pauli strategy does not. The suboptimal performance can be attributed to two main factors: (i) our measurements are restricted to local Pauli operators, which generally differ from the optimal measurement basis required to saturate the quantum Fisher information bound; and (ii) we only rely on the expectation values of measurement outcomes, which, although experimentally convenient, capture less information than the full probability distributions of all possible measurement outcomes. Consequently, only a restricted portion of the parameter-dependent information encoded in the evolved state is accessible through the expectation values of local measurements. As the system evolves, the reduced density matrices of individual qubits initially accumulate information about the unknown field, as reflected in the decreasing RMSE. Eventually, they equilibrate and their information content saturates, as reflected in the long-time saturation of the RMSE in Figure 1(d)-(Figure 1f). To understand this, in Figure 2, we plot the expectation values ⟨Xj⟩\langle X_j\rangle and ⟨Zj⟩\langle Z_j\rangle as functions of hh at two different evolution times in a reservoir of size N=4N=4. At the shorter time, t=0.76/Jt=0.76/J (see Figure 2 (a) and (c)), corresponding to the minimum RMSE, the expectation values exhibit relatively smooth variations with hh, providing a more distinguishable relationship between the measurement outcomes and the unknown parameter. In contrast, at the longer time, t=4.8/Jt=4.8/J (see Figure 2 (b) and (d)), the observables develop pronounced oscillations and non-monotonic behavior, such that different values of hh can produce similar local expectation values. This makes the inverse mapping from the measured observables to the transverse field increasingly ambiguous and more difficult to learn from a finite training set. This behavior is directly related to exponential concentration issue which is known to be limiting factor to all quantum reservoir based computing schemes such as QEL [60, 61, 62]. Therefore, although longer evolution can enhance the parameter sensitivity of the quantum state, this enhancement does not necessarily translate into improved estimation accuracy when only a limited set of local observables is employed.

Variation of the expectation values of the local observables $X_i$ and $Z_i$ as functions of the transverse field $h$ for a system of $N=4$

Figure 2. Variation of the expectation values of the local observables XiX_i and ZiZ_i as functions of the transverse field hh for a system of N=4N=4. The evolution time t=0.76/Jt=0.76/J corresponds to the minimum root-mean-square error (RMSE), while t=4.8/Jt=4.8/J represents an intermediate stage of the system’s evolution.

Since, in this protocol, we are mainly concerned about the expectation values of the Pauli operators, i.e. Oj=Xj\mathcal{O}_j=X_j, ZjZ_j, Eq. (7) reduces to

σ(h,t)=∑j=12NWj2(t)[1−⟨Oj⟩2](12)\sigma(h,t)=\sqrt{\sum_{j=1}^{2N}W_j^2(t)\left[1-\langle\mathcal{O}_j\rangle^2\right]} \tag*{(12)}

where,

Oj={Xj,1≤j≤N,Zj−N,N+1≤j≤2N.(13)\mathcal{O}_j= \begin{cases} X_j, & 1\leq j\leq N,\\ Z_{j-N}, & N+1\leq j\leq2N. \end{cases} \tag*{(13)}

In Figure 3(a)-(Figure 3c), we plot σ(h,t)\sigma(h,t) as a function of parameter hh and time tt for a reservoir of size N=18N=18 and different number of training points NtrN_{\mathrm{tr}}, respectively. Interestingly, regardless of the number of training points, measurement uncertainty is nearly uniform with respect to hh but varies in time. This motivates us to define the average single-shot measurement uncertainty σ‾(t)\overline{\sigma}(t), see Eq. (8), as the precision our protocol.

Heat maps of single-shot measurement uncertainty for $N_{\mathrm{tr}}=5$, $10$, and $15$

Figure 3. Single-shot measurement uncertainty σ\sigma as a function of normalized time and real values of hh. Here N=18N=18.

Strategy for choosing the measurement time

As shown before, both the RMSE and the average single-shot measurement uncertainty σ‾(t)\overline{\sigma}(t) are functions of time. Ideally, we would like to minimize both quantities simultaneously. However, their minima do not coincide at the same time. Thus, we need to find a proper strategy to fix the measurement time in order to achieve the best possible RMSE while keeping the sample fluctuation σ‾(t)\overline{\sigma}(t) small enough that does not affect the performance. To establish a strategy for fixing the measurement time, we first impose a constraint σ‾(t)≤C\overline{\sigma}(t)\leq C, where CC is a constant. This constant defines certain time intervals during which σ‾(t)\overline{\sigma}(t) always remains below

C.

Consequently, for MM measurement samples, the estimation uncertainty will be lower than C/MC/\sqrt{M}. Thus, by controlling the constant CC and the sample size MM, one can control the fluctuations in the final estimation. In our transverse Ising model, we find that C=4C=4 is a reasonable choice: it can be achieved during several time windows and simultaneously allows for a small final uncertainty while keeping the number of measurement samples at M∼104M\sim10^{4}–10510^{5}, as typically used in many quantum experiments. Now, we minimize the RMSE (i.e. enhancing the accuracy) subject to a precision constraint (σˉ(t)≤C)(\bar{\sigma}(t)\leq C) to obtain the optimal time t∗t^{*}. This strategy results in the minimum RMSE conditioned to keeping the final uncertainty below C/MC/\sqrt{M}. Mathematically, one can summarize the strategy as

t∗=arg⁡min⁡t∈T RMSE(t),(14)t^{*}=\underset{t\in\mathcal{T}}{\arg\min}\,\mathrm{RMSE}(t), \tag*{(14)}

where T\mathcal{T} denotes those time intervals that σˉ(t)≤C\bar{\sigma}(t)\leq C.

So far, we have considered a single-time measurement protocol, where the unknown parameter is estimated using the expectation values of local observables evaluated at a fixed evolution time t=t∗t=t^{*}. However, the information about the unknown parameter is encoded in the time evolution of the quantum system, and measurements at a single instant may not fully capture this information. This motivates us to extend the proposed scheme by incorporating measurements at two distinct evolution times. Specifically, we consider measurements at t−Δtt-\Delta t and t+Δtt+\Delta t, where Δt\Delta t is a fixed time interval, to keep the average time equal to tt. The expectation values obtained at these two times are combined to construct an enlarged feature vector with L=4NL=4N, basically the double sized of the vector in Eq. (11). Consequently, the subsequent training procedure results in a weight matrix Wopt\mathbf{W}^{\mathrm{opt}} whose size is double the size of weight matrix in the case of a single-time measurement. The two-time measurement protocol is expected to be more informative about the unknown parameter hh. This is because if the expected measurement outcomes at one time are not capable of uniquely determining the value of hh, the measurement outcomes at the other time may compensate and enhance the performance. While we fix Δt=0.5/J\Delta t=0.5/J in the two-time measurement protocol, we use the same strategy of of Eq. (14) for optimizing the time tt. However, to have a fair comparison between one-time and two-time measurement protocols one has to keep the total number of measurements the same. Since two-time measurement protocol requires twice more operator expectations, namely ⟨Oj⟩(t)\langle O_j\rangle(t) and ⟨Oj⟩(t+Δt)\langle O_j\rangle(t+\Delta t), one can reduce the measurement budget for each expectation value to M/2M/2. Therefore, for direct comparison between the two protocols, we renormalize the definition for the two-time measurement protocol as

σ(h,t)=2(∑j=12NWj2[1−⟨Oj(t)⟩2]+∑j=2N+14NWj2[1−⟨Oj(t+Δt)⟩2])1/2(15)\sigma(h,t)=\sqrt{2}\left(\sum_{j=1}^{2N} \mathbf{W}_j^2\left[1-\langle O_j(t)\rangle^2\right]+\sum_{j=2N+1}^{4N}\mathbf{W}_j^2\left[1-\langle O_j(t+\Delta t)\rangle^2\right]\right)^{1/2} \tag*{(15)}

where the 2\sqrt{2} coefficient takes care of the measurement budgeting, explained above. One then can compute the average single-shot measurement uncertainty σˉ(t)\bar{\sigma}(t) for two-time measurement protocol using Eq. (8).

The impact of training points

In this part, we investigate the effect of training points on the performance of our extreme learning based sensing protocol. By choosing the optimal time t∗t^*, through the procedure in Eq. (14), one can quantify the performance of the protocol using two main figures of merit, namely RMSE(t∗t^*) and σˉ(t∗)\bar{\sigma}(t^*). In Figure 4(a)-(Figure 4c), we plot RMSE(t∗t^*) for both single- and two-time measurement protocols as a function of the number of training points NtrN_{\mathrm{tr}} for three different system sizes, respectively. Two clear features can be observed. First, as the number of training points NtrN_{\mathrm{tr}} increases the two-time measurement protocol achieves significantly lower values of RMSE than the single-time measurement protocol, demonstrating the superiority of its performance. Second, both single- and two-time measurement protocols show almost monotonic improvements by increasing the number of training points NtrN_{\mathrm{tr}}. In Figs. 4(d)-4(f), we plot the corresponding average measurement uncertainty σ‾(t)\overline{\sigma}(t) for both single- and two-time measurement protocols as a function of NtrN_{\mathrm{tr}} for three different system sizes, respectively. While there is no monotonic behavior, the figures clearly show that uncertainty remains bounded for all the values of NtrN_{\mathrm{tr}}. This is not surprising as the time optimization protocol naturally constrains σ‾(t)\overline{\sigma}(t) to be lower than C=4C=4.

Minimum RMSE and average uncertainty as functions of the number of training points

Figure 4. Minimum RMSE and average uncertainty σˉ\bar{\sigma} as functions of the number of training points NtrN_{\mathrm{tr}}. The average uncertainty σˉ\bar{\sigma} is evaluated over 200 test values of hh in the interval h∈[0,2]h \in[0,2]. The optimal evolution time t∗t^{*} is determined by minimizing the RMSE subject to the constraint σˉ≤4\bar{\sigma}\leq4. The different columns correspond to system sizes N=8N=8, 1616, and 2424, respectively. For the two-time measurement scheme, we fixed Δt=0.5/J\Delta t=0.5/J.

The impact of reservoir size

So far, we have examined the influence of the optimal evolution time and the number of training points on the estimation accuracy for a fixed reservoir size. We now turn our attention to how the system size affects the accuracy of transverse-field estimation. In Figure 5, we present the RMSE, the corresponding average uncertainty σ‾\overline{\sigma}, computed at the optimal time t∗t^{*}. As illustrated in Figure 5(a)-5(c), increasing NN generally leads to improved estimation accuracy, although this advantage becomes less pronounced as the training set grows. This behavior suggests that, beyond a certain training capacity, the additional information gained by enlarging the system becomes progressively less significant, indicating a tendency toward saturation in the estimation performance. Notably, despite the overall improvement, the RMSE does not exhibit any clear scaling behavior with NN. A possible explanation lies in the nearest-neighbor nature of the interactions, together with the restriction to local observables as measurement features. Under these conditions, increasing the number of spins does not necessarily translate into a corresponding enhancement of the information accessible for parameter estimation. Consequently, increasing the system size does not necessarily provide a proportional increase in the information accessible through these measurements.

Minimum root-mean-square error and average uncertainty as functions of the number of qubits

Figure 5. Minimum root-mean-square error (RMSE) and average uncertainty σˉ\bar{\sigma} as functions of the number of qubits NN. The average uncertainty σˉ\bar{\sigma} is evaluated over 200 test values of hh in the interval h∈[0,2]h \in[0, 2]. The optimal evolution time t∗t^* is determined by minimizing the RMSE subject to the constraint σˉ≤4\bar{\sigma} \leq4. The different columns correspond to different numbers of training points, Ntr=5N_{\mathrm{tr}} = 5, 15, and 30, respectively.

However, the two-time protocol consistently achieves a lower RMSE than the single-time protocol for moderate to large training values, highlighting the advantage of incorporating information from multiple evolution times. The corresponding average uncertainties, shown in Figure 5(d)-5(f), are also generally lower for the two-time protocol, particularly for larger system sizes. Finally, Figure 5(g)-5(i) illustrate the dependence of the optimal evolution time on NN. Although the optimal times fluctuate with system size, no systematic dependence on NN is evident within the investigated range.

Robustness in the presence of decoherence

So far, we have investigated the performance of the proposed parameter estimation protocol via QEL under unitary dynamics, where the parameter is encoded in the quantum state through coherent evolution. However, in realistic scenarios, quantum systems inevitably interact with their surrounding environment, which can affect the estimation accuracy [63, 64, 65, 66, 67]. In this section, we extend our analysis to open quantum systems and investigate the effects of environmental noise on the performance of the proposed protocol. We consider local dephasing acting on all qubits while we are still interested in sensing the transverse field hh. The evolution of the system is described by the following Lindblad master equation

dρdt=−i[H(h),ρ]+κ∑j=1N(ZjρZj−ρ),(16)\frac{d\rho}{dt}=-i[H(h),\rho]+\kappa\sum_{j=1}^{N}(Z_j\rho Z_j-\rho), \tag*{(16)}

where κ\kappa is the strength of dephasing noise. In order to study the effect of dephasing, in Figure 6(a)-6(c), we plot the RMSE, computed for a two-time measurement strategy, as a function of time in a reservoir of size N=10N=10 for three different number of training points and various values of dephasing strength κ\kappa. As the figure shows, in short time scales, the effect of dephasing is negligible and the performance remains robust and only at longer time scales the dephasing becomes important and deteriorates the accuracy. In particular, for larger number of training points, the minimum of the RMSE, which is the relevant quantity for our estimation procedure, is hardly affected by dephasing, unless it is as strong as κ≈J\kappa\approx J. In Figure 6(d)-6(f) we plot the corresponding single-shot sample uncertainty σ‾(t)\overline{\sigma}(t) as a function of time. A similar behavior can also be observed here, showing that dephasing increases the sample uncertainty, however, at short time scales where the sensing is performed, the protocol is quite robust and its performance is not affected much unless the noise becomes very strong such as κ≈J\kappa\approx J. This demonstrates that the QEL-based sensing protocol is quite robust against dephasing and thus can be implemented in near-term quantum devices.

Figure 6. The effect of decoherence on the performance of RMSE as a function of normalized time Jt/NJt/N in the two-time measurement protocol (with Δt=0.5/J\Delta t=0.5/J) for a probe of size N=10N=10 and the training point of: (a) Ntr=10N_{\rm tr}=10; (b) Ntr=15N_{\rm tr}=15; and (c) Ntr=20N_{\rm tr}=20. The corresponding sampling error σ(t)\sigma(t) under the action of dephasing for training points of: (d) Ntr=10N_{\rm tr}=10; (e) Ntr=15N_{\rm tr}=15; and (f) Ntr=20N_{\rm tr}=20.

conclusion

In this work, we have proposed a QEL-based framework for estimating unknown parameters encoded in the Hamiltonian of a many-body quantum system. Unlike conventional QEL protocols, which encode input information in the initial quantum state, our approach employs a fixed input state and encodes the unknown parameter through the subsequent system dynamics. By combining the expectation values of local observables measured after the reservoir evolution with a trainable classical readout, the proposed framework enables parameter estimation without requiring the explicit construction or evaluation of computationally demanding likelihood functions.

To demonstrate the effectiveness of the proposed approach, we have considered the transverse-field Ising model, where the transverse magnetic field is treated as the unknown parameter. We have four main results. First, our numerical results show that accurate parameter estimation can be achieved using a relatively small number of training points. Second, we have developed an interrogation-time optimization method which minimizes the inaccuracy, quantified by RMSE, while ensuring that sample fluctuations remain below a prescribed threshold. This optimization show that the protocol is very efficient achieving high accuracy within a fairly short time scale. Third, by extending our framework to a two-time measurement protocol, the accuracy is significantly improved while the sampling uncertainty still remains below the prescribed threshold. Fourth, our protocol is shown to be robust against dephasing making it suitable for realizing on near-term quantum devices. Our results, show that QEL can provide an effective alternative approach to optimal estimator protocols, such as Bayesian inference and maximum likelihood functions, which rely on construction of resource demanding likelihood functions.

Acknowledgment

A.B. acknowledges support from the National Natural Science Foundation of China (grants No. W2541020, No. 12274059, No. 12574528, and No. 1251101297). V.M. thanks support from the National Natural Science Foundation of China Grants No. 12374482 and No. W2432005.

Diagonalization of the Hamiltonian and evaluation of observables

Here, we describe the procedure used to evaluate the local spin expectation values entering the quantum reservoir feature vector. Although the transverse-field Ising model is exactly solvable by mapping it onto a quadratic fermionic Hamiltonian, the evaluation of local observables requires additional care because of the particular initial state considered in this work. In particular, the expectation values of σjx\sigma_j^x involve odd products of Majorana operators, which cannot be evaluated using the conventional covariance-matrix formulation of Wick’s theorem alone.

Mapping the transverse-field Ising Hamiltonian to Majorana fermions

We consider the transverse-field Ising Hamiltonian with open boundary conditions,

H=−J∑i=1N−1XiXi+1−h∑i=1NZi,(17)H=-J\sum_{i=1}^{N-1}X_iX_{i+1}-h\sum_{i=1}^{N}Z_i, \tag*{(17)}

where JintJ_{\rm int} is the nearest-neighbor interaction strength and hloch_{\rm loc} is the transverse magnetic field to be estimated. To express the Hamiltonian in terms of fermionic degrees of freedom, we introduce the Jordan–Wigner Majorana operators

γ2j−1=(∏k=1j−1σkz)σjx,(18)\gamma_{2j-1}=\left(\prod_{k=1}^{j-1}\sigma_k^z\right)\sigma_j^x, \tag*{(18)}
γ2j=(∏k=1j−1σkz)σjy,(19)\gamma_{2j}=\left(\prod_{k=1}^{j-1}\sigma_k^z\right)\sigma_j^y, \tag*{(19)}

for j=1,…,Nj=1,\ldots,N. These operators are Hermitian and obey the canonical anticommutation relations

{γa,γb}=2δab.(20)\{\gamma_a,\gamma_b\}=2\delta_{ab}. \tag*{(20)}

Using the Pauli algebra, one obtains

σjz=−iγ2j−1γ2j,(21)\sigma_j^z=-i\gamma_{2j-1}\gamma_{2j}, \tag*{(21)}
σjxσj+1x=−iγ2jγ2j+1.(22)\sigma_j^x\sigma_{j+1}^x=-i\gamma_{2j}\gamma_{2j+1}. \tag*{(22)}

Substituting these identities into Eq. (17), the Hamiltonian becomes

H=iJ∑j=1N−1γ2jγ2j+1+ih∑j=1Nγ2j−1γ2j.(23)H=iJ\sum_{j=1}^{N-1}\gamma_{2j}\gamma_{2j+1}+ih\sum_{j=1}^{N}\gamma_{2j-1}\gamma_{2j}. \tag*{(23)}

Introducing the Majorana vector

γ=(γ1,γ2,…,γ2N)T,(24)\gamma=(\gamma_1,\gamma_2,\ldots,\gamma_{2N})^{T}, \tag*{(24)}

we can write the Hamiltonian in the compact quadratic form

H=i4γTAγ,(25)H=\frac{i}{4}\gamma^{T}A\gamma, \tag*{(25)}

where AA is a real antisymmetric matrix of dimension 2N×2N2N\times2N.

The nonzero entries of AA are

A2j−1,2j=2h,j=1,…,N,(26)A_{2j-1,2j}=2h,\qquad j=1,\ldots,N, \tag*{(26)}
A2j,2j+1=2J,j=1,…,N−1,(27)A_{2j,2j+1}=2J,\qquad j=1,\ldots,N-1, \tag*{(27)}

together with Aba=−AabA_{ba}=-A_{ab}.

Thus, the interacting spin Hamiltonian is transformed into a quadratic fermionic Hamiltonian. This transformation is particularly useful because the dynamics can be determined from a matrix whose dimension grows linearly with the number of spins, rather than from a Hilbert-space matrix of dimension 2N2^N.

Time evolution of Majorana operators

For a quadratic Hamiltonian of the form Eq. (25), the Heisenberg equations of motion are linear:

dγ(t)dt=Aγ(t).(28)\frac{d\gamma(t)}{dt}=A\gamma(t). \tag*{(28)}

Consequently,

γ(t)=R(t)γ(0),R(t)=eAt.(29)\gamma(t)=R(t)\gamma(0),\qquad R(t)=e^{At}. \tag*{(29)}

Since AA is real and antisymmetric, R(t)R(t) is a real orthogonal matrix.

For numerical efficiency, we diagonalize the Hermitian matrix iAiA,

iA=UΛU†,(30)iA=U\Lambda U^{\dagger}, \tag*{(30)}

where Λ\Lambda is a real diagonal matrix. The rotation matrix is then evaluated as

R(t)=Ue−iΛtU†.(31)R(t)=Ue^{-i\Lambda t}U^{\dagger}. \tag*{(31)}

Although the right-hand side is expressed using complex matrices, the resulting rotation matrix is real up to numerical roundoff.

Importantly, this procedure allows the same eigendecomposition to be reused for different evolution times at fixed values of hh and JJ.

References

  1. [1]C. L. Degen, F. Reinhard, and P. Cappellaro, Rev. Mod. Phys. 89, 035002 (2017).
  2. [2]L. Pezzè, A. Smerzi, M. K. Oberthaler, R. Schmied, and P. Treutlein, Rev. Mod. Phys. 90, 035005 (2018).
  3. [3]D. Braun, G. Adesso, F. Benatti, R. Floreaniini, U. Marzolino, M. W. Mitchell, and S. Pirandola, Rev. Mod. Phys. 90, 035006 (2018).
  4. [4]J. Ye and P. Zoller, Phys. Rev. Lett. 132, 190001 (2024).
  5. [5]P. Ghosh, T. K. Konar, D. Rakshit, A. S. De, and U. Sen, Journey in quantum metrology and sensing from foundations to applications: a review (2026), arXiv:2605.21702 [quant-ph].
  6. [6]V. Giovannetti, S. Lloyd, and L. Maccone, Science 306, 1330 (2004).
  7. [7]V. Giovannetti, S. Lloyd, and L. Maccone, Nature photonics 5, 222 (2011).
  8. [8]V. Giovannetti, S. Lloyd, and L. Maccone, Phys. Rev. Lett. 96, 010401 (2006).
  9. [9]L. Pezzè and A. Smerzi, Phys. Rev. Lett. 100, 073601 (2008).
  10. [10]V. Monegro, C. Mukhopadhyay, R. Yousefjani, S. Sarkar, U. Mishra, M. G. Paris, and A. Bayat, Physics Reports 1134, 1 (2025).
  11. [11]G. Mihailescu, U. Alushi, R. Di Candia, S. Felicetti, and K. Gi-etka, PRX Quantum 7, 020201 (2026).
  12. [12]Z. Hradil, R. Myška, J. Peřina, M. Zawisky, Y. Hasegawa, and H. Rauch, Phys. Rev. Lett. 76, 4295 (1996).
  13. [13]L. Pezzè, A. Smerzi, G. Khoury, J. F. Hodelin, and D. Bouwmeester, Phys. Rev. Lett. 99, 223602 (2007).
  14. [14]S. Olivares and M. G. A. Paris, Journal of Physics B: Atomic, Molecular and Optical Physics 42, 055506 (2009).
  15. [15]D. Brivio, S. Cialdi, S. Vezzoli, B. T. Gebrehiwot, M. G. Genoni, S. Olivares, and M. G. A. Paris, Phys. Rev. A 81, 012305 (2010).
  16. [16]M. G. Genoni, S. Olivares, D. Brivio, S. Cialdi, D. Cipriani, A. Santamato, S. Vezzoli, and M. G. A. Paris, Phys. Rev. A 85, 043817 (2012).
  17. [17]R. Blandino, M. G. Genoni, J. Etesse, M. Barbieri, M. G. A. Paris, P. Grangier, and R. Tualle-Brouri, Phys. Rev. Lett. 109, 180402 (2012).
  18. [18]L. Le Cam, Asymptotic methods in statistical decision theory (Springer, New York, 2012).
  19. [19]J. Rubio and J. Dunningham, New Journal of Physics 21, 043037 (2019).
  20. [20]I. Gianani, M. G. Genoni, and M. Barbieri, IEEE Journal of Selected Topics in Quantum Electronics 26, 1 (2020). [21] Y. Yu, R. Liu, G. Xue, C. Yang, C. Wang, J. Zhang, J. Cui, X. Yang, J. Li, J. Han, and H. Yu, Experimental realization of criticality-enhanced global quantum sensing via non-equilibrium dynamics (2025), arXiv:2501.04955 [quant-ph].
  21. [22]H. Li, Y. Yang, Y.-H. Shi, Z.-A. Wang, Z. Wang, J. Li, Y. Zhang, K. Zhao, Y. Xu, C.-L. Deng, Y. Liu, W.-G. Ma, T.-M. Li, J. Zhang, C.-P. Fang, J.-C. Song, H.-T. Liu, S.-Y. Zhou, Z.-H. Liu, B.-J. Chen, G.-H. Liang, X. Song, Z. Xiang, K. Xu, K. Huang, A. Bayat, and H. Fan, Science Bulletin 71, 2996 (2026).
  22. [23]S. Nolan, A. Smerzi, and L. Pezzè, npj Quantum Information 7, 169 (2021).
  23. [24]S. P. Nolan, L. Pezzè, and A. Smerzi, AVS Quantum Science 3, 034401 (2021).
  24. [25]J. Huang, M. Zhuang, J. Zhou, Y. Shen, and C. Lee, Advanced Quantum Technologies 8, 2300329 (2025).
  25. [26]T. Xiao, J. Fan, and G. Zeng, npj Quantum Information 8, 2 (2022).
  26. [27]J. Schuff, L. J. Fiderer, and D. Braun, New Journal of Physics 22, 035001 (2020).
  27. [28]N. F. Costa, Y. Omar, A. Sultanov, and G. S. Paraoanu, EPJ Quantum Technology 8, 16 (2021).
  28. [29]P. Mujal, R. Martínez-Peña, J. Nokkala, J. García-Beni, G. L. Giorgi, M. C. Soriano, and R. Zambrini, Advanced Quantum Technologies 4, 2100027 (2021).
  29. [30]L. Innocenti, S. Lorenzo, I. Palmisano, A. Ferraro, M. Paternostro, and G. M. Palma, Communications Physics 6, 118 (2023).
  30. [31]D. Zia, L. Innocenti, G. Minati, S. Lorenzo, A. Suprano, R. D. Bartolo, N. Spagnolo, T. Giordani, V. Cimini, G. M. Palma, A. Ferraro, F. Sciarrino, and M. Paternostro, Science Advances 11, eady7987 (2025).
  31. [32]A. Suprano, D. Zia, L. Innocenti, S. Lorenzo, V. Cimini, T. Giordani, I. Palmisano, E. Polino, N. Spagnolo, F. Sciarrino, G. M. Palma, A. Ferraro, and M. Paternostro, Phys. Rev. Lett. 132, 160802 (2024).
  32. [33]P. Mujal, R. Martínez-Peña, G. L. Giorgi, M. C. Soriano, and R. Zambrini, npj Quantum Information 9, 16 (2023).
  33. [34]S. Das, G. L. Giorgi, and R. Zambrini, Phys. Rev. Res. 8, 023148 (2026).
  34. [35]Q. Li, C. Mukhopadhyay, A. Bayat, and A. Habnibnia, Phys. Rev. Res. 8, 023028 (2026).
  35. [36]K. Kobayashi, K. Fujii, and N. Yamamoto, PRX Quantum 5, 040325 (2024).
  36. [37]M. Vetrano, G. Lo Monaco, L. Innocenti, S. Lorenzo, and G. M. Palma, npj Quantum Information 11, 20 (2025).
  37. [38]Z.-K. Liu, Q.-M. Ren, C. Nill, A. Cabot, W. Xia, Y.-J. Tong, H.-Z. Wang, W.-W. Yang, J.-Y. Xie, M.-Y. Jing, H. Zhang, L.-T. Xiao, S.-T. Jia, I. Lesanovsky, and L.-J. Zhang, Nature Communications 17, 10118 (2026).
  38. [39]A. Sannia, R. Menta, P. Sathe, D. D. Santis, V. Giovannetti, L. P. García-Pintos, D. Venturelli, G. L. Giorgi, R. Zambrini, and F. Caravelli, Temporal information processing on a 4,500-qubit quantum annealer (2026), arXiv:2609.19308 [quant-ph].arxiv.org/abs/2609.19308
  39. [40]W. Xia, J. Zou, X. Qiu, and X. Li, Frontiers of Physics 17, 33506 (2022).
  40. [41]J. Settino, L. Salatino, L. Mariani, F. D’Amore, M. Channab, L. Bozzolo, S. Vallisa, P. Barillà, A. Policicchio, N. Lo Gullo, A. Giordano, C. Mastroianni, and F. Plastina, Phys. Rev. Appl. 24, 024019 (2025).
  41. [42]J. Henaff, M. Ansquer, M. C. Soriano, R. Zambrini, N. Treps, and V. Parigi, Opt. Lett. 49, 2097 (2024).
  42. [43]Y. Hou, J. Hua, Z. Wu, W. Xia, Y. Chen, X. Li, Z. Li, X. Peng, and J. D. Phys. Rev. Lett. 136, 120602 (2026).
  43. [44]G. Llodrà, P. Mujal, R. Zambrini, and G. L. Giorgi, Chaos, Solitons Fractals 195, 116289 (2025).
  44. [45]M. Sharifian, C. Li, C. Mukhopadhyay, A. Bayat, and L. Minati, Quantum extreme learning for forecasting experimental chaotic electronic circuits (2026), arXiv:2610.13388 [quant-ph].arxiv.org/abs/2610.13388
  45. [46]D. Zheng, X. Li, Y. Guo, H. Yu, Y. Jin, and Z.-Q. Yin, Phys. Rev. Appl. 26, 014056 (2026).
  46. [47]M. Cerezo, A. Arrasmith, R. Babbush, S. C. Benjamin, S. Endo, K. Fujii, J. R. McClean, K. Mitarai, X. Yuan, L. Cincio, et al., Nature Reviews Physics 3, 625 (2021).
  47. [48]Note that, in QEL, quantum reservoir refers to the quantum system used to encode and process the input data, rather than to an environmental bath.
  48. [49]K. Fujii and K. Nakajima, Phys. Rev. Appl. 8, 024030 (2017).
  49. [50]S. Ghosh, K. Nakajima, T. Krishnada, K. Fujii, and T. C. H. Liew, Advanced Quantum Technologies 4, 2100053 (2021).
  50. [51]K. Kobayashi, K. Fujii, and N. Yamamoto, PRX Quantum 5, 040325 (2024).
  51. [52]E. Barouch, B. M. McCoy, and M. Dresden, Phys. Rev. A 2, 1075 (1970).
  52. [53]G. B. Mbeng, A. Russomanno, and G. E. Santoro, SciPost Phys. Lett. Notes 82 (2024).
  53. [54]M. G. A. PARIS, International Journal of Quantum Information 07, 125 (2009).
  54. [55]J. Liu, H. Yuan, X.-M. Lu, and X. Wang, Journal of Physics A: Mathematical and Theoretical 53, 023001 (2019).
  55. [56]J. J. Meyer, Quantum 5, 539 (2021).
  56. [57]S. Boixo, S. Flammia, C. M. Caves, and J. Geremia, Phys. Rev. Lett. 98, 090401 (2007).
  57. [58]E. O’Connor, J. He, M. G. A. Paris, and M. G. Genoni, Geometric obstructions to quadratic time scaling in multiparameter quantum estimation (2026), arXiv:2607.06410 [quant-ph].arxiv.org/abs/2607.06410
  58. [59]W. Zheng, Y. Yang, and A. Bayat, Stabilizing temporal quantum-enhanced sensitivity via sub-optimal measurements (2026), arXiv:2609.24805 [quant-ph].arxiv.org/abs/2609.24805
  59. [60]S. Thanasılp, S. Wang, M. Cerezo, and Z. Holmes, Nature communications 15, 5200 (2024).
  60. [61]A. Sannia, G. L. Giorgi, and R. Zambrini, Exponential concentration and symmetries in quantum reservoir computing (2025), arXiv:2505.10062 [quant-ph].arxiv.org/abs/2505.10062
  61. [62]R. Demkowicz-Dobrzanski, M. Sahebi, O. Agnel, T. Chotibut, S. Thanasılp, and Z. Holmes, Quantum Machine Intelligence 7, 20 (2025).
  62. [63]R. Demkowicz-Dobrzanski, J. Kołodyński, and M. Guţă, Nature Communications 3, 1063 (2012).
  63. [64]J. Kołodyński and R. Demkowicz-Dobrzański, New Journal of Physics 15, 073043 (2013).
  64. [65]S. Alipour, M. Mehboudi, and A. T. Rezakhani, Phys. Rev. Lett. 112, 120405 (2014).
  65. [66]R. Demkowicz-Dobrzański and L. Maccone, Phys. Rev. Lett. 113, 250801 (2014).
  66. [67]S. Ghosh, A. Kobus, S. Kurdziałek, and R. Demkowicz-Dobrzański, Quantum 10, 2251 (2026).

Paper details

vlnc:W_x3mzrmm7
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC0-1.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Physics and Astronomy

Not recorded for this paper

View statement
Looking for related papers…
Contents