Efficient feedback controllers for continuous-time quantum error correction

Efficient feedback controllers for continuous-time quantum error correction

Bradley A. Chase bchase@unm.edu    Andrew J. Landahl alandahl@unm.edu    JM Geremia jgeremia@unm.edu Center for Advanced Studies, Department of Physics and Astronomy, University of New Mexico, Albuquerque, NM, 87131 USA
Abstract

We present an efficient approach to continuous-time quantum error correction that extends the low-dimensional quantum filtering methodology developed by van Handel and Mabuchi [quant-ph/0511221 (2005)] to include error recovery operations in the form of real-time quantum feedback. We expect this paradigm to be useful for systems in which error recovery operations cannot be applied instantaneously. While we could not find an exact low-dimensional filter that combined both continuous syndrome measurement and a feedback Hamiltonian appropriate for error recovery, we developed an approximate reduced-dimensional model to do so. Simulations of the five-qubit code subjected to the symmetric depolarizing channel suggests that error correction based on our approximate filter performs essentially identically to correction based on an exact quantum dynamical model.

pacs:
03.67.Pp,03.65.Yz,42.50.Lc,02.30.Yy

I Introduction

Quantum error correction is inherently a feedback process where the error syndrome of encoded qubits is measured and used to apply conditional recovery operations Gottesman (1997). Most formulations of quantum error correction treat this feedback process as a sequence of discrete steps. Syndrome measurements and recovery operations are performed periodically, separated by a time-interval chosen small enough to avoid excessive accumulation of errors but still comparable to the time required to implement quantum logic gates Gottesman (1997); Nielsen and Chuang (2000). There is, however, mounting evidence from the field of real-time quantum feedback control Wiseman (1994); Armen et al. (2002); Bouten et al. (2006); Cook et al. (2007) that continuous observation processes offer new, sometimes technologically advantageous, opportunities for quantum information processing.

Toward this end, Ahn, Doherty and Landahl (ADL) Ahn et al. (2002) devised a scheme to implement general stabilizer quantum error correction Gottesman (1997) using continuous measurement and feedback. Unfortunately an exact implementation of the ADL scheme is computationally demanding. For an -qubit code, the procedure requires one to time-evolve a -dimensional density matrix for the logical qubit alongside the quantum computation Ahn et al. (2002). This classical information-processing overhead must be performed to interpret the continuous-time error syndrome measurement data and determine how recovery operations, in the form of a time-dependent feedback Hamiltonian, should be applied. While is a constant for any particular choice of code, even modest codes such as the five-qubit code Bennett et al. (1996); Laflamme et al. (1996) and the seven-qubit Steane code Steane (1996) push classical computers to their limits. Despite state-of-the art experimental capabilities, it would be extremely difficult to implement the ADL bit-flip code in practice. Consequently, Ahn and others have devised alternate feedback protocols which are less demanding Sarovar et al. (2004); Ahn et al. (2004), but perform worse than the the original ADL scheme.

Recently, van Handel and Mabuchi addressed the computational overhead of continuous-time error syndrome detection van Handel and Mabuchi (2005) using techniques from quantum filtering theory Belavkin (1999); van Handel et al. (2005); Bouten and van Handel (2005). They developed an exact, low-dimensional model for continuous-time error syndrome measurements, but did not go on to treat continuous-time recovery. The complication is that any feedback Hamiltonian suitable for correcting errors during the syndrome measurements violates the dynamical symmetries that were exploited to obtain the low-dimensional filter in Ref. van Handel and Mabuchi (2005). While one might address this complication by simply postponing error recovery operations until a point where the measurements can be stopped, there may be scenarios where it would be preferable to perform error recovery in real-time. For example, if the recovery operation is not instantaneous, responding to errors as they occur might outperform protocols where there are periods without any error correction.

In this paper, we extend the quantum filtering approach developed by van Handel and Mabuchi to include recovery operations. We consider an error-correcting feedback Hamiltonian of the form devised by Ahn, Doherty and Landahl, but our approach readily extends to other forms for the feedback. While an exact low-dimensional model for continuous-time stabilizer generator measurements in the presence of feedback does not appear to exist, we devise an approximate filter that is still low-dimensional, yet sufficiently accurate such that high-quality error correction is possible.

Ii Continuous-Time Quantum Error Correction

For our purposes, a quantum error correcting code is a triple . The quantum operation encodes logical qubits in physical qubits. is a set of stabilizer generator observables with outcomes that define the error syndrome. is the recovery operation, which specifies what correction should be applied to the physical qubits in response to the syndrome measurement outcomes.

The particular choice of code is usually made with consideration for the nature of the decoherence affecting the physical qubits Knill et al. (2000). For example, the bit-flip code (considered by both ADL and van Handel and Mabuchi) improves protection against an error channel that applies the Pauli operator to single qubits at a rate . Here, we adopt the notation that represents the Pauli operator on qubit , and similarly for and . In the bit-flip code, encodes qubits in qubits by the map . The stabilizer generators are and ; each extracts the parity of different qubit pairs. The recovery , given the outcomes of measuring , is defined by , , and .

In this paper, we focus primarily on the five-qubit-code () that increases protection against general separable channels, and in particular the continuous-time symmetric depolarizing channel that applies all three Pauli operators to each of the physical qubits at the same rate . The five-qubit code has stabilizer generators . It is also a perfect code in that all 16 distinct syndrome outcomes indicate distinct errors: one corresponding to the no-error condition, and one syndrome for each of the three Pauli errors on each of the five qubits. We defer to Nielsen and Chuang (2000); Gottesman (1997) for the encoding and recovery procedures for this code.

ii.1 Continuous-time Stabilizer Generator Measurements

Quantum error correction can be extended to continuous time by replacing discrete measurements of the stabilizer generators with a set of continuous observation processes Ahn et al. (2002). This creates measurement records

(1)

obtained from the encoded qubit with state at time . Here, is a constant called the measurement strength that depends upon the physical implementation of the continuous measurement and the are independent Wiener processes, each with and Wiseman and Milburn (1993); van Handel et al. (2005). We do not consider here how one might implement the set of simultaneous stabilizer generator observations other than to comment that doing so in an AMO technology would likely involve coupling the physical qubits to a set of electromagnetic field modes and then performing continuous photodetection on the scattered fields. While this model is rather general, we take the same for each qubit, implying symmetric coupling of the qubits.

By itself, the continuous measurement record is too noisy to permit quantum error correction—one must first process the measurement data to deal with the presence of the noises . The most straightforward approach toward filtering the noise is via an estimate of the full logical qubit density operator . Generating a full state estimation based on the evolving syndrome measurement data is accomplished by the quantum filtering equation (in its adjoint form with ) Bouten and van Handel (2005)

(2)

where and the superoperators are defined as: and . The first term in the filtering equation accounts for the action of the continuous-time symmetric depolarizing channel while the second accounts for the effect of coupling the logical qubit to the field used to implement the continuous measurements. Conditioning the quantum state on the continuous measurement occurs via the third term, which is driven by the innovations processes . The time evolution generated by a particular noise realization is generally called a trajectory.

The final term in Eq. (2) describes the action of the time-dependent feedback Hamiltonian used to implement error recovery. Following Ahn, Doherty and Landahl, we choose the feedback Hamiltonian to be of the form

(3)

which corresponds to applying Pauli operators to each qubit with a controllable strength . The policy for determining the feedback strengths at each point in time should be chosen optimally. Ahn, Doherty, and Landahl obtained their feedback policy by defining the codespace projector onto the no error states (states which are eigenvectors of all stabilizers) and then maximizing the codespace fidelity . Assuming a maximum feedback strength , the resulting feedback policy is given by setting

(4)

ii.1.1 Computational Expense

Because this is a closed-loop strategy, the feedback controller must determine each from the evolving measurement in real time. The utility of feedback in any real setting then relies greatly upon the controller’s ability to integrate the filtering equation rapidly enough to maintain pace with the quantum dynamics of the qubits. For the five-qubit code, real parameters are needed to represent the density matrix. We found that stable numerical integration Kloeden and Platen (1999) of even a single trajectory required approximately 36 seconds on a 2.1 GHz desktop computer ( over a timespan ). This is far from adequate for use in an actual feedback controller even in state-of-the-art experiments.

Moreover, Eq. (2) is a nonlinear filter, and for such filters it is rarely possible to evaluate even qualitative properties analytically. One must then average over an appreciable number of trajectories to find the expected behavior of quantities such as the codespace fidelity as a function of time. For the five-qubit code, our integrator requires approximately 10 hours to simulate 1000 trajectories.

ii.2 Reduced-Dimensional Filters

Considering that the syndrome measurements yield information about correlations between qubits and not information about the individual states of the qubits, one can imagine that propagating the full density matrix is excessive. Indeed, the ADL scheme only makes use of the projection of onto the codespace, generating the same feedback policy regardless of which state in the codespace is initially chosen. It is reasonable to expect that a lower dimensional model could track solely the information extracted from the syndrome measurements. This is exactly the premise used by van Handel and Mabuchi to obtain a low-dimensional model of continuous-time stabilizer generator measurements (in the absence of feedback) van Handel and Mabuchi (2005). They formulate the problem as a graph whose vertices correspond to syndromes and whose edges reflect the action of the error model. The filtering problem is then reduced to tracking the node probabilities, i.e., the likelihoods for the qubit to be described by each of the various syndrome conditions. Dynamical transitions occur between the syndromes due to the error channel, and the filter works to discern these transitions from the stabilizer measurement data.

Figure 1: Non-zero matrix elements of untruncated and truncated filter. Blue squares correspond to decoherence terms, red crosses correspond to measurement terms and green dots correspond to feedback terms. Note the difference in dimension of the matrices. (Color online.)

For an code, van Handel and Mabuchi define a set of projectors onto the distinct syndrome spaces. For the five-qubit code, there are 16 such projectors; is the codespace projector as before and are projectors onto states with a syndrome consistent with a error on qubit . Forming the probabilities

(5)

into a vector and computing from the full dynamics leads to the reduced filter

(6)

with , the outcome of measuring on and (Eq. (4) in Ref. van Handel and Mabuchi (2005)). The equations for are closed and encapsulate all the information that is gathered from measuring the stabilizer generators. Equation (6) is an example of a Wonham filter, which is the classical optimal filter for a continuous-time finite-state Markov chain with an observation process driven by white noise Wonham (1965). Further discussion of the Wonham filter and its use in conjunction with discrete-time error correction can be found e.g., in Ref. van Handel and Mabuchi (2005).

Iii Continuous-Time Quantum Filtering with Feedback

We now extend Eq. (6) to include a feedback Hamiltonian suitable for error recovery. Following van Handel and Mabuchi’s lead, we see that Eq. (6) was derived by taking for a basis which closed under the dynamics of the continuous syndrome measurement. One hope is that simply adding the feedback term in by calculating also results in a set of closed equations. However, that is not the case when using the basis of the sixteen syndrome space projectors . Specifically, cannot be written as a linear combination of syndrome space projectors. This is not surprising as the feedback Hamiltonian term under consideration is the only term which generates unitary dynamics.

Inspired by the form of the commutator between the feedback and the syndrome space projectors, we define feedback coefficient operators

(7)

where is an arbitrarily chosen index used to distinguish the or 1 prefactor and combination of Pauli matrices which sandwich the syndrome space projector . For the five-qubit code, the syndrome projectors are simply those operators which have the 1 prefactor and 10 identity matrices. The corresponding feedback coefficient is . If we then iterate the dynamics of the filter (2) by calculating starting from the syndrome space projectors, we find that each feedback Hamiltonian term generates pairs of feedback coefficient terms. For example, calculating the dynamics due to feedback on generates two feedback coefficient operators: and . We must then determine the dynamics for these first level feedback coefficients. This will include calculating the feedback on , which generates second level feedback coefficients and . Continuing to iterate feedback coefficient terms, we find that an additional 1008 distinct terms are needed to close the dynamics and form a complete basis. Adding in the initial 16 syndrome space projectors gives a 1024 dimensional basis—clearly no better than propagating the full density matrix. However, it is now relatively easy to calculate the feedback strengths, which depend only on pairs of first-level feedback coefficients. For example, from Eq. (4) we find that , where and are first-level coefficients developed earlier in the paragraph.

iii.1 Approximate Filter for the Five-Qubit Code

Although the dimension of the alternate basis is no smaller than the dimension of the full density matrix, the structure of the filter represented in the alternate basis provides a manner for interpreting the relative importance of the feedback coefficients. This is best seen graphically in Fig. 1(a), which superimposes the non-zero matrix elements coming from the noise, measurement and feedback terms. Both measurement and noise are block diagonal as expected; it is the feedback that couples blocks together in a hierarchical fashion. This hierarchy can be parameterized by the number of “feedback transitions” which connect a given feedback coefficient to the syndrome space block. For example, the upper left block, which corresponds to the syndrome space projectors, is connected via feedback terms to the first level feedback block, whose feedback coefficients are each one feedback transition away from the syndrome space block. In turn, the first level block is then connected to a second level feedback block, whose feedback coefficients are two feedback transitions away from the syndrome block.

Given that the initial state starts within the codespace and given that feedback is always on, the feedback coefficients that are more than one feedback transition from the syndrome space block should be vanishingly small. Limiting consideration to these first two blocks, we also find that pairs of feedback coefficients couple identically to the syndrome space block. For example, we find that and couple to syndrome space projectors identically. This is not surprising, as these two terms comprise the commutator that results from the feedback Hamiltonian. However, outside the first level of feedback transitions, the matrix elements of these feedback coefficients differ. Additionally, feedback coefficients involving feedback Hamiltonians which correspond to a syndrome error on the codespace projector are related as

(8)

For the feedback coefficient examples just mentioned, this relation is . Truncating the dynamics to include only the first level of feedback and combining distinct feedback coefficients which act identically within this block results in the matrix of Fig. 1(b) over only 136 basis elements. Note that the controller now only needs to reference a single basis element for calculating a given feedback strength .

iii.2 Approximate Filter for General Codes

Our truncation scheme generalizes for reducing the dimensionality of the quantum filter for an arbitrary code. Such a filter for an quantum error-correcting code Nielsen and Chuang (2000) has the same form as Eq. (2), but involves physical qubits and continuous-time stabilizer generator measurements. In the following, we assume the continuous-time symmetric depolarizing channel, though it should be straightforward to extend to other noise models. For a non-perfect, non-degenerate code, there are a total of stabilizer generator measurement outcomes, but only will be observed for the given noise channel. For a perfect, non-degenerate code (), all possible syndrome outcomes are observed. In either case, given the observable syndrome outcomes, we can define syndrome space projectors and feedback parameters needed for recovery. Degenerate codes require fewer than recovery operations, as distinct actions of the noise channel give rise to identical errors and recovery operations. The degeneracy depends greatly on the particular code, so we merely note that degenerate codes will require fewer syndrome space projectors and feedback parameters than their non-degenerate relatives.

Once we determine the syndrome space projectors and feedback parameters for the code, we can introduce feedback coefficient operators of the form of (7) but over qubits. A truncated filter is constructed as follows.

  1. Close the dynamics of the syndrome space projectors by introducing first-level feedback terms (2 feedback coefficients per commutator in each of the feedback Hamiltonians).

  2. Close the dynamics of the first-level feedback terms, truncated to a basis of syndrome space and first-level feedback terms, i.e. ignore any second-level terms which were not defined in step 1. The procedure involves steps, since one must at least examine each of the feedback commutator terms for all first-level feedback coefficients.

  3. Each of the syndrome space projectors is related to pairs of first-level feedback coefficients that comprise a commutator. There is an additional factor of degeneracy between syndrome space projectors and feedback coefficients which involve the same Pauli matrix [c.f., Eq. (8)]. A similarity transform is used to eliminate these redundancies, leaving basis elements in the fully truncated filter.

The truncated filter requires only basis elements, as compared to the parameters for the full density matrix. Additionally, the feedback strengths in Eq. (4) are readily calculated from the combined first-level feedback coefficients. The truncation process is depicted schematically in the left half of Fig. 2. The right half of the figure gives examples of a few of the 1024 terms involved in the truncation procedure for the five-qubit code.

Figure 2: On the left, a schematic diagram of truncating the filter to only syndrome space and first level feedback blocks. On the right, just a few of the 1024 feedback coefficients of the five-qubit code representing the different feedback block levels.
Figure 3: Numerical simulations of the five qubit code to assess the average code space fidelity. Plot (a) compares the codespace fidelity (averaged over 10 trajectories) for filters with different levels of truncation: the full (1024-dimensional) and first-level truncated (136-dimensional) filters are essentially identical. Plot (b) shows the codespace fidelity averaged over 2,000 trajectories using the truncated 136-dimensional filter for error correction. (Simulation parameters: and .) (Color online.)

iii.3 Numerical Simulation

Since the truncated filter is also nonlinear, it is difficult to provide analytic bounds on possible degradation in performance. However, we can easily compare numerical simulation between feedback controllers which use the full or truncated filter. In fact, the dynamics should be close for the same noise realizations, indicating that they should be close per trajectory.

In order to analyze the feedback controller’s performance, the full filter Eq. (2) is used to represent the underlying physical system. The feedback controller was modeled by simultaneously integrating the truncated filter, driven by the measurement current from the full filter. The feedback controller then calculated the feedback strengths which were fed back into the full filter. The dynamics described by the full filter were then used to compute the codespace fidelity. Using a predictor-corrector stochastic differential equation (SDE) integrator Kloeden and Platen (1999) and varying and over a wide range, we found essentially indistinguishable performance between the full and truncated filters. Using and as representative parameters, Figure 3(a) demonstrates this general behavior by comparing the average codespace fidelity of a handful of trajectories using the different filters. Integrating an individual trajectory takes approximately 39.5 seconds using a 2.1 GHz PowerPC processor. Integrating the full filter alone takes approximately 36 seconds, while integrating the truncated filter alone takes approximately 3.5 seconds.

In addition to showing the identical performance of the full and truncated filters, Fig. 3(a) also shows the loss in performance if one were to truncate further. The 31 dimensional filter is comprised of the 16 syndrome projectors and the 15 feedback coefficients which have non-zero feedback matrix elements with the codespace . These are the only elements explicitly needed to calculate the feedback strengths in Eq. 4. This filter fails because it tacitly assumes the action of feedback on the codespace is more “important” than on the other 15 syndrome spaces. Since feedback impacts all syndrome spaces equally, we need to retain those terms in order to properly maintain syndrome space probabilities. Intuitively, this suggests that the 136 dimensional filter is the best we can do using this heuristic truncation strategy. For reference, Fig. 3(b) shows the average codespace fidelity of 2000 trajectories when using the truncated filter.

iii.3.1 Comparison with Discrete Error Correction

Given the success of the truncation scheme, we now compare the performance of feedback-assisted error correction to that of discrete-time error correction for the five-qubit code. The discrete model considers qubits exposed to the depolarizing channel

(9)

up to a time , after which discrete-time error correction is performed. The solution of this master equation can be explicitly calculated using the ansatz

(10)

where is a tensor product of Pauli matrices and the identity. The function gives the Pauli weight of a matrix, defined as the number of and terms in the tensor representation. Thus, is the coefficient of and similarly is the coefficient of all single qubit errors from the initial state, e.g., .

The codespace fidelity considered earlier is not a useful metric for comparison, as discrete-time error correction is guaranteed to restore the state to the codespace. Following Ahn, Doherty and Landahl, we instead use the codeword fidelity , which is a measure relevant for a quantum memory. Since error correction is independent of the encoded state, we choose the encoded state as a fiducial initial state. Given that the five-qubit code protects against only single qubit errors, we find that after error correction at time , the codeword fidelity for discrete-time error correction is

(11)

which asymptotes to . This limit arises because prior to the stabilizer generator measurements, the noise pushes the state to the maximally mixed state, which is predominately composed of the through terms.

The feedback codeword fidelity was calculated by integrating both the full quantum filter (2), representing the underlying system of qubits, and the truncated filter, representing the feedback controller. Again, we chose , and and used the same SDE integrator described above. Figure 4 shows the average of over 2000 trajectories, demonstrating that there are regimes where feedback-assisted error correction can significantly outperform discrete-time error correction. Feedback-assisted error correction appears to approach an asymptotic codeword fidelity greater than what would be obtained by decoherence followed by discrete-time error correction. Due to the nonlinear feedback, we were unable to calculate an analytic asymptotic expression for the continuous-time strategy.

Figure 4: Comparison between continuous-time and discrete-time error correction for the five-qubit code. For the continuous-time error correction simulations, the codeword fidelity was averaged over 2,000 trajectories with and . (Color online.)

Nonetheless, the improved performance for the timespan considered suggests that better quantum memory is possible using the feedback scheme.

Iv Conclusion

Extending control theory techniques introduced by van Handel and Mabuchi van Handel and Mabuchi (2005), we have developed a computationally efficient feedback controller for continuous-time quantum error correction. For our truncation scheme, the dimension of the filtering equations grows as in the number of physical qubits , rather than for the original Ahn, Doherty and Landahl procedure Ahn et al. (2002). By numerical simulation of the five-qubit code, we have demonstrated the viability of such a filter for a quantum memory protecting against a depolarizing noise channel. Moreover, in all our simulations, this performance is indistinguishable from that of the computationally more demanding filter of the ADL style.

In systems where recovery operations are not instantaneous relative to decoherence, consideration suggests that it is desirable to perform syndrome measurement, recovery, and logic gates simultaneously. However, it is not immediately clear how gates impact the feedback controller. Indeed, if a Hamiltonian is in the code’s normalizer, the continuous-time feedback protocol and its performance are unchanged. Though a universal set of such Hamiltonians can be found, it might be desirable to find universal gates which have physically simple interactions. Future work involves finding such gate sets and developing a framework for universal quantum computing. Additional issues of fault-tolerance and robustness could then be explored within such a universal setup. Exploring feedback error correction in the context of specific physical models will provide opportunities to tailor feedback strategies to available control parameters and salient noise channels. Such systems might allow the calculation of globally optimal feedback control strategies.

Acknowledgements.
We thank Ramon van Handel for helpful comments on the manuscript and Daniel Lidar for his input on how one might combine continuous-time stabilizer generator measurements and quantum gates. This work was supported by the DOE NINE program under a contract with Sandia National Laboratory (60071-699182). AJL was also supported in part by the NSF under grant (PHY-0555573). JMG was also supported in part by the AFOSR under grant (FA9550-06-1-0178).

References

  • Gottesman (1997) D. Gottesman, Ph.D. thesis, Caltech (1997).
  • Nielsen and Chuang (2000) M. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information (Cambridge University Press, 2000).
  • Wiseman (1994) H. M. Wiseman, Phys. Rev. A 49, 2133 (1994).
  • Armen et al. (2002) M. A. Armen, J. K. Au, J. K. Stockton, A. C. Doherty, and H. Mabuchi, Phys. Rev. Lett 89, 133602 (2002).
  • Bouten et al. (2006) L. Bouten, R. van Handel, and M. James, SIAM J. Control Optim. 46, 2199(2007).
  • Cook et al. (2007) R. L. Cook, P. J. Martin, and J. M. Geremia, Nature 446, 774 (2007).
  • Ahn et al. (2002) C. Ahn, A. C. Doherty, and A. J. Landahl, Phys. Rev. A 65, 042301 (2002).
  • Bennett et al. (1996) C. H. Bennett, D. P. DiVincenzo, J. A. Smolin, and W. K. Wootters, Phys. Rev. A 54, 3824 (1996).
  • Laflamme et al. (1996) R. Laflamme, C. Miquel, J.-P. Paz, and W. H. Zurek, Phys. Rev. Lett. 77, 198 (1996).
  • Steane (1996) A. Steane, Phys. Rev. Lett. 77, 793 (1996).
  • Sarovar et al. (2004) M. Sarovar, C. Ahn, K. Jacobs, and G. Milburn, Phys. Rev. A 69, 052324 (2004).
  • Ahn et al. (2004) C. Ahn, H. Wiseman, and K. Jacobs, Phys. Rev. A 70, 024302(BR) (2004).
  • van Handel and Mabuchi (2005) R. van Handel and H. Mabuchi (2005), eprint quant-ph/0511221.
  • Belavkin (1999) V. Belavkin, Rep. on Math. Phys. 43, 405 (1999).
  • van Handel et al. (2005) R. van Handel, J. K. Stockton, and H. Mabuchi, IEEE Trans. Automat. Control 50, 768 (2005).
  • Bouten and van Handel (2005) L. Bouten and R. van Handel (2005), eprint math-ph/0508006.
  • Knill et al. (2000) E. Knill, R. Laflamme, and L. Viola, Phys. Rev. Lett. 84, 2525 (2000).
  • Wiseman and Milburn (1993) H. M. Wiseman and G. J. Milburn, Phys. Rev. A 47, 642 (1993).
  • Kloeden and Platen (1999) P. E. Kloeden and E. Platen, Numerical Solution of Stochastic Differential Equations (Springer, 1999), see pages 503-506.
  • Wonham (1965) W. Wonham, Siam J. Control 2, 347 (1965).
Comments 0
Request Comment
You are adding the first comment!
How to quickly get a good reply:
  • Give credit where it’s due by listing out the positive aspects of a paper before getting into which changes should be made.
  • Be specific in your critique, and provide supporting evidence with appropriate references to substantiate general statements.
  • Your comment should inspire ideas to flow and help the author improves the paper.

The better we are at sharing our knowledge with each other, the faster we move forward.
""
The feedback must be of minimum 40 characters and the title a minimum of 5 characters
   
Add comment
Cancel
Loading ...
235607
This is a comment super asjknd jkasnjk adsnkj
Upvote
Downvote
""
The feedback must be of minumum 40 characters
The feedback must be of minumum 40 characters
Submit
Cancel

You are asking your first question!
How to quickly get a good answer:
  • Keep your question short and to the point
  • Check for grammar or spelling errors.
  • Phrase it like a question
Test
Test description