Quantum reservoir computing in finite dimensions
Rodrigo Martínez-Peña, Juan-Pablo Ortega
I Introduction
The development of noisy intermediate-scale quantum (NISQ) devices is attracting a great deal of attention from the quantum community. Recent advancements in fields such as quantum computation , quantum simulation , and quantum communications are just examples of the prosperous future that awaits these technologies. Nevertheless, NISQ devices are already demonstrating in the meantime that they can be very useful for diverse research fields like physics, chemistry, and optimization , even providing quantum advantage . Machine learning (ML) is another example of thriving synergies with NISQ technologies. In this context, quantum machine learning (QML) aims to exploit the specific features of quantum mechanics to obtain an advantage over its classical counterparts when dealing with machine learning tasks, both with classical and quantum data . There is already positive evidence in this direction, both from a theoretical point of view in the fault-tolerant picture and in experiments .
The flexibility and range of action of ML and QML techniques is typically specified by the so-called universality approximation theorems. A universal approximation property takes place when a proposed restricted family of functions can approximate any function in a much larger class with arbitrary precision. There are many results of this type that are part of classical analysis dealing with, for instance, polynomials and Fourier series, and others that were added in the early days of ML like, for example, feed-forward neural networks . Further results of this type have been proved for various ML paradigms like recurrent neural networks , support vector machines , extreme learning machines , or kernel methods . Universality results have also been obtained in the QML context, such as for one qubit algorithms , and general quantum circuits . A framework in which we are particularly interested is quantum reservoir computing (QRC). As in classical reservoir computing (RC) , QRC harnesses the rich dynamics of (quantum) dynamical systems to solve tasks where memory and prediction capabilities are required. Examples of application of these techniques are found in the prediction of chaotic time-series and complex spatiotemporal dynamics . Since the first work on QRC many have followed (see for reviews). This includes both experimental implementations as well as theoretical contributions on the universal approximation question . The latter was inspired by the works in the classical framework , where the discrete-time setting of RC theory fits well within the quantum dynamical map description.
The universal approximation property in the RC context brings to the table some conditions that dynamical systems should meet to ensure it. The most prominent ones are the echo state property (ESP) and the fading memory property (FMP) . A system has the FMP if inputs that are close in the recent past produce outputs that are also close, independently of what happened in the distant past. The ESP guarantees that a well-defined input/output map can be associated with our system and amounts to an existence and uniqueness property with respect to the input sequence that is fed into the system. The ESP and FMP are standard requirements in many stochastic and deterministic learning paradigms since they mathematically encode the asymptotic decorrelation (and even independence) between physical states and initial conditions that most physical systems exhibit as time goes by. There are many physical mechanisms that lead to the declining relevance of a given initial condition in a system state as the temporal distance between them increases. For instance, two pervasive phenomena in applications in this direction are chaos (high sensitivity to initial conditions) and dissipation. Fading memory is an important modeling feature when using physical systems because a reservoir system can only store a finite amount of information in its trainable parameters ; this implies that information must be erased as time goes by in order to store new input information. Under very mild mathematical conditions, ESP and FMP are equivalent to the input-forgetting property which mathematically encodes the information removal process that is needed to learn the newly fed one.
The ESP property has been studied in the context of QRC in different works. Nurdin and Chen provided sufficient conditions for the ESP (and FMP) to hold in terms of the contractivity of the quantum map acting on a restricted domain , while Tran and Nakajima also define the ESP using contractivity of the quantum map but without considering restrictions. They also numerically connect the ESP with the spectra of the quantum maps . Both approaches describe the ESP in the density matrix language, that is, the dynamical equations are defined in the space of quantum states. However, this description might be limited somehow, because, as we will see later on, more information can be extracted if we choose a description in terms of observables.
This paper aims to fill some gaps in the description of QRC with finite dimensional systems and classical inputs. More precisely, we first unify the quantum ESP defined in previous works using the norm of quantum maps, with the classical notion of ESP using observables, and show that they are equivalent for finite-dimensional quantum systems. We extend in passing these results to the FMP. More specifically, we establish explicit system isomorphisms between the description of QRC systems using the space of density matrices as state space and the one that uses the space of Bloch vectors associated to Gell-Mann bases. That choice of basis, which is customary in the study of quantum systems, happens to yield non-homogeneous affine state dynamics (the corresponding systems are called state-affine (SAS)) of the type introduced in . The connection between QRC and SAS systems has important consequences. Our results in that context are contained in Proposition 3 and in Theorems 5 and 9. The proposition presents a necessary and sufficient condition for the ESP and FMP to hold in different representations with just a few requirements, such as the compactness of the input space. We emphasize that this hypothesis is satisfied in most RC tasks and when dealing with implementations of RC systems with dedicated hardware since the experimental ranges of the physical systems involved are always finite . The theorems exhibit common situations that should be avoided in the design of quantum channels so that fully operational QRC systems are obtained. We shall work in an idealized framework in which observables are obtained after an infinite number of measurements, with no statistical error. Even in such an idealized setting, we expect that our results can contribute to the general understanding of QRC experiments in finite dimensional systems, as they have already been implemented in .
The structure of the paper is as follows. Section II introduces the general framework and the definitions that will be needed along the paper. Definitions of the spaces of operators and quantum maps are included in Section II.1, while all the RC ingredients will be presented in Section II.2, together with some preliminary results. The main results are contained in Section III. Section IV includes a brief discussion on some of the consequences of Theorems 5 and 9, and Section V concludes the paper.
II Definitions
We start by defining the space of quantum systems. See, for example, for further details. Consider a complex Hilbert space . The set of all bounded operators that act on is a complex vector space under point-wise addition and scalar multiplication, and it forms an algebra under composition. If we add the involution given by the adjoint operation, then is also a -algebra with respect to the operator norm defined by
where . Along this manuscript, we will denote all the induced operator and matrix norms with the symbol . The predual of is the Banach space of all trace-class operators on that have finite trace norm . The trace norm is a particular case (with ) of the Schatten norms defined by . The space of quantum density matrices is a compact convex subset (see Section II.2 and the argument above (15)) of the normed vector space defined by
where and is an index set of cardinality at most , with the dimension of . CPTP maps obviously leave invariant and hence induce a restricted map that we shall denote with the same symbol and use interchangeably. Note that, unlike , the set is not a vector space, and hence it is only when use the map that we can talk about matrix expressions and eigenvalues for the operator . It can be shown that any CPTP map is non-expansive in the trace norm, which means that after applying to two input states , the distance between these density matrices is either contracted or remains equal:
We are particularly interested in the eigenvectors corresponding to the eigenvalue and that we call fixed points, that is, they are elements such that . The set of fixed points of a CPTP map is always non-empty in the space of density matrices. This is a consequence of Schauder’s Fixed-Point Theorem together with the continuity of and the compactness of . We will work most of the time with quantum channels with single fixed points in the space of density matrices. Such maps are called ergodic. Ergodicity of quantum channels is equivalent to the eigenspace of associated with the eigenvalue in having dimension one, and to being made out of the complex multiples of . In that case, we obviously have (see Corollary 2 in ) that with if and only if . It is worth mentioning that the rest of the eigenvectors of an ergodic CPTP map must be traceless. Indeed, given an eigenvalue of the CPTP map and a corresponding eigenvector, we find that , which implies that , and hence that . Therefore, the spectral set of a CPTP map can be decomposed as:
where is defined as the vector subspace of traceless operators, where the restriction and its corresponding matrix representation are obviously well defined.
Repeated applications of an ergodic CPTP map do not necessarily converge to a fixed point (see for an example). If convergence to a fixed point takes place, we say that the CPTP map is mixing. More specifically, a CPTP map is mixing if and only if its repeated applications converge in the trace norm, that is,
Equation (6) implies that the sequence converges to with respect to the trace norm, but in infinite-dimensional situations this does not necessarily imply that convergence takes place with respect to other norms (see Definition 5.4.1 in ). However, in the finite-dimensional case mixing becomes a topological property where for any norm and for any .
Although all mixing maps are ergodic, the converse is not true in general. However, for continuous-time Markovian evolution, both are equivalent and such maps are called relaxing . Another important consequence of mixing condition is the following: a CPTP map is mixing if and only if the fixed point is the only eigenvector with eigenvalue . Then, it is straightforward to show that
We say that a CPTP map is called primitive when it is mixing and its unique fixed point has full rank. The smallest natural number for which sends positive semidefinite matrices to positive definite matrices is called the index of primitivity of and is denoted by . With that notation, we say that is a strictly positive map. Bounds for this number are given by the quantum version of the Wietland inequality .
Finally, we say that a quantum channel is strictly contractive when
for all , where . As it is customary in the quantum channels literature, we reserve the term strictly contractive for the trace norm, unless a different norm is explicitly specified. It can be shown that strictly contractive channels with a full-rank fixed point must be primitive. Indeed, the contractivity condition, together with Banach’s Fixed Point Theorem (using that the convex closed subset of density matrices with the trace norm is a complete metric space) guarantees that the channel is mixing. A mixing channel with a strictly positive fixed point is a primitive channel. The converse holds when the primitive map becomes strictly positive, that is, it sends positive semidefinite matrices to positive definite ones: given a primitive channel , is strictly contractive (see Theorem VI.3 in ). Contractive maps can be also constructed by composing a strictly contractive channel with a general CPTP map.
An important conclusion that can be drawn from all these considerations is that strictly contractive channels, which will be relevant along this work, can be constructed by either using a map like , where is a primitive channel, or by composing a strictly contractive channel with any other CPTP map, as it has been done in some examples in QRC . Examples of mixing/relaxing CPTP maps with full-rank single fixed points can be found in the Lindblad-Gorini-Kossakowski-Sudarshan equation (see for a summary of the necessary and sufficient conditions). As these maps belong to the quantum Markov semigroup, iterative applications of the channels yield , where represents the time of action of the map . Therefore, taking we obtain a strictly contractive map.
II.2 RC definitions
A natural way to construct CPTP state-space transformations is to insert the input dependence using the Kraus decomposition that we introduced in (3), that is,
with weighted norm forms a Banach space (see Appendix A.2 in ). In the same vein, we can define
It can be shown that is a Banach space as well.
We now turn to the space of density matrices and recall that since for positive semidefinite matrices the trace operator is submultiplicative (see Exercise 7.2.P26 in ) we can conclude that for all . This observation implies that the elements in have Frobenius norms bounded by one. Since we are in finite dimensions, this statement holds for any other matrix norm (eventually with a bounding constant different from one) and allows us to conclude that
The compactness of implies that we can apply with straightforward modifications Theorem 3.1 in to prove the following statement.
III Results
Finding the expression for the QRC filter of a system that has the ESP is not straightforward in the language of density matrices since the dependence on the initial condition has to be addressed. More explicitly, given a general CPTP map expressed using its Kraus decomposition, the relation (10) can be iterated -time steps into the past in order to obtain a quantum state at time out of an initial condition specified at time via the formula:
and this value has to be independent of the initial conditions . This fact has been explicitly shown in (and in Chapter 2 of in more detail) in the case of strictly contractive CPTP maps with respect to the operator norm associated to Schatten norms. We recall that given , we define
for some and the -Schatten norm. Using this notation, the contractivity condition on the CPTP map is stated by requiring that , for some . It is obvious that this condition ensures that the hypotheses of Proposition 1 are satisfied, which in turn implies that has the ESP and the FMP (notice that given and arbitrary, the difference and hence the hypothesis implies that ). Since we are in a finite-dimensional context, it suffices to impose contractivity for just one norm , , in order to ensure that the limit in (17) exists and that its value is independent of the initial condition.
The expression (16) shows that it is not possible to write down a closed-form expression for the filter of a QRC system with the ESP when using the density matrix representation, in which the initial dependence condition has been eliminated. This feature is ultimately due to the linearity of the setup. Already in the classical framework (see ), it has been shown that this can be avoided by working with affine instead of purely linear systems. In the quantum context, it can also be observed (see ) that the non-homogeneous state-space system given by , where is a CPTP map, an arbitrary density matrix, and , defines a unique filter in which the dependence on initial conditions has disappeared.
In the following subsections, we shall circumvent this problem by showing that certain matrix representations of finite-dimensional QRC systems on density matrices have a built-in non-homogeneous affine structure that makes them into non-homogeneous state-affine systems (SAS) of the type introduced in . More specifically, we shall be working with the Bloch vector representation of quantum finite dimensional systems associated to a given Gell-Mann basis. This idea is not new in QRC and it can already be seen in the seminal work or, more recently, in the Methods section of . In the paragraphs that follow, we shall explore in depth this representation, mostly in connection with the available literature on SAS systems (Section III.2), which will allow us later on in Section III.3 to identify various design constraints on quantum channels.
We will start by introducing the notation necessary for the matrix representation of quantum channels. In the next section, we shall focus on a specific choice of basis adapted to density matrices. Let be an orthonormal basis for the vector space , when endowed with the Hilbert-Schmidt inner product, that is, . Using any such basis we can represent any operator as , with . Analogously, we can express any linear map as
This statement can be formalized using the language of system morphisms (see for the standard definitions and elementary facts). Consider the state-space systems determined by the triples , , with and . A map is a morphism between the systems and whenever it satisfies the following two properties:
System equivariance: , for all and .
Readout invariance: , for all .
When the map has an inverse and this inverse is also a morphism between the systems determined by and , we say that is a system isomorphism and the systems and are isomorphic. We note that given a system and a bijection , the map is a system isomorphism with respect to the system defined by
for all , .
and that the isomorphism is given by the map . The procedure that we just spelled out can be reproduced for any other (orthonormal) basis of , in which case we would obtain another system which is obviously isomorphic to both and .
The system isomorphisms that we just defined and the compactness of the state spaces where they are defined allow us to establish important connections between the filters that they define. The following proposition describes those connections in detail.
has the ESP if and only if has the ESP. In that case, the filters and (respectively, and ) determined by and (respectively, by and ) satisfy that (respectively, ).
has the FMP if and only if has the FMP.
III.2 Non-homogenous state affine system representation
More specifically, we choose a generalized Gell-Mann basis . This is an orthonormal basis made of Hermitian operators in which, by convention, its first element is the normalized identity, namely, . The remaining traceless Hermitian operators are the generators
of the fundamental representation of the Lie algebra of SU(). The case corresponds to the case of one qubit, and the Gell-Mann basis is made of the standard Pauli matrices. The orthonormality of the Gell-Mann basis is guaranteed by the product property of the fundamental representation of , namely, , where are two elements of the Gell-Mann basis for , and are complex coefficients. The resulting Gell-Mann basis of is hence given by and , . Note that the subset is a basis for the vector subspace of codimension made of traceless operators.
If our system is made of -dimensional systems (qudits), we can extend this basis to by tensorization. The orthonormality of the tensorized basis with respect to the Hilbert-Schmidt inner product is preserved since for any two .
where is the square matrix of dimension with complex entries
with readout . The system isomorphism is in this case, given by the map
Part (iv) of Proposition 2 guarantees that the dynamical properties of the system (and hence those of the QRC system ) are equivalent to those of .
The importance of this observation is that it links to the non-homogeneous state-affine system (SAS) introduced in and for which various universality properties have been additionally proved in . SAS are defined as state equations that have the form spelled out in (29). Strictly speaking, the SAS systems studied in the above-cited references impose polynomial or trigonometric dependences of and on the inputs, while in our situation, the prescription introduced in (10) is capable of accommodating more general forms.
where . A first sufficient condition for ESP and FMP has been formulated in by imposing that for all , where is the maximum singular value of matrix . Given a matrix , the maximum singular value is equal to the 2-Schatten induced norm: , where the singular values of are the square-roots of the eigenvalues of . An improved sufficient condition could be potentially found using other matrix norms as in .
Let be a continuous QRC system. The following three statements are equivalent:
There exists an operator norm and such that
There exists a matrix norm in the space of complex matrices such that
with the trace-zero elements in the basis defined in (25) and the isomorphism defined in (22) with respect to the Gell-Mann basis.
If any of these three equivalent statements hold and is compact, then:
The contraction conditions (32)-(34) are necessary for the ESP and the FMP to hold.
which can be easily used to prove the equivalence between (32) and (33). The equivalence between (33) and (34) follows from the fact that, as it can be seen in (26),
If we now assume that the system has the ESP, we necessarily have that
necessarily. We now notice that since is a continuous map, then so is the dependence of on the inputs . Moreover, since, in this case, is assumed to be a compact set, then so is the matrix set . Now, Corollary 6.4 in guarantees the existence of matrix norm for which (34) is satisfied, as required. ∎
Using the characterization of the mixing property in (7), it is clear that a necessary condition for the QRC to satisfy the contractivity hypothesis in the previous proposition and, in passing, satisfy the ESP and the FMP, is that all the maps are mixing for all . Indeed, since the spectral radius is a lower bound for any matrix norm (see [59, Theorem 5.6.9]) we have that . Consequently, if then , which is equivalent to and then all maps are mixing by (7). We emphasize that this mixing condition is necessary but not sufficient since, as the composition of two mixing maps is not necessarily mixing, the existence of the limit in (17) is not guaranteed even if each of the factor operators is mixing.
III.3 Some constrains on CPTP maps for QRC
The SAS representation allows us to easily characterize situations like the one in Proposition 3 in which a QRC system has the ESP and the FMP and, moreover, it allows us to write explicitly down the corresponding filter (31). As we shall now see in this section, more interesting facts can be derived from this representation having to do with design features that should be avoided, as they produce systems with only trivial solutions. The first one concerns unital quantum channels, that is, channels that satisfy
That situation is studied in the next theorem, which will be generalized in Theorem 9 to the case of QRC systems that exhibit an input-independent fixed point.
There is a close relation between unital quantum channels and contractivity. Indeed, it has been shown that unital maps are contractive for all Schatten -norms, that is, (see Theorem 2.4 in ) when is unital.
Consider the depolarizing channel defined by
where denotes the probability of finding the system at the maximally mixed state . If we arrange the previous equation as an input-dependent channel, we can write the following state equation:
We could have found the same result by directly using (29), for which we need to define the extension of the depolarizing channel to the whole space of bounded operators . We define then the CPTP map
The next case is an example of “poorly engineered” QRC system which can be detected using Theorem 5. Indeed, we shall introduce a model of dissipation using tuneable local losses, but Theorem 5 will discard its long-term applicability because it is unital.
Let us define the Markovian master equation that governs the dynamics between input injections:
where is the jump operator and denotes the anticommutator. We define the input-dependent Hamiltonian as , where will be an arbitrary function of the input, and the jump operator as . This is a single qubit under the influence of an external magnetic field in the direction of the real space (whose intensity varies between inputs) with a local dephasing. Notice that the Hamiltonian is considered as time-independent when integrating the dynamics since it is constant between input injections.
Going from the density matrix language to the real variable linear description requires to find the CPTP map representation of (40). Since Markovian master equations are CPTP linear transformations on their own, we just need to find the Kraus decomposition that represents the dynamics of this master equation as a map. We will follow the procedure as explained in (see Section 2 in the reference for the details of the algorithm). In particular, the Kraus decomposition of a single qubit can be written in the following form:
where are the basis elements of a single qubit in the operator space () and is a unitary transformation of the Choi matrix . Applying (41) to the definition of matrix in (19), we can find the map of the single qubit observables:
where is the expected value of the spin projection in the direction of the real space. The expressions for each matrix element are shown below:
where have shortened notation by setting . The eigenvalues of matrix can be computed analytically: , , and . The moduli of the eigenvalues are , and . Eigenvalue is smaller than one if and only if . Under that condition, the map is a mixing channel with a single fixed point. It can be checked that the map is unital so the fixed point is the maximally mixed state:
Let us prove that there exists some norm where for all inputs. A straightforward induced norm to evaluate is the 2-Schatten induced norm. The singular values of the restriction
are , and , where
Figure 1 numerically shows that for and away from the axes and , we find . Therefore, the system has the ESP and the FMP. As we showed in Theorem 5, the corresponding filter (17) is necessarily trivial and given by
Since the Bloch vector for this constant matrix is , this shows that in the SAS representation .
Unital quantum channels are very common in the quantum information literature because of their practical advantages and well-known mathematical properties, see for example , and references therein. However, Theorem 5 discards the possibility of relying on unital contractive channels for QRC for long input sequences (see also Section IV for more details). The physical explanation for this behavior stems from the fact that the fixed point of these maps does not depend on the input. Then, after each application of the channel, decoherence always leads to the same stationary state (the maximally mixed state), which does not keep track of these inputs. This hinders any possibility of storing the input information into the degrees of freedom of the quantum system since all coherences fade out and the diagonal elements of the density matrix become equal.
We believe that the observation that we just made is very relevant, namely that quantum channels with input-independent fixed points become memoryless in the long-term. This fact is proved in the next theorem that generalizes Theorem 5.
then, if we always have that , the relation (48) implies that , for all . ∎
The differences between the hypotheses in Theorems 5 and 9 on fixed points are apparent when the QRC system is expressed using the SAS representation in terms of the functions and . Indeed, as we saw in the proof of Theorems 5, for and , in that case, and the input dependence takes place only through . This is the case in Example 7. Theorem 9 allows for an input dependence through too.
We define a Markovian master equation for the dynamics between input injections:
where and . This is a single qubit under the influence of an external magnetic field in the direction with local dissipation. The matrix expression for the associated system is:
The eigenvalues of can be computed analytically: , , and . The moduli of the eigenvalues are , and , so is a mixing channel. In this case, the single fixed point is a pure input-independent state with density matrix
Let us see if it is true that there exists some for all inputs. The singular values of the restriction
are and . Therefore, the system has the ESP and FMP. As we showed in Theorem 9, the associated filter is necessarily constant, and (17) necessarily yields the filter
Since the Bloch vector for this constant matrix is , this shows that in the SAS representation .
We can double-check the solution by explicitly computing the filter (31). Take as in (52) and . Since , the filter in (31) exists. Using now that is input-independent, we can write
where is the third column of the matrix . Notice that the third column of the product is . Then, the column equals
and it hence follows that .
To conclude, we show in Figure 2 a numerical example of input driving. We choose as the external magnetic field function, where is a constant and is a unidimensional random input. The input will be drawn from a random uniform distribution in the interval $$. As can be seen, the observables exhibit a transient time after which they converge to the input-independent stationary state.
IV Discussion
Theorems 5 and 9 bring up a connection between long-term computation and noisy intermediate-scale quantum (NISQ) devices: they have a finite time of operation due to decoherence. Consider a model of the type
where represents the decoherence produced by the contact of the system with an external environment. This model is present in QRC experimental works like , where the unitary dynamics is given by a quantum circuit. Theorem 5 explains what happens in the extreme case in which the quantum noise of the device is unital. If the decoherence channel is a unital strictly contractive map then
that is, becomes a unital strictly contractive map for all . Theorem 5 shows, in this case, that the filter becomes trivial after the injection of long input sequences. Instances of unital decoherence can be found in depolarizing channels, like in Example 7, or in dephasing channels. A dephasing channel damps the coherences of the density matrix but does not affect the diagonal elements.
More generally, Theorem 9 can be interpreted as a “common sense” warning: it explicitly states that the input codification must have a measurable influence on the attractor of the natural dynamics of the CPTP map. Otherwise, there is no possibility of storing input information in the long run. We emphasize that this is independent of the type of dissipation that the quantum channel produces. We can connect the implications of this theorem with the NISQ discussion and (56). If the input is codified in some particular coherences of the system, one must be careful that decoherence does not destroy those matrix elements, because then input-dependence would vanish, and the resulting filter would become trivial.
This discussion does not imply that models like (56) are useless. Indeed, the opposite has been proven in previous works for short-term memory tasks . Theorems 5 and 9 only rigorously establish something that was already known about NISQ devices, that is, that there is a coherence time in which they can be exploited. Equivalently, models affected by these theorems have the ESP, but the resulting input/output dynamics becomes trivial for long input sequences.
The coherence time limitation affects to all quantum platforms to a greater or lesser extent. Then, either QRC proposals are subject to operate on shorter time scales than the natural noise time scale (as done in ), or the QRC system is carefully design to integrate it. For example, as we will see in Section IV.1, dephasing can be integrated as part of a QRC system that is not affected by Theorems 5 and 9.
We could further extend this analysis to QRC models with measurements. As an example we take the model proposed in . In this reference, the quantum measurement is applied at each time step after the input dependent CPTP map . The measurement scheme is introduced by modeling an indirect measurement with a continuous-variable ancilla , producing a quantum reservoir with stochastic dynamics. For simplicity, we will restrict ourselves to the case of a single qubit, and we will average the quantum states over the limit of infinite measurements, yielding an unconditional state which is led by a deterministic CPTP quantum channel . Besides, we choose, without loss of generality, to take measurements in the direction. Under these conditions, the CPTP map is
where represents the Hadamard or element-wise matrix product and is defined as
The measurement strength allows us to quantify the decoherence introduced by sharp measurements (), while for the state is weakly perturbed. It is straightforward to see that this model is introducing dephasing, such that we can rewrite (57) as
where the dephasing channel is defined as
As we explained above, unitary dynamics for the map would lead to a memoryless reservoir in the long-term. However, one could engineer a mixing map such that there is a competition between the attractors of maps and . The final fixed point of (59) would be somewhere between the original fixed point of and a diagonal state (which is the shape of the fixed points of ).
We conclude by presenting an example of a qubit with tunable local dissipation that fulfills all the requirements to be a “properly engineered” QRC system. Then, we extend it with the measurement model of to show that it still constitutes a proper QRC system.
We start by introducing the model without measurements. The Markovian master equation that governs the dynamics between input injections is:
where , and . The corresponding matrix expression is
where the expressions for the matrix elements are shown below:
The eigenvalues of matrix are: , , and . The three eigenvalues , and have always modulus smaller than one when . Then, the master equation fulfills the conditions for having a single full-rank fixed point , whose density matrix is
Finally, we compute the singular values of the restriction to the traceless hyperplane. These values are , and , where
Figure 3 shows that for and away from the axis , we find , demonstrating the ESP and the FMP. Since the fixed point is input dependent, this system exhibits the necessary ingredients to be a competent QRC system.
As in Example 11, we show in Figure 4 a numerical example of input driving. We choose again as the external magnetic field function, modifying its direction. Now, the observables and exhibit an explicit response to the driving, while converges to its input-independent stationary value (which can be predicted from (62)).
Now we further extend the model to incorporate the measurement formalism described in . As the composition of CPTP maps can be described as the product of their matrix representations , we just need to obtain the Kraus operators of (60), which are , and , where and are the basis states in the axis. The matrix representation of in the Pauli matrix basis is then
It is straightforward to check that the maximum singular value of restricted to the traceless hyperplane is equal to one. The final matrix is
Given that the maximum singular value of is smaller than one (for and ), we find that for some in the 2-Schatten norm, where , and are the restrictions to the traceless hyperplane of matrices , and respectively (given by (27)). Then, the QRC system has the ESP and the FMP. The single fixed point of the map is given by
This fixed point is produced by the competition between the original fixed point in (64) () and a diagonal state (). With this we can conclude that this engineered model, even including the measurement protocol, leads to an operational QRC system in the long-term run.
V Conclusions
In this paper, we have unified the density matrix approach of previous works in QRC with the Bloch vector representation. Moreover, we have shown that these representations are linked by system isomorphisms and that various results concerning the ESP and FMP are independent of the chosen representation. We have also observed that the QRC dynamics in the Bloch vectors representation amounts to that of a state-affine system (SAS) of the type introduced in and for which numerous theoretical results have been established. We have capitalized on this connection to shed some light on fundamental questions in QRC theory in finite dimensions. In particular, we found a necessary and sufficient condition for the ESP and FMP in terms of the existence of an induced norm that bounds the CPTP map for all inputs, determining a guideline for its election. The necessity of this boundedness hypothesis emerges out of the compactness of the input space, which is a common requirement in the RC literature. If the input space is not compact, sufficient conditions can still be found in terms of the weighting sequence . Besides, we described common situations in which QRC systems become useless in long term runs which can be summarized by saying that quantum channels that exhibit input-independent fixed points yield trivial input/output dynamics.
Our work sets the grounds for further analysis and exploration of the QRC theory. Future work can follow several paths, such as studying the connection between spectral properties of QRC models and their performance in memory and information processing tasks, studying infinite-dimensional quantum reservoirs, or including generalized measurements (positive operator-valued measures) and the effect of a finite number of measurements in the statistics of expected values, given the effect that they imprint in the resources of QRC algorithms .
VI Acknowledgments
We thank A. Sannia for useful discussion and inspiration for this work, and D. Burgarth and M. Rahaman for answering our questions regarding their work and its relation to our study. We also thank the editor and two anonymous referees for input that has significantly improved the paper. R.M.-P. and J.-P.O. acknowledge partial financial support from the Swiss National Science Foundation (Grant No. 200021 175801/1). R.M.-P. acknowledges the Spanish State Research Agency for support through the Severo Ochoa and María de Maeztu Program for Centers and Units of Excellence in R&D (Grant No. MDM-2017-0711) and through the QUARESC project (Projects No. 2019-109094GB-C21 and 2019-109094GB-C22/AEI/10.13039/501100011033). Part of this work was funded by MICINN/AEI/FEDER and the University of the Balearic Islands through a predoctoral fellowship (Grant No. MDM-2017-0711-18-1) for R.M.-P. R.M.-P. also is grateful for the hospitality of the Division of Mathematical Sciences of the Nanyang Technological University, where most of these results were obtained.