Stabilizer codes for open quantum systems

The Lindblad master equation describes the evolution of a large variety of open quantum systems. An important property of some open quantum systems is the existence of decoherence-free subspaces. A quantum state from a decoherence-free subspace will evolve unitarily. However, there is no procedural and optimal method for constructing a decoherence-free subspace. In this paper, we develop tools for constructing decoherence-free stabilizer codes for open quantum systems governed by the Lindblad master equation. This is done by pursuing an extension of the stabilizer formalism beyond the celebrated group structure of Pauli error operators. We then show how to utilize decoherence-free stabilizer codes in quantum metrology in order to attain the Heisenberg limit scaling with low computational complexity.


Introduction
The second quantum revolution emerges from the possibility of designing and controlling quantum systems.The complexity of controlling quantum systems can be reduced by decreasing the noise due to system-environment interaction.This can be achieved by resorting to quantum error correcting codes.Among them are the stabilizer codes [18].These codes were proposed by Gottesman [18].Several works have extended the original construction method in order to incorporate Hilbert spaces and quantum systems with different structures [9,19,32,5,23,8,7,14,31].As an important result, it was shown that stabilizer codes exist if and only if there exist classical block codes obeying an orthogonality rule; e.g., Euclidean and Hermitian self-orthogonality [23].Such a duality between stabilizer codes and classical block codes has stimulated several works [23,8,7,20,14,35,33,31,34].Nevertheless, there is still room for novelties.In particular, we can find at least two relevant points not envisioned in previous works.
Firstly, consider the error set and the algebraic structure associated with it.One will see that the errors obey a group structure with the composition of operators as the group operation.However, in several practical cases, one has an additional operation in play, which is the sum of operators.In these applications, a ring or vector space structure is needed.This is the framework we are going to consider in this paper.As a consequence of this new and intricate formulation, the standard dual structure of stabilizer codes will not be block codes in the general case.We need to abandon the idea of classical codes as vector spaces and work with additive groups.For these additive groups, we introduce a new sum operation that corresponds to the sum and composition of operators.A homomorphism is given between operators and additive codes.
Secondly, stabilizer codes are often designed for a specific quantum channel, or anyway their performance vary from channel to channel [6].Having a dynamical evolution means to deal with time varying Kraus operators, or equivalently with time varying quantum channels.Hence, in such a case it might be not satisfactory to resort to the standard stabilizer codes construction.In this paper, we consider an open quantum system described by a Lindblad master equation.This class of equations is the most general form for the generator of a quantum dynamical semigroup.We construct stabilizer codes able to eliminate the dissipator part of the Lindblad master equation, thus turning the evolution into unitary.As we are going to show, this is possible since the stabilizer code corresponds to a decoherence-free subspace.A state from a decoherence-free subspace will evolve unitarily; i.e., the dissipator part of the Lindblad master equation will not contribute to the evolution of the state [22].Even though the stabilizer code constructed is a subspace of the corresponding decoherencefree subspace, an important advancement is made here.Using the stabilizer code construction we can derive a procedural and optimal method, in terms of computational complexity, for constructing the decoherence-free subspace that corresponds to the stabilizer code.
Decoherence-free subspace can be regarded as a particular case of subsystem codes [2].Suppose we decompose the Hilbert space as H = (C ⊗ D) ⊕ B, where the subsystem code belongs to C, D is a second subsystem, and we are partitioning H into two subspaces, B and C ⊗ D. The concept of a noiseless subsystem is that symmetries on the system-environment evolution factor the interaction Hamiltonian with respect to some subsystem structure on the Hilbert space H [2]. One can describe decoherence-free subspaces as a subsystem code where there is no subsystem D and the code relies on symmetries that factor the interaction Hamiltonian with respect to system and environment.
Quantum metrology aims at using quantum systems in order to improve the estimation of parameters.It is possible to show that the reduction one can obtain in terms of the number of probes a quantum system can achieve is quadratically faster than the best classical strategy [16].This is characterized by the Heisenberg limit (HL).In this paper, as an application of the developed theory, we present a method to achieve the HL using decoherence-free stabilizer codes.It differs quite significantly from the existing methods in the literature.In previous works, under the hypothesis that the Hamiltonian is not in Lindblad span (HNLS), joint encoding and decoding schemes are presented in order to obtain the Heisenberg limit [10,37,25,17,11].In our method, using decoherence-free subspaces for quantum metrology, the dissipator part of the open quantum system does not contribute to the evolution.Hence, under certain hypothesis, we demonstrate that it is possible to achieve the HL using decoherence-free stabilizer codes.Furthermore, since the system evolves unitarily without any interaction between the system and environment, there is no need for a decoding process.Therefore, we are free of any further errors that could arrive in the decoding process.It is also clear that the computational complexity is reduced when compared with other schemes.
This paper is organized as follows.In Section 2 we present the preliminary concepts used to elaborate the results in this paper.The mathematical tools needed to construct the stabilizer codes for noise operators having a tensor product description and a more general description are shown in Sections 3 and 4, respectively.A connection between stabilizer codes and decoherence-free subspaces is made.We also illustrate some of the new structures by presenting several examples.Next, Section 5 demonstrates the applicability of the stabilizer codes in the area of quantum metrology.A condition for probing a quantum system using stabilizer codes in order to obtain the Heisenberg limit scaling is stated and analyzed.The final remarks and future perspectives are given in Section 6.

Preliminaries
In this section, we review some formulations needed to understand the main results of the paper.Firstly, we review the evolution of open quantum systems and describe the idea of decoherence-free subspace in Lindblad master equations.Secondly, the stabilizer formalism is presented.We focus on the main aspect considered in this paper, which is the algebraic structure obeyed by the errors.The first result of the paper is also given, connecting decoherence-free subspaces and stabilizer codes.

Open Quantum Systems and Decoherence-free Subspace
In this paper we deal with open quantum systems evolving by means of a Markovian master equation.Suppose q is a prime power and let S be a system modeled by a q-dimensional Hilbert space H S (we also use the notation H q when it is clear which system is considered) interacts with a reservoir system R associated with a Hilbert space H R .Then the full Hamiltonian can be decomposed as with H S , H R , and H int the system, reservoir, and interaction Hamiltonians, respectively, and I is the identity operator.Instead of analyzing the full system-reservoir evolution, we are only interested in the evolution of a reduced system density operator ρ.This is obtained by tracing over the reservoir in the full density operator.As a result, the dynamics of the reduced density operator ρ is given by [21] where is the decoherence evolution originated from the system-reservoir coupling, with M ≤ N 2 − 1 where N is the number of qudit systems, q = d N , and {J l } M l=1 are the Lindblad operators.We call this part of the evolution throughout the paper as the dissipator part.Definition 1. [22] Let the time evolution of an open quantum system with Hilbert space H S be described by means of a Markovian master equation and D(H) be the set of density matrices of a given Hilbert space H. Then a decoherence-free subspace (DFS) H DFS of H S is such that all pure states ρ(t) ∈ D(H DFS ) satisfies On the other hand, a subspace H sDFS is called strong decoherence-free subspace (sDFS) if for all pure ρ(t) ∈ D(H sDFS ) one has L D (ρ(t)) = 0, and From Definition 1, it is clear that strong DFS is a sufficient but not necessary condition to have a DFS.

Proposition 2.
[22, Theorem 4, Proposition 5, Theorem 6] Let the time evolution be given by the Markovian open system dynamics shown in Eq. (2).Assume Γ = M l=1 λ l J † l J l .On the one hand, the space P = span{|ψ i } i=1,...,K is a DFS for all time t if and only if J l |ψ k = c l |ψ k , for all l = 1, . . ., M and k = 1, . . ., K, and the commutator [H ev , J l ] has eigenvalues equal to zero for all |ψ k ∈ P, and l = 1, . . ., M .Here On the other hand, P is sDFS if the commutators [H S , J l ], for l = 1, ..., M , and [H S , Γ] have eigenvalues equal to zero for all |ψ k ∈ P. Furthermore, J l |ψ k = c l |ψ k , and Γ |ψ k = g |ψ k , for all l = 1, . . ., M and k = 1, . . ., K, where g = M l=1 λ l |c l | 2 .We are going to show below a case study in which the operators in the dissipator part of the evolution cannot be described in a tensor product form of Pauli operators.Later, we will show that a stabilizer code can be derived from the (strong) DFS, but one cannot rely on the standard stabilizer formalism, which will be explained in the next subsection, for such codes.
Example 3. Consider an N -qubit quantum system with the dynamics described by the master equation with where σ xj , σ yj , σ zj are the Pauli operators on the j-th qubit, s = sinh(r), c = cosh(r), and r is the (real) squeezing parameter derived from the assumption that the reservoir is given by a squeezed vacuum state.For r = 0, the eigenvectors of J are all possible tensor products of |ψ + and |ψ − , where |ψ + = |0 and For each J j , the eigenvalue of |ψ ± is equal to ±( s+c 2 ).Thus, if the number of |ψ + in the eigenvector of J is n + , then the eigenvalue of such eigenvector is (n + − n − ) s+c 2 , where n − = N − n + .Notice that it is not possible to describe J as only tensor products of Pauli operators.This forbid us to use standard constructions of stabilizer codes in the theory that follows.Therefore, before presenting our main results, we need to extend the stabilizer formulation to a suitable type of errors, in conjunction with the operations allowed between them.Now, to compute the expression for H S so that there exists a nonempty (strong) DFS of the eigenspace of J, we use the commutativity condition on H S given in Proposition 2. From it, one possible solution is to have the system Hamiltonian with the form where n + = n − .Observe that the choice of H S implies that H ev = 0 and, therefore, the space spanned by |ψ + and |ψ − is sDFS.

Stabilizer Codes
The theory of stabilizer codes, introduced by Gottesman, has been long studied, analyzed, and extended [13,29,27].However, the physical environment over which the stabilizer code will be used is commonly ignored, relying on the error-correction capability only over the minimal distance of the code.Before presenting the approach taken in this paper, we recall the stabilizer formalism.Actually, we refer to the stabilizer formalism introduced by Gottesman, the connection between the stabilizer group and associated additive code by standard stabilizer formalism.
A stabilizer code Q is a subspace of a N -qubit system described by C 2 N stabilized by the elements of an abelian subgroup S of the error group G N over N qubits.We can mathematically describe a stabilizer code as For the characterization of correctable and uncorrectable errors, we need to introduce the concept of centralizer of a subgroup of G N and center of G N .The subgroup C G N (S) of G N , given by is called the centralizer of S in G N .Observe that the commutativity property of An important achievement of standard stabilizer formalism is showing the equivalence of stabilizer codes and additive classical codes.For a K-dimensional quantum code with minimum distance d and living in the Hilbert space H ⊗N q ; i.e., with parameters ((N, K, d)) q , there exists an additive classical code C (and its symplectic dual C ⊥s ) which is equivalent to the stabilizer code.As shown in Proposition 5, the minimum distance of the stabilizer code is computed from the symplectic weight.We define the symplectic weight of a vector (a|b) ∈ F 2N q as swt((a|b)) = |{k : (a k , b k ) = (0, 0)}|.One of the main results of this paper is the extension the equivalence between classical codes and quantum stabilizer codes to more general errors, in particular non-Pauli errors.Due to the complex algebraic structure describing the errors, we show sufficient conditions for a classical code to be equivalent to a stabilizer code.
Proposition 5. [23,Theorem 13] An ((N, K, d)) q stabilizer code exists if and only if there exists an additive code , where swt denotes the symplectic weight, and the symplectic weight of a set is the minimum symplectic weight of the elements in the set.Now, we are going to describe in detail the error basis and error vector space used through the paper.A set E of operators on C 2 is denoted a nice error basis if it attains three conditions: (a) it contains the identity operator, (b) it is closed under the composition of operators, (c) the trace Tr{A † B} = 0 for distinct elements A, B ∈ E. In this paper, we consider the error basis where I is the identity operator and σ i , for i = 1, 2, 3, are the Pauli matrices.The inner product of two distinct elements A, B in E is given by Clearly, E is a nice error basis.Additionally, we have that if E 1 and E 2 are nice error bases, then Proof.It follows from the commutation relations of the Pauli operators Definition 7. Let E N be the error basis constructed as N -fold tensor product of the Pauli matrices shown in Eq. ( 12).The error group, denoted by G N , is the vector space over C consisting of elements in E N .
For explicit examples of the error vector space G N , see Section 4.
In the definition of error set and operations allowed among its elements, there is a significant turn concerning the one utilized in standard stabilizer formalism.There, only the composition of operators is considered.Here, we also have the sum of operators, thus obtaining a vector space structure for the error set.Notice, however, that to define the stabilizer set in both approaches (the standard one and the one used in this paper) only composition of operators is necessary, besides the commutativity of its elements.
Suppose the evolution of a state ρ(t) is given by a Markovian master equation with dissipator part described by operators from the set J = {J l : l = 1, . . ., M }.Add the operator Γ = M l=1 λ l J † l J l to the set J so that J = J ∪ Γ. Assume the existence of a DFS or sDFS satisfying the assumptions of Proposition 2. Then we can construct the following stabilizer sets or Suppose Q is the joint eigenspace with eigenvalue +1 for every element in S sDFS ; i.e., S sDFS stabilizes Q.If [S i , S j ] = 0, for all i, j = 1, . . ., M + 1, then S sDFS is an abelian group.Furthermore, if the system Hamiltonian H S belongs to the centralizer C G N (S sDFS ), then we can conclude from Proposition 2 that Q is sDFS.Similar arguments can be used for DFS, where the stabilizer group is given by S DFS and the commutativity condition is imposed over H ev .A stabilizer code that is also (sDFS) DFS will be called a (strong) decoherence-free stabilizer code.
Theorem 8. Let the time evolution of the quantum system be given by the Markovian master equation shown in Eq. ( 2).Suppose there exists a nontrivial maximal joint +1-eigenspace Q of the abelian group S sDFS or S DFS constructed in Eq. ( 15) and ( 16), respectively.If ), then Q is a stabilizer code and a decoherence-free subspace; 2. H S belongs to C G N (S sDFS ) and S M +1 ∈ S sDFS stabilizes Q, then Q is a stabilizer code and a strong decoherence-free subspace.
We call Q a (strong) decoherence-free stabilizer code.
Proof.Consider Claim 1.First of all, notice that the claim Q is a stabilizer code of S DFS follows from the fact that Q is the nontrivial maximal +1-eigenspace of S DFS .Secondly, for any |ψ ∈ Q and S l ∈ S sDFS we have Since with any element in S DFS has eigenvalue equal to zero.Therefore, from Eq. ( 17) and Proposition 2, we have that Q is also a decoherence-free subspace.
Claim 2 follows the same reasoning.
A connection between stabilizer codes and decoherence-free subspace is given in Theorem 8. Differently from previous works, such as Ref. [26], we give a direct algebraic relation between the Lindblad operators, DFSs, and stabilizer codes.It is shown in Ref. [26] that DFSs are a specific class of quantum error correcting codes, but no constructive method to derive the stabilizer set from the Lindblad operators is shown.Furthermore, as will be shown in the following sections, we extend the stabilizer description to classical error-correcting codes defined over the complex number field.More precisely, the standard theory of quantum error-correcting code contains quantum codes derived from classical codes, i.e., codes defined over finite fields.In this new context, we consider classical codes defined over C, the complex field which has characteristic zero, and this fact modifies completely the techniques to be applied in the constructions of our results.To the best of the author's knowledge, this is the first work presenting such a formulation.In particular, there are DFS that have a stabilizer code as subspace.This inclusion may or may not be proper.However, dealing with stabilizer codes can produce results that we could not obtain otherwise.In fact, one can find encoding methods for stabilizer codes that are procedural and optimum algorithms for creating the corresponding code space.Additionally, set membership can be optimally implemented by decoding methods.Later in the paper we construct an algorithm for quantum metrology that uses set membership as one of the important steps.Therefore, dealing with decoherence-free stabilizer code instead of the whole decoherence-free subspace is computationally relevant for several applications.
The connection between decoherence-free subspaces and stabilizer codes is expanded in the following two sections.Firstly, errors with a particular structure are considered.The considered structure simplifies the stabilizer formalism and the connection between stabilizers and classical codes.Afterwards, the restriction is relaxed and generalized errors are considered.

Decoherence-Free Stabilizer Codes for Tensor-Product Noise
We have seen necessary and sufficient conditions for a subspace P ⊆ H S to be decoherence-free or strong decoherence-free in Proposition 2. Additionally, we established conditions for a (strong) decoherence-free subspace to be a stabilizer code.In this section we are going to elaborate over these conditions in order to connect (strong) decoherence-free stabilizer code, defined over a particular type of errors, with classical code.For this purpose, this section is divided in three parts.In the first part, we present some motivations for the tools constructed in the second part.Then, in the second part, it is put forward a vector space where the sum of vectors is related to the composition of operators.Lastly, part three connects stabilizer codes to these vector spaces by means of an isomorphism.

Motivation
In order to illustrate the connection between DFS (sDFS) and S DFS (S sDFS ), we present the example below.
Example 9. Consider the same evolution as in Example 3, but with For r = 0, the eigenvectors of J are all possible tensor products of |ψ + and |ψ − , where |ψ + = |0 and The eigenvalue of |ψ ± is equal to ±( s+c 2 ).Thus, if the number of |ψ ± in the eigenvector of J is n ± , the eigenvalue of such eigenvector is s+c , the stabilizer set is given by It is clear that S DFS is abelian.Hence, we can construct a stabilizer code form S DFS .Additionally, from the commutation relation of Proposition 6 and J = s+c 2 5 j=1 σ xj + iσ yj + σ zj , the system Hamiltonian with the form where η 0 = γ(s+c) 2

4
, belongs to C G N (S DFS ).Observe that if we have derived the form of H S in a similar way as the method in Example 3; i.e., by imposing that the eigenvalue of [H S + iγ(s+c) 4 (J − J † ), J] over the subspace Q is equal to zero, we would obtain the same result as in the current example, which imposes the stronger condition [H S + iγ(s+c) 4 (J − J † ), J] = 0.This means that for the model of N qubits considered, the existence of a decoherence-free subspace is equivalent to the existence of a decoherence-free stabilizer code.
There are several interesting aspects of dealing with stabilizer groups.One is the complexity reduction in defining the stabilizer code, i.e., instead of using vector space basis we can use the group generator of the stabilizer group.Encoding, error detection, error correction, and decoding schemes can also be computationally-efficient constructed from the stabilizer group.Another one is the connection between stabilizer groups and additive codes.This connection is implemented by means of an isomorphism.Thus, statements over the equivalent additive code are directly translated to the stabilizer group and, more importantly, to the stabilizer code.This approach is largely utilized to show existence or non-existence of stabilizer codes with specific parameters or properties.In the following, we sketch the connection between stabilizer groups constructed from open quantum systems and additive codes.In particular, the isomorphism utilized to connect them is introduced.
The commutativity property between H ev and J can also be described using our representation.Let v Hev = ζ(H S + iγ 2 √ sc(J − J † )) and write it as where b j ∈ C 5 , for all j = 0, 1, 2, 3. Similarly, v S 1 is given by where a j ∈ C 5 , for all j = 0, 1, 2, 3. Then the commutation relation of Proposition 6 can be extended by defining for j = 1, . . ., N .We can see that = 0, for j = 1, . . ., N .In our example, we have v Hev = (0, 0, . . ., 0) ∈ C 20 , which gives Consider the composition of operators.Let E 1 , E 2 ∈ G N be two errors written as Then, where for j = 1, . . ., N .Thus, we need to impose over the map ζ the following condition for composition of operators where c ij , for i ∈ {0, 1, 2, 3} and j ∈ {1, . . ., N }, is defined in Eq. (34).Further details of this operation will be given below and in the following subsections.
Let us introduce the map ζ in formal terms and derive an additive operation from this definition.
Definition 11.Let E 1 , E 2 ∈ G N be two errors written as Then we define the map where for j = 1, . . ., N .

Definition 12.
Let N be a positive integer, and v 1 , v 2 ∈ C 4N be two vectors given, respectively, by where for j = 1, . . ., N .
Considering the + ζ operation defined above as the sum operation of the additive codes, we derive some constraint over the coordinates of the elements in these codes.
and the following system of equations must also be satisfied for pairwise distinct l, i, k ∈ {1, 2, 3} and each j = 1, . . ., N .
Proof.The set of conditions presented in Eq. ( 45) follows by imposing commutativity of v 1 + ζ v 2 and v 2 + ζ v 1 in Eq. (44).To derive the conditions in Eq. ( 46), notice that Eq. (45) can be described as which has nontrivial solution if and only if a 1j a 2j a 3j = 0. Substituting this condition in Eq. ( 47) and imposing nontriviality to the solution again, we obtain a 2 ij = −a 2 kj and a lj = 0 for pairwise distinct l, i, k ∈ {1, 2, 3}.Notice that for each j, we have independent conditions.
We have presented some intuitions on how to relate operators and vectors.Some constraints on the coordinates of the vectors have been presented.However, we need to develop further tools and properties to derive a stabilizer formalism connecting stabilizer code and additive codes.In particular, three points are covered in the following subsection.Firstly, we demonstrate that the map •, • ζ is a symplectic form.Using this fact, we show that the map ζ is an isomorphism between abelian sets of operators and additive codes.Lastly, we introduce symplectic dual codes and the stabilizer formalism connecting quantum stabilizer codes with + ζ -additive codes.

Symplectic form and Additive Codes
A symplectic form connects the centralizer of a stabilizer group to the dual code of the classical code corresponding to the stabilizer group.Symplectic forms can be defined over vector spaces or groups.
In the following we consider a symplectic form over groups.Thus, the dual code obtained is an additive code.

Definition 14.
A symplectic form over an additive group G to a field F is a function such that for all g 1 , g 2 , g 3 ∈ G.
For the operation in Eq. ( 30) to be a symplectic form, the first point we need to show is that the image of ζ equipped with a proper additive operation forms an additive group.
We claim that the set , where S is a stabilizer group, equipped with + ζ operation from Definition 12 is an additive group.Indeed, let v A , v B , v C ∈ V, then the following axioms are satisfied:

there exists an element
The first point is clearly true.For the second point, we have that V is the image of ζ over C G N (S).From Proposition 6, we have for j = 1, . . ., N , where a lj and b pj are the coordinates of the vectors v A and v B , respectively, for l, p = 1, 2, 3. Thus, we can see from Definition 12 that + ζ is abelian.For the third point, let , where each coordinate is given by and for j = 1, . . ., N .Then, the result of the sum v F = v D + v C can be described by Similarly, it follows that the sum Rearranging the terms in Eq. ( 55) and utilizing the relation from Eq. ( 51), we see that f ij = f ij for i = 0, 1, 2, 3 and j = 1, . . ., N .Therefore, we have proven Property 3. From the definition of + ζ and the relation from Eq. ( 51), we have that the identity element exists.In particular, the identity element is given by v I = (1 N , 0 N , 0 N , 0 N ), where 1 N and 0 N are N -dimensional vectors with all coordinates equal to 1 and 0, respectively.The same approach can be used to show Property 5. Now, we can use the previous algebraic structure to show that the expression given in Eq. ( 30) is a symplectic form.
From the clear relation between Eqs. (56-58), we only need to show that one of these functions is a symplectic form.Then, where j = 1, . . ., N and we have used the fact that x 0 = (1, 1, . . ., 1).It is also possible to see that Example 16.Let G 3 be the error set for three qubit systems and A, B ∈ G 3 be operators given by Then, on the one hand, we have that which implies On the other hand, the action of ζ on A and B is given by Therefore, where we used Definition 12. From Eqs. (64) and (67) we see that Similar to previous works on stabilizer codes, we are going to derive a connection between stabilizer codes and classical error-correcting codes.This approach enables us to derive algebraic conditions for the construction and existence of decoherence-free stabilizer codes.We can use it to show nonexistence of decoherence-free stabilizer codes with some specific parameters.
2. A strong decoherence-free stabilizer code Q exists if there exists an Proof.First of all, since C ≤ C ⊥ ζ , then for all S 1 , S 2 ∈ S DFS we have [S 1 , S 2 ] = 0.This implies the existence of a maximum jointly eigenspace of all operators in S DFS .Let us denote it by Q.In particular, Q is a stabilizer code with stabilizer given by S DFS .On the other hand, the hypothesis Therefore, the eigenvalue of the commutator of H ev with any operator in S DFS is equal to zero.Using Proposition 2, we have that Q is also a decoherence-free subspace.
The same strategy can be used to deduce the second claim.

Decoherence-Free Stabilizer Codes for General Noise
This section extends the previous results to general error operators.The approach followed to connect operators and classical codes is based on matrix vectorization.After showing the corresponding vectorized operations, we demonstrate that the formulation of Section 3 is indeed a particular case of the current formulation.Additionally, the standard stabilizer formalism can also be derived from our formalism.

Motivation
Suppose we wish to extend the formulation of the previous section to operators of the form where L is the number of terms in the sum describing the operator E, and N is the number of physical systems.A naïve approach would be to map operators to matrices.There are some problems with this strategy.First of all, one should impose an ordering over the terms in the sum going from l = 1, . . ., L as a means to make a uniquely correspondence between each term in the sum and a row in the matrix.Secondly, the composition of errors could result in a sum of matrices giving a matrix with more rows than the original matrices that are being summed; e.g., suppose we have E 1 with L 1 terms in the sum and E 2 with L 2 terms in the sum, then E 1 •E 2 can produce up to L 1 ×L 2 terms.This can be solved since there is a maximum L of terms with which any operator can be described.Third, and more importantly, the above representation is not unique.To see this, consider the operator which can also be written as The issue of uniqueness in representing an operator and, consequently, its matrix representation may be solved by introducing equivalence classes over matrix spaces similar to the equivalence classes utilized in the definition of tensor product of vector spaces [24].Even tough these problem may be solved, the formulation seems not straightforward.Therefore, in the following we use matrix vectorization to avoid all these complications.Let {|i } q i=1 be a basis of a Hilbert space H q , and |i j| ∈ L(H q ) be a linear operator over the Hilbert space H q .Vectorization is a bijective linear map from L(H q ) to H ⊗2 q defined as [1] vec(|i j|) := |i |j .
Vectorization can be extended to any operator space.Let |i forms a basis for the space and the vectorization is a bijective linear map, it can be applied to any operator in L(H ⊗N q ).Several properties can be derived for matrix vectorization.Two operations we have used are composition and commutation of operators.For the first, we can use the relation In particular, we have vec(AB) = (A ⊗ I)vec(B).The commutator can be easily obtained from the above relation and the linearity of the vectorization.We have Definition 19.Let A, B ∈ L(H N q ) be operators.We define the sum of the vectors vec(A) and vec(B) by If A commutes with B, then it is clear that vec(A) + vec vec(B) = vec(B) + vec vec(A).Note that + vec is not the traditional sum of vectors, which always commutes.
We utilize this relation to show that the result from the previous section and the standard stabilizer formalism can be derived from the formulation presented below.Furthermore, the vectorization of the commutator between two operators is used later to construct the symplectic form and the dual code of the additive code.for l = 1, . . ., N .Thus, it is clear that one can describe a vector in the vec formulation in terms of the coordinates of the vector in the ζ formulation.In order to show that these two formulations are equivalent, we need to show that the additive operation in one formulation can be described by the vectors in the other formulation.Let We can describe each coordinate by vec(AB) i 1 ,...,i N ,r 1 ,...,r N = ( From Eq. (80), denoting λ  From the above relations and the representation ζ(A) and ζ(B), we see that the same result for vec(AB) is obtained.
In the previous two examples we have seen vectorization applied to operators and that the ζ(•) and vec(•) are indeed equivalent.As can be noticed, the computations to implement the representations and to show equivalence are not complicate but tedious.Therefore, such task can be delegated to a computer.

Additive Codes
As explained in the previous section, we need to have a symplectic form in order to construct the additive code related to the stabilizer code and its centralizer.We can use Eq.(76) to construct the symplectic form used through this section.

Definition 24. Let A, B ∈ L(H ⊗N
2 ) be linear operators.We define the map  Figure 1: Flowchart of the proposed protocol for achieving HL limit using the stabilizer codes of previous section.
We use Theorem 28 in the example below to show achievability of the HL using the protocol of Fig. 1.The proposed protocol relies on ρ Max-Min as a codeword of the DFS stabilizer code.The existence of a DFS stabilizer code is equivalent to the commutativity between the Lindblad operators and the system Hamiltonian.This is satisfied whenever we have environments acting locally on each subsystem.Therefore, we expect that the proposed protocol can be applied to most of the relevant physical systems.
Example 29.Consider a quantum system with a similar dynamics as in the previous examples, and where s = sinh(r), c = cosh(r), and r is the (real) squeezing parameter.The stabilizer set constructed from the dissipator part is given by S = (I ⊗ I + σ z ⊗ σ z ) i : i = 0, 1 .Consider an eigenvector with maximum eigenvalue and an eigenvector with minimum eigenvalue of the operator H S .Such a pair is

Final Remarks
In this work we have constructed stabilizer codes for open quantum systems governed by Lindblad master equations.To achieve this goal, we had to go beyond the tools that exist for stabilizer codes in the literature.As an important step, we have extended the formulation of stabilizer codes under the influence of errors forming a group to those forming a vector space.Using stabilizer codes as tools, we were able to determine conditions under which decoherence-free subspaces exist.As an application of the results shown, a novel algebraic method for attaining the Heisenberg limit scaling is given by means of stabilizer codes.Explanations of tools and codes created in the paper are illustrated through a variety of examples.The algebraic approach developed to attain the Heisenberg limit scaling paves the way to attack this quantum metrology problem by reservoir engineering.This paper suggests future lines of investigation from coding theory perspective.Firstly, by considering the construction of parameter bounds by connecting the physical constraints over Lindblad operators to the stabilizer code parameters.A quantification of goodness for decoherence-free subspaces can be obtained from this topic.One could also show the non-existence of decoherence-free subspaces, which could lead to a more effective approach to investigate open quantum systems.Secondly, identifying decoherence-free subspaces as stabilizer codes generates the possibility to classify some evolutions of open quantum systems.One approach is connecting some evolutions to families of classical codes.Lastly, because of the novel approach presented, we expect quantum evolutions with decoherence-free stabilizer codes leading to classical codes that have not been discovered yet.
Suppose we are going to probe the system N times with the stateρ Max-Min = ψ (N ) ψ (N ) = 1 2 |ψ Max ⊗N + |ψ Min ⊗N ψ Max | ⊗N + ψ Min | ⊗N .(115)It is possible to see that ψ (N ) is a codeword of the stabilizer code Q, since S |ψ Max = |ψ Max and S |ψ Min = |ψ Min , for all S ∈ S. Now, the achievability of the HL scaling can by seen in two ways.Firstly from Theorem 28, where state membership in the stabilizer code is verified in the quantum or classical realms using the tools presented previously in this paper.Secondly from Eq. (111), where we have that the dissipator part does not contribute to the evolution since 2Jρ Max-Min J † − J † Jρ Max-Min − ρ Max-Min J † J = 2ρ Max-Min − ρ Max-Min − ρ Max-Min = 0.(116) The group SZ(G N ) is given by the elements Ez, where E ∈ S and z ∈ Z(G N ).Lemma 11]Let S ≤ G N be the stabilizer group of a stabilizer code Q of dimension greater than one.An error E ∈ G N is detectable by the stabilizer code Q if and only if E is an element of SZ(G N ) or E does not belong to the centralizer C G N (S).