View source for Chapter 6 - Noise in Quantum Systems

===Introduction===

Noise is the greatest obstacle to building a scalable and reliable quantum computing device.  Furthermore, all realistic quantum systems are noisy.  Therefore, the main goal of experimentalists trying to build quantum computing devices is to eliminate as much noise as possible.  In this chapter, the objective will be to understand how to describe noise.

In [[Chapter 3 - Physics of Quantum Information|Chapter 3]], the Schrodinger equation was discussed as a way to describe quantum <nowiki>systems'</nowiki> evolution.  The process described by [[Chapter 3 - Physics of Quantum Information#Schrodinger's Equation|Schrodinger's Equation]] is the evolution of a system which has been isolated from everything else ([[Index#C|a closed system]]).  However, as just stated, realistic systems are noisy often because of unwanted interactions with the environment.  There are other noises---such as a gating operation that necessarily has a finite precision.  Such noise can also be described by the representations of open quantum system evolution that are provided in this chapter.  This chapter is about noise in general.

===SMR Representation or Operator-Sum Representation===

The operator-sum representation is a method for representing open system evolution.  It now goes by other names, such as Kraus representation or Kraus decomposition.  However, it originated with [[Bibliography#SMR|Sudarshan, Mathews, and Rau [11]]] in 1961 (SMR) and was later taken up by [[Bibliography#Kraus:83|Kraus [12]]] and others.  Kraus's name is now attached to it due to a set of lecture notes published in the early 1970's.  In this section, it will likely be clear that the description in all its generality was very well (and simply) described by [[Bibliography#SMR|SMR [11]]] and that is the line of argument which will be followed.  


Let us consider a mapping from one density operator to another with no other restrictions.  This can be written as a linear map,
{{Equation | <math>
\rho^\prime = A \rho,
\,\!</math>|6.1}}
or more explicitly,
{{Equation | <math>
\rho^\prime_{r^\prime s^\prime} = \sum_{r,s}A_{r^\prime s^\prime,rs} \rho_{rs}.
\,\!</math>|6.2}}
One way to think of this is a linear mapping from one vector (<math>\rho \,\!</math>) to another (<math>\rho^\prime \,\!</math>) by a matrix (<math>A \,\!</math>).  (<math>\rho\,\!</math> can be viewed as a vector.  Simply rearrange the elements of the matrix into a column vector.  <math>A \,\!</math> is then a matrix.)  It is apparent that this is a very general mapping; yet one might think a more general one could be constructed by adding a constant term.  This would be, in fact, not more general as it can be absorbed into the definition of <math>A\,\!</math>.  We recall that the density matrix is required to be Hermitian, positive semi-definite (has no negative eigenvalues), and having a trace of one.  Thus the following are true:
{{Equation | <math>
\rho = \rho^\dagger,
\,\!</math>|6.3}}
{{Equation | <math>
\rho \geq 0,
\,\!</math>|6.4}}
and
{{Equation | <math>
\mbox{Tr}\rho = 1.
\,\!</math>|6.5}}
The first condition ensures real eigenvalues, while the second and third ensure a valid probability interpretation of the density matrix.  
One can show that, given the properties Eqs. [[#eq6.3|(6.3)]], [[#eq6.4|(6.4)]], and [[#eq6.5|(6.5)]], the mapping <math>A\,\!</math> (which can be considered a matrix) has the following properties:
{{Equation | <math>
A_{sr,s^\prime r^\prime} = (A_{rs,r^\prime s^\prime})^*,
\,\!</math>|6.6}}
{{Equation | <math>
\sum_{rsr^\prime s^\prime} x_r^*x_sA_{sr,s^\prime r^\prime}y^*_{s^\prime}y_{r^\prime} \geq 0,
\,\!</math>|6.7}}
and
{{Equation | <math>
\sum_r A_{rr,s^\prime r^\prime} = \delta_{s^\prime r^\prime}.
\,\!</math>|6.8}}
We could also introduce a new matrix, <math>B\,\!</math>, which is related to 
<math>A\,\!</math> by relabeling, 
{{Equation | <math>
B_{rr^\prime,s s^\prime}\equiv A_{sr,s^\prime r^\prime}.
\,\!</math>|6.9}}
This has the following properties:
{{Equation | <math>
B_{rr^\prime,s s^\prime}=(B_{ss^\prime,r r^\prime})^*,
\,\!</math>|6.10}}
{{Equation | <math>
\sum_{rsr^\prime s^\prime}z^*_{rr^\prime}B_{rr^\prime,s s^\prime}z_{ss^\prime} \geq 0,
\,\!</math>|6.11}}
and
{{Equation | <math>
\sum_r B_{rr^\prime,r s^\prime} = \delta_{r^\prime s^\prime}.
\,\!</math>|6.12}}
Now the important point to note is that <math>B\,\!</math> can be considered 
a Hermitian matrix and thus diagonalizable.  Letting 
<math>\eta_\alpha\,\!</math> be its eigenvalues and <math>\xi^{(\alpha)}\,\!</math> the 
corresponding eigenvectors, we see that the mapping 
[[#eq6.2|(6.2)]] can be written as 
{{Equation | <math>
\rho^\prime_{r^\prime s^\prime} = \sum_\alpha 
               \eta_\alpha \xi^{(\alpha)}_{r^\prime r} \rho_{rs} \xi^{(\alpha)*}_{s^\prime s}, 
\,\!</math>|6.13}}
or in a short-hand notation (defining <math>\xi^{(\alpha)}_{r^\prime r} = C_{(\alpha)}\,\!</math>),
<center><math>
\rho^\prime = \sum_\alpha \eta_\alpha C_{(\alpha)}^{}\rho C_{(\alpha)}^\dagger.
\,\!</math></center>

If all of the <math>\eta_\alpha\,\!</math> are positive, then a factor of <math>\sqrt{\eta_\alpha}\,\!</math> can be absorbed into the  <math>C_{(\alpha)}\,\!</math>.  In other words, if we define <math>E_{(\alpha)}= \sqrt{\eta_\alpha}\; C_{(\alpha)}\,\!</math>, then the map can be written as 
{{Equation | <math>
\rho^\prime = \sum_\alpha E_{(\alpha)}^{}\rho E_{(\alpha)}^\dagger.
\,\!</math>|6.14}}
This is what is sometimes called the Operator-Sum representation or Kraus decomposition, originally given in  [[Bibliography#SMR|SMR [11]]].

===Modelling Open System Evolution===

Noise in a quantum system can arise in two different ways.  The first is through imperfect controls; a unitary transformation is not implemented exactly as one would like due to experimental limitations.  The second is through an unwanted interaction with another system, usually called a bath or environment.  Both of these can be modeled using completely positive maps if the assumption is made that the system and bath are initially uncorrelated.  The definition, concept, and assumption of complete positivity will be discussed in a later section.  

====Initially Uncorrelated System and Bath====

The dynamics of an open quantum system coupled to a bath is formally obtained from the evolution <math>U=\exp(-iHt)\,\!</math> under the combined system-bath Hamiltonian, 
{{Equation | <math>
H=H_{S}\otimes I + I\otimes H_{B} + \sum_{\gamma }S_{\gamma }\otimes B_{\gamma },
\,\!</math>|6.15}}
where <math>H_{S}\,\!</math> is the Hamiltonian for the system alone, <math>H_{B}\,\!</math> is the
Hamiltonian for the bath alone, and the <math>S_{\gamma }\,\!</math> and <math>B_{\gamma }\,\!</math> are
operators on the system and the bath respectively.  This last term couples the system to the bath so that the system is no longer considered a closed quantum system; the bath and system do not evolve independently.  If we assume that the system and the bath are decoupled at the beginning of the experiment, then we may write at <math>t = 0\,\!</math>
<center> <math>
\rho(t=0) = \rho_S \otimes \rho_B.
\,\!</math></center>
We then act with a unitary operator on the closed system (our system plus the bath) and trace (or average) over the bath using a [[Index#P|partial trace]] to get
{{Equation | <math>
\rho_S(t)=\mathrm{Tr}_{B}[{U}\left( \rho_S (0)\otimes \rho_{B}(0)\right) 
          {U}^{\dagger }]
\,\!</math>|6.16}}
where <math>\rho_S (0)\,\!</math> is the initial density matrix of the (open) system and <math>\rho_{B}(0)\,\!</math> is the initial density matrix of the bath.  If we take the bath to be in a state <math>\rho_B = \sum_i \mu_i|i\rangle\langle i|\,\!</math>, then we can write Eq. [[#eq6.16|(6.16)]] as 
{{Equation|<math>\begin{align}
\rho_S^\prime(t) &= \sum_{i,j} \langle j|(U_{tot}(t)
\rho_S(0)\otimes \mu_i|i\rangle\langle i| U_{tot}^\dagger (t)|j\rangle 
  \\
              &= \sum_{i,j}\mu_i \langle j|U_{tot}(t) |i\rangle
 \rho_S(0)\langle i| U_{tot}^\dagger(t) |j\rangle.
\end{align}
</math>|6.17}} 
Now we may define a new index, <math>\alpha \equiv (i,j)\,\!</math>, as well as
{{Equation | <math>
E_\alpha(t) \equiv \sqrt{\mu_i}\;\langle j|U_{tot}(t) |i\rangle.
\,\!</math>|6.18}}
In an analogous way, we define <math>E_\alpha^\dagger\,\!</math> so that the [[Index#O|operator-sum representation]] is given by 
{{Equation | <math>
\rho_S^\prime (t)= \sum_\alpha E_\alpha(t) \rho_S E_\alpha^\dagger(t). 
\,\!</math>|6.19}}
Note the relation to Eq.[[#eq6.14|(6.14)]].  It should be noted that in some places the definition [[#eq6.18|(6.18)]] will be used without the factor <math>\sqrt{\mu_i}\,\!</math>; this is, however, of little consequence.
The equation [[#eq6.19|(6.19)]] is the operator 
sum decomposition or the Kraus decomposition (or, as it was initially called, the eigenvalue decomposition) that was outlined in the last section.  The <math>E\,\!</math>s are the [[Index#K|Kraus operators]].  

We should note that, in order for the density matrix to keep its trace equal to one (in other words for the map to be trace-preserving), 
<center><math>
\sum_\alpha E_\alpha^\dagger E_\alpha = I_S.  
\,\!</math></center>

It can be shown that this agrees with the most general quantum evolution consistent with the condition of complete positivity, the so-called operator sum representation (OSR) [[Bibliography#SMR|SMR [11]]], [[Bibliography#Kraus:83|Kraus [12]]], [[Bibliography#Schumacher:96a|Schumacher [13]]]: 
{{Equation|<math>\begin{align}
 \mathcal{E}_{t}(\rho(0)) &\equiv  \rho (t)   \\
  &= \!\sum_{\mu \nu }\!E_{\mu \nu }(t)\rho (0)E_{\mu \nu }^{\dagger}(t) 
\end{align}
</math>|6.20}}

====Fixed-Basis Operations====

Another expression for the time-dependent density operator is the following: 
{{Equation|<math>\begin{align}
 \mathcal{E}_{t}(\rho(0)) =  \sum_{\alpha ,\beta }\!\chi _{\alpha \beta }(t)K_{\alpha }\rho(0)
         K_{\beta }^{\dagger}.
\end{align}
</math>|6.21}} 
In the last section, we defined the operators <math>E_{\mu \nu }(t)=\sqrt{\lambda _{\nu }}\langle
\mu |U(t)|\nu \rangle \,\!</math> where <math>U=\exp (-iHt/\hbar )\,\!</math> and the initial bath
density matrix written as <math>\rho _{B}(0)=\sum_{\nu }\lambda _{\nu }|\nu
\rangle \langle \nu |\,\!</math> [[Bibliography#Lidar:CP01|Lidar, et al [14].]]. They satisfy the normalization
condition, <math>\sum_{\mu }E_{\mu \nu }^{\dagger }E_{\mu \nu } = I_{S}\,\!</math>.  The matrix <math>\chi _{\alpha \beta
}(t)=\sum_{i}b_{i,\alpha }b_{i,\beta }^{\ast }\,\!</math> is a time-dependent
Hermitian coefficient matrix defined by a transformation of the Kraus
operators to a fixed operator basis <math>K_{\alpha }\,\!</math>: <math>E_{\mu \nu
}(t)=\sum_{\alpha }b_{\mu \nu ;\alpha }(t)K_{\alpha }\,\!</math>. 

We can express our <math>E_\alpha\,\!</math> in terms of a fixed basis of operators.  
The <math>A_\alpha\,\!</math> are functions of time (since <math>U_{tot}\,\!</math> is) 
and are thus ''not'' fixed operators.  We can expand these <math>A\,\!</math>'s in terms of a complete fixed 
chosen basis <math>\{K_m\}\,\!</math>: 
{{Equation | <math>
E_\alpha = \sum_m b_{\alpha,m}(t) K_m,
\,\!</math>|6.22}}
so that the time-dependence is in the <math>b\,\!</math>'s.  Now we would like to see how Eq. [[#eq6.21|(6.21)]] transforms under a change of basis, that is, when the <math>K\,\!</math>'s are different.  We will do this to first order in time.  We should note that the very general form of the Hamiltonian (Eq. [[#eq6.15|(6.15)]]) tells us that each term of the Hamiltonian could be made Hermitian depending on the order and grouping in the terms of the sum.  We will not see at any point where this choice will make a significant difference in our analysis since most of the bases we use are arbitrary.  Thus, to first order (and without the factor <math>\sqrt{\mu_i}\,\!</math>)
{{Equation | <math>
E_\alpha \approx \delta_{ij} + 
(-i\Delta t)\sum_\gamma S_\gamma \langle i | B_\gamma |j\rangle.
\,\!</math>|6.23}}
Since the <math>S_\gamma\,\!</math> are Hermitian, they can be expanded in a 
complete basis for the algebra of the <math>d\times d\,\!</math> 
unitary matrices, plus 
the identity if the system is <math>d\,\!</math>-dimensional.  Therefore, under a 
unitary transformation of the operators <math>K\,\!</math> or for that matter <math>E\,\!</math>, 
the operators transform as 
{{Equation | <math>
K^\prime_m = UK_m U^\dagger = \sum_n U a_{mn} \lambda_n U^\dagger,
\,\!</math>|6.24}}
where the set <math>\{\lambda_n\}\,\!</math> are a complete set of basis elements 
for the algebra of <math>d\,\!</math>-dimensional unitary matrices, with <math>n\,\!</math> ranging 
from zero to <math>d^2-1\,\!</math> with <math>\lambda_0\equiv I\,\!</math>.  This transformation 
can be written as 
{{Equation|<math>\begin{align}
E^\prime_\alpha &= \sum_m b_{\alpha m} K^\prime_m   \\
                &= \sum_{m,n,p} b_{\alpha m} a_{mn} R_{np} \lambda_p,
\end{align}
\,\!</math>|6.25}} 
where 
{{Equation | <math>
U\lambda_n U^\dagger = \sum_p R_{np} \lambda_p   
\,\!</math>|6.26}}
defines an action by the adjoint representation of the group.  
Alternatively, we can redefine the <math>b_{\alpha m}\,\!</math> such that 
{{Equation | <math>
\tilde{b}_{\alpha n} =  b_{\alpha m} a_{mn},
\,\!</math>|6.27}}
so that our fixed basis stays fixed and we look at the transformation as an active, rather than a passive one.  (That is, we transform the object instead of the basis.)

It is interesting to note that upon comparison of Eqs. [[#eq6.21|(6.21)]] and [[#eq6.22|(6.22)]] we can identify <math>b\,\!</math>s and <math>K\,\!</math>s as [[Bibliography#Lidar:CP01|Lidar, et al [14].]]
{{Equation | <math>
K_\gamma = S_\gamma,\;\;\;\;\;\;\; 
b_{\gamma,m} = (-i\Delta t)\langle i | B_\gamma |j\rangle.
\,\!</math>|6.28}}

===Unitary Degree of Freedom in the OSR===

The operator sum decomposition is not unique.  There is a freedom in choosing the operators in Eq. [[#eq6.14|(6.14)]] (or [[#eq6.19|(6.19)]].  It turns out, and this will be shown, that this is equivalent to having the freedom to choose a basis for the bath.  

====Unitary Freedom====

Let us consider an operator-sum decomposition, of the form given in Eq. [[#eq6.19|(6.19)]] which represents some quantum process whereby one quantum system, a bath, interacts with another and is then traced out.  Now consider another given by a linear combination of the operators 
<math>E_\alpha\,\!</math>, 
{{Equation | <math>
F_\beta = \sum_\alpha u_{\beta\alpha}E_\alpha.
\,\!</math>|6.29}}
Now, let us construct the operator-sum representation for the set of operators <math> \{ D_\beta \}\,\!</math>.  This is 
{{Equation | <math>
\sum_\beta F_\beta\rho_S F_\beta^\dagger = \sum_{\alpha,\gamma}
u_{\beta\alpha}E_\alpha \rho_S u^*_{\beta\gamma}E_\gamma^\dagger.
\,\!</math>|6.30}}
Rewriting this as 
{{Equation | <math>
\sum_\beta F_\beta\rho F_\beta^\dagger = \sum_{\alpha,\gamma}
(u_{\gamma\beta})^\dagger u_{\beta\alpha} E_\alpha \rho E_\gamma^\dagger,
\,\!</math>|6.31}}
where <math>(u_{\gamma\beta})^\dagger = u^*_{\beta\gamma}\,\!</math>,
(i.e. the  <math>(u_{\gamma\beta})\,\!</math> are elements of a matrix  <math>U\,\!</math>)
we see that if
<math>(u_{\gamma\beta})^\dagger u_{\beta\alpha}=\delta_{\gamma\alpha}\,\!</math>,
then 
{{Equation | <math>
\sum_\beta F_\beta\rho_S F_\beta^\dagger = \rho_S^\prime.
\,\!</math>|6.32}}
Therefore the two different sets of operators <math> \{ E_\alpha \}\,\!</math> and <math> \{ F_\beta \}\,\!</math> give rise to the same open-system evolution of <math>\rho_S\,\!</math> if they are related by a unitary transformation of the form of <math> U \,\!</math>.  Note that if the two sets do not have the same number of elements, then we may either append zeroes (as is done
in [[Bibliography#NielsenChuang:book|Nielsen and Chuang's book [2]]]) or let <math>U\,\!</math> be a <nowiki>''right unitary matrix''</nowiki>, which means the matrix <math>U^\dagger U = I\,\!</math>, but the matrix need not be square or
have <math>UU^\dagger  = I\,\!</math>.

====Physical Interpretation of the Unitary Freedom====

It is fairly easy to show that this unitary degree of freedom is associated with a change of the bath basis.  Let us first recall
{{Equation|<math>
E_{ij} = \langle i| U_{tot}^\dagger(t) |j\rangle.
\,\!</math>|6.33}} 
So that when we write <math>u_{\beta\alpha}E_{\alpha}\,\!</math> we interpret this as 
<math>u_{kj}E_{ij} = \sqrt{\mu_j}\langle i| U_{tot}^\dagger(t) |j\rangle.\,\!</math>.  However, this clearly makes no difference in the result since we are tracing over the bath.  One could just as well include this unitary transformation which changes the basis of the bath in <math>U_{tot}\,\!</math>.

===Examples===

In this section several examples are given which are quite important to quantum error correction and quantum computing.  These are all examples of actions on single qubit density operators which, not only provide very relevant examples, but are also quite simple.  

====Example 1: Bit-flip====

Bit-flip errors have a direct analogy in classical computation.  If a <math>\left\vert 1\right\rangle\,\!</math> is input, but, due to noise a  <math>\left\vert 0\right\rangle\,\!</math> is output (or vice versa) then a bit-flip error has occurred.  If a quantum bit-flip error occurs with some probability <math>p\,\!</math>, we may express this as
{{Equation|<math>
\rho^\prime = (1-p)\rho + p \sigma_x \rho \sigma_x,
\,\!</math>|6.34}} 
where <math>\sigma_x\,\!</math> is the  <math>X\,\!</math> [[Chapter 2 - Qubits and Collections of Qubits#The Pauli Matrices|The Pauli Matrix]], and <math>\rho \,\!</math> can be expressed as in Eq.[[Chapter 3 - Physics of Quantum Information#eq3.33|(3.33)]].  This has a clear interpretation.  There is a probability <math>p\,\!</math> that there is a bit flip, and there is a probability <math>(1-p)\,\!</math> that nothing happens to the density operator.  The operators of the operator-sum representation of this map can be taken to be <math>\sqrt{(1-p)}I\,\!</math> and <math>\sqrt{p} \sigma_x\,\!</math>.  This is a very important type of error and therefore will be discussed in connection with quantum error prevention methods.

====Example 2: Phase-flip====

Phase-flip errors do not have a direct analogue in classical computation.  In this case a <math>\left\vert 1\right\rangle\,\!</math> will acquire a (-1) sign change due to some noise, but a  <math>\left\vert 0\right\rangle\,\!</math> is unaffected.  If a quantum phase-flip error occurs with some probability <math>p\,\!</math>, we may express the phase flip error as
{{Equation|<math>
\rho^\prime = (1-p)\rho + p \sigma_z \rho \sigma_z,
\,\!</math>|6.35}} 
where <math>\sigma_z\,\!</math> is the  <math>Z\,\!</math> [[Chapter 2 - Qubits and Collections of Qubits#The Pauli Matrices|The Pauli Matrix]], and <math>\rho \,\!</math> can be expressed as in Eq.[[Chapter 3 - Physics of Quantum Information#eq3.33|(3.33)]].  Here there is a probability <math>p\,\!</math> that a phase-flip occurs, and there is a probability <math>(1-p)\,\!</math> that nothing happens to the density operator.  The operators of the operator-sum representation of this map can be taken to be <math>\sqrt{(1-p)}I\,\!</math> and <math>\sqrt{p} \sigma_z\,\!</math>.  This is another very important type of error.

====Example 3: Bit-flip and Phase-flip====

Suppose that both errors occur.  If both errors occur with some probability <math>p\,\!</math>, we may express the error as
{{Equation|<math>
\rho^\prime = (1-p)\rho + p \sigma_y \rho \sigma_y,
\,\!</math>|6.36}} 
where <math>\sigma_y=i\sigma_x\sigma_z\,\!</math>, is the  <math>Y\,\!</math> [[Chapter 2 - Qubits and Collections of Qubits#The Pauli Matrices|The Pauli Matrix]]. As before, <math>\rho \,\!</math> can be expressed as in Eq.[[Chapter 3 - Physics of Quantum Information#eq3.33|(3.33)]].  Here there is a probability <math>p\,\!</math> that a <math>Y \,\!</math> occurs, and there is a probability <math>(1-p)\,\!</math> that nothing happens to the density operator.  The operators of the operator-sum representation of this map can be taken to be <math>\sqrt{(1-p)}I\,\!</math> and <math>\sqrt{p} \sigma_y\,\!</math>.   Note that <math>\sigma_y^\dagger = (i\sigma_x\sigma_z)^\dagger = -i\sigma_z\sigma_x\,\!</math>.


It is important to note that the [[Chapter 2 - Qubits and Collections of Qubits#The Pauli Matrices|The Pauli Matrices]] form a basis for all of the possible errors on a qubit as discussed in Section [[Chapter 2 - Qubits and Collections of Qubits#Two-State Example: Bloch Sphere|3.5.4]].

====Example 4: Depolarizing Error====

A depolarizing error is an error which is symmetric in the three possible errors.  For example, suppose that each of the three possible types of errors on a qubit all occur with equal probability.  Let this probability be <math> p/3 \,\!</math>.  The depolarizing operation is then
{{Equation|<math>
\rho^\prime = (1-p)\rho + (p/3) \sigma_x \rho \sigma_x + (p/3) \sigma_y \rho \sigma_y + (p/3) \sigma_z \rho \sigma_z,
\,\!</math>|6.37}} 
Using Eq.[[Chapter 3 - Physics of Quantum Information#eq3.37|(3.37)]] and Eq.[[Chapter 3 - Physics of Quantum Information#eq3.33|(3.33)]], this can also be written as
{{Equation|<math>
\rho^\prime = \frac{1}{2}(I + (1-4p/3) n_x \sigma_x + (1-4p/3) n_y\sigma_y  + (1-4p/3) n_z\sigma_z) = \frac{1}{2}(I +(1-4p/3)\vec{n}\cdot\vec{\sigma}).
\,\!</math>|6.38}}
Thus the depolarizing error has quite interesting and simple properties since it can be seen as a uniform shrinking of the polarization vector <math>\vec{n}\,\!</math>.

===Notes===

Errors are the obstacle to building a quantum computing device.  These errors are caused by noise in quantum systems.  Noise in quantum systems is also known as decoherence, although the original meaning of decoherence referred (roughly) to the loss of off-diagonal terms of the density matrix.  (An analogy of such loss is the <math>Z\,\!</math> error example above.)  When a set of entangled states experiences decoherence, entanglement is lost.  Since entanglement is believed to be the source of advantages of quantum computing and a great deal of other quantum information processing, this is a serious concern.  

In the following chapters, several methods designed to reduce or eliminate noise in quantum systems will be discussed.



[[Chapter 7 - Quantum Error Correcting Codes#Introduction|Continue to '''Chapter 7 - Quantum Error Correcting Codes''']]