Do the Kraus operators of a CPTP channel need to be orthogonal?Kraus operator of dephasing channelHow does the vectorization map relate to the Choi and Kraus representations of a channel?How many Kraus operators are required to characterise a channel with different start and end dimensions?Do the eigenvalues of the Choi matrix have any direct physical interpretation?Is the Kraus representation of a quantum channel equivalent to a unitary evolution in an enlarged space?Tensor product properties used to obtain Kraus operator decomposition of a channelKraus operator of dephasing channelIsometric Extension of an Erasure ChannelWhat's the difference between Kraus operators and measurement operators?Direct derivation of the Kraus representation from the natural representation, using SVDHow does a map being “only” positive reflect on its Choi representation?Does the dilation in Naimark's theorem produce a state?Are CPTP operators and unitary operators the same thing?Can the Kraus decomposition always be chosen to be a statistical mixture of unitary evolutions?

Can you be convicted for being a murderer twice?

The economy of trapping

Can my boyfriend, who lives in the UK and has a Polish passport, visit me in the USA?

Is there such a thing as too inconvenient?

Why doesn't the Falcon-9 first stage use three legs to land?

Injectivity radius of manifolds with boundary

Why my earth simulation is slower than the reality?

Have only girls been born for a long time in this village?

Are there any plans for handling people floating away during an EVA?

Sleeping solo in a double sleeping bag

Is refusing to concede in the face of an unstoppable Nexus combo punishable?

Something in the TV

Is "stainless" a bulk or a surface property of stainless steel?

Dark side of an exoplanet - if it was earth-like would its surface light be detectable?

How to specify and fit a hybrid machine learning - linear model

A second course in the representation theory

Why we don't have vaccination against all diseases which are caused by microbes?

How big would a Daddy Longlegs Spider need to be to kill an average Human?

Why don't politicians push for fossil fuel reduction by pointing out their scarcity?

Is it insecure to have an ansible user with passwordless sudo?

Vacuum collapse -- why do strong metals implode but glass doesn't?

Overwrite file only if data

!I!n!s!e!r!t! !n!b!e!t!w!e!e!n!

How to compare two different formulations of a problem?



Do the Kraus operators of a CPTP channel need to be orthogonal?


Kraus operator of dephasing channelHow does the vectorization map relate to the Choi and Kraus representations of a channel?How many Kraus operators are required to characterise a channel with different start and end dimensions?Do the eigenvalues of the Choi matrix have any direct physical interpretation?Is the Kraus representation of a quantum channel equivalent to a unitary evolution in an enlarged space?Tensor product properties used to obtain Kraus operator decomposition of a channelKraus operator of dephasing channelIsometric Extension of an Erasure ChannelWhat's the difference between Kraus operators and measurement operators?Direct derivation of the Kraus representation from the natural representation, using SVDHow does a map being “only” positive reflect on its Choi representation?Does the dilation in Naimark's theorem produce a state?Are CPTP operators and unitary operators the same thing?Can the Kraus decomposition always be chosen to be a statistical mixture of unitary evolutions?






.everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty margin-bottom:0;








3












$begingroup$


Let $Phiinmathrm T(mathcal X,mathcal Y)$ be a CPTP map.
Any such channel admits a Kraus decomposition of the form
$$Phi(X)=sum_a A_a X A_a^dagger,$$
for a set of operators $A_ainmathrmLin(mathcal X,mathcal Y)$ satisfying $sum_a A_a^dagger A_a=I_mathcal X$.



The standard way to prove this passes through the Choi representation $J(Phi)$ of the channel, showing that CP is equivalent to $J(Phi)$ being a positive operator, and therefore $J(Phi)$ admits a spectral decomposition with positive eigenvalues, and finally realise that the eigenvectors of $J(Phi)$ are essentially equivalent to the Kraus operators $A_a$ (upon some reinterpretation of the indices). This is shown for example at pag. 83 (theorem 2.22) of Watrous' TQI book, and in some form also in this other answer here, as well as in a slightly different formalism in this other answer of mine.



What puzzles me about this is the following. The components in the spectral decomposition of the Choi operator $J(Phi)$ will also have to satisfy an additional property, one that I haven't seen discussed in this context: the orthogonality of the eigenvectors.



If $J(Phi)=sum_a v_a v_a^dagger$, then we also know that the vectors $v_a$ are orthogonal. More specifically, we can always write $J(Phi)=sum_a p_a v_a v_a^dagger$ for some $p_age0$ and $langle v_a,v_brangle=delta_ab$.
Remembering that here $v_ainmathcal Yotimesmathcal X$, these vectors are essentially the Kraus operators of the channel in the sense that $(v_a)_alpha i=(A_a)_alpha i$ (using greek and latin letters to denote indices in $mathcal Y$ and $mathcal X$, respectively).



The orthogonality of the $v_a$ is thus equivalent to the fact that Kraus operators must satisfy
$$operatornameTr(A_a^dagger A_b)equiv sum_ialpha(A_a^*)_alpha i (A_b)_alpha i=p_adelta_ab.tag A$$



However, this property doesn't seem to be usually remarked. Moreover, people often refer to Kraus operators that do not satisfy this orthogonality condition. An example is the Kraus operators used for the dephasing channel in this answer.



The question is therefore as follows: should the property (A) be considered as a necessary condition for a set $A_a_a$ to be called a set of Kraus operators of a channel? Moreover, regardless of the terminology that one chooses to use, is there any advantage in choosing a "Kraus decomposition" for the channel that is made out of orthogonal operators, rather than non-orthogonal ones?










share|improve this question











$endgroup$




















    3












    $begingroup$


    Let $Phiinmathrm T(mathcal X,mathcal Y)$ be a CPTP map.
    Any such channel admits a Kraus decomposition of the form
    $$Phi(X)=sum_a A_a X A_a^dagger,$$
    for a set of operators $A_ainmathrmLin(mathcal X,mathcal Y)$ satisfying $sum_a A_a^dagger A_a=I_mathcal X$.



    The standard way to prove this passes through the Choi representation $J(Phi)$ of the channel, showing that CP is equivalent to $J(Phi)$ being a positive operator, and therefore $J(Phi)$ admits a spectral decomposition with positive eigenvalues, and finally realise that the eigenvectors of $J(Phi)$ are essentially equivalent to the Kraus operators $A_a$ (upon some reinterpretation of the indices). This is shown for example at pag. 83 (theorem 2.22) of Watrous' TQI book, and in some form also in this other answer here, as well as in a slightly different formalism in this other answer of mine.



    What puzzles me about this is the following. The components in the spectral decomposition of the Choi operator $J(Phi)$ will also have to satisfy an additional property, one that I haven't seen discussed in this context: the orthogonality of the eigenvectors.



    If $J(Phi)=sum_a v_a v_a^dagger$, then we also know that the vectors $v_a$ are orthogonal. More specifically, we can always write $J(Phi)=sum_a p_a v_a v_a^dagger$ for some $p_age0$ and $langle v_a,v_brangle=delta_ab$.
    Remembering that here $v_ainmathcal Yotimesmathcal X$, these vectors are essentially the Kraus operators of the channel in the sense that $(v_a)_alpha i=(A_a)_alpha i$ (using greek and latin letters to denote indices in $mathcal Y$ and $mathcal X$, respectively).



    The orthogonality of the $v_a$ is thus equivalent to the fact that Kraus operators must satisfy
    $$operatornameTr(A_a^dagger A_b)equiv sum_ialpha(A_a^*)_alpha i (A_b)_alpha i=p_adelta_ab.tag A$$



    However, this property doesn't seem to be usually remarked. Moreover, people often refer to Kraus operators that do not satisfy this orthogonality condition. An example is the Kraus operators used for the dephasing channel in this answer.



    The question is therefore as follows: should the property (A) be considered as a necessary condition for a set $A_a_a$ to be called a set of Kraus operators of a channel? Moreover, regardless of the terminology that one chooses to use, is there any advantage in choosing a "Kraus decomposition" for the channel that is made out of orthogonal operators, rather than non-orthogonal ones?










    share|improve this question











    $endgroup$
















      3












      3








      3





      $begingroup$


      Let $Phiinmathrm T(mathcal X,mathcal Y)$ be a CPTP map.
      Any such channel admits a Kraus decomposition of the form
      $$Phi(X)=sum_a A_a X A_a^dagger,$$
      for a set of operators $A_ainmathrmLin(mathcal X,mathcal Y)$ satisfying $sum_a A_a^dagger A_a=I_mathcal X$.



      The standard way to prove this passes through the Choi representation $J(Phi)$ of the channel, showing that CP is equivalent to $J(Phi)$ being a positive operator, and therefore $J(Phi)$ admits a spectral decomposition with positive eigenvalues, and finally realise that the eigenvectors of $J(Phi)$ are essentially equivalent to the Kraus operators $A_a$ (upon some reinterpretation of the indices). This is shown for example at pag. 83 (theorem 2.22) of Watrous' TQI book, and in some form also in this other answer here, as well as in a slightly different formalism in this other answer of mine.



      What puzzles me about this is the following. The components in the spectral decomposition of the Choi operator $J(Phi)$ will also have to satisfy an additional property, one that I haven't seen discussed in this context: the orthogonality of the eigenvectors.



      If $J(Phi)=sum_a v_a v_a^dagger$, then we also know that the vectors $v_a$ are orthogonal. More specifically, we can always write $J(Phi)=sum_a p_a v_a v_a^dagger$ for some $p_age0$ and $langle v_a,v_brangle=delta_ab$.
      Remembering that here $v_ainmathcal Yotimesmathcal X$, these vectors are essentially the Kraus operators of the channel in the sense that $(v_a)_alpha i=(A_a)_alpha i$ (using greek and latin letters to denote indices in $mathcal Y$ and $mathcal X$, respectively).



      The orthogonality of the $v_a$ is thus equivalent to the fact that Kraus operators must satisfy
      $$operatornameTr(A_a^dagger A_b)equiv sum_ialpha(A_a^*)_alpha i (A_b)_alpha i=p_adelta_ab.tag A$$



      However, this property doesn't seem to be usually remarked. Moreover, people often refer to Kraus operators that do not satisfy this orthogonality condition. An example is the Kraus operators used for the dephasing channel in this answer.



      The question is therefore as follows: should the property (A) be considered as a necessary condition for a set $A_a_a$ to be called a set of Kraus operators of a channel? Moreover, regardless of the terminology that one chooses to use, is there any advantage in choosing a "Kraus decomposition" for the channel that is made out of orthogonal operators, rather than non-orthogonal ones?










      share|improve this question











      $endgroup$




      Let $Phiinmathrm T(mathcal X,mathcal Y)$ be a CPTP map.
      Any such channel admits a Kraus decomposition of the form
      $$Phi(X)=sum_a A_a X A_a^dagger,$$
      for a set of operators $A_ainmathrmLin(mathcal X,mathcal Y)$ satisfying $sum_a A_a^dagger A_a=I_mathcal X$.



      The standard way to prove this passes through the Choi representation $J(Phi)$ of the channel, showing that CP is equivalent to $J(Phi)$ being a positive operator, and therefore $J(Phi)$ admits a spectral decomposition with positive eigenvalues, and finally realise that the eigenvectors of $J(Phi)$ are essentially equivalent to the Kraus operators $A_a$ (upon some reinterpretation of the indices). This is shown for example at pag. 83 (theorem 2.22) of Watrous' TQI book, and in some form also in this other answer here, as well as in a slightly different formalism in this other answer of mine.



      What puzzles me about this is the following. The components in the spectral decomposition of the Choi operator $J(Phi)$ will also have to satisfy an additional property, one that I haven't seen discussed in this context: the orthogonality of the eigenvectors.



      If $J(Phi)=sum_a v_a v_a^dagger$, then we also know that the vectors $v_a$ are orthogonal. More specifically, we can always write $J(Phi)=sum_a p_a v_a v_a^dagger$ for some $p_age0$ and $langle v_a,v_brangle=delta_ab$.
      Remembering that here $v_ainmathcal Yotimesmathcal X$, these vectors are essentially the Kraus operators of the channel in the sense that $(v_a)_alpha i=(A_a)_alpha i$ (using greek and latin letters to denote indices in $mathcal Y$ and $mathcal X$, respectively).



      The orthogonality of the $v_a$ is thus equivalent to the fact that Kraus operators must satisfy
      $$operatornameTr(A_a^dagger A_b)equiv sum_ialpha(A_a^*)_alpha i (A_b)_alpha i=p_adelta_ab.tag A$$



      However, this property doesn't seem to be usually remarked. Moreover, people often refer to Kraus operators that do not satisfy this orthogonality condition. An example is the Kraus operators used for the dephasing channel in this answer.



      The question is therefore as follows: should the property (A) be considered as a necessary condition for a set $A_a_a$ to be called a set of Kraus operators of a channel? Moreover, regardless of the terminology that one chooses to use, is there any advantage in choosing a "Kraus decomposition" for the channel that is made out of orthogonal operators, rather than non-orthogonal ones?







      quantum-operation quantum-channel






      share|improve this question















      share|improve this question













      share|improve this question




      share|improve this question








      edited Aug 8 at 15:13







      glS

















      asked Aug 8 at 12:00









      glSglS

      5,6231 gold badge10 silver badges45 bronze badges




      5,6231 gold badge10 silver badges45 bronze badges























          2 Answers
          2






          active

          oldest

          votes


















          4












          $begingroup$

          There is an ambiguity in the choice of Kraus operators: If $E_a$ is a set of Kraus operators for a channel $mathcal E$, so is $F_b$ with $F_b=sum_a v_ab E_a$, with $(v_ab)$ an isometry.



          In particular, you can choose a $(v)$ which diagonalizes the matrix $X_ac=mathrmtr[E_a^dagger E_b]$, in which case $F_b$ satisfies your orthogonality property.



          However, this is an ambiguity in the Kraus representation, and all such representations are called Kraus representations. That's the way it is, without a condition (A). If you think condition (A) is good to have, then you should give it a different name.



          It is likely that this representation has certain advantages, just as an eigenvalue decomposition. Off the top of my head, it should e.g. mean that the different errors introduced by the different Kraus operators are orthogonal, so it should be a convenient representation in terms of error correction. Also, it is one representation with the minimal number of Kraus operators. I'm sure there are others.






          share|improve this answer









          $endgroup$






















            0












            $begingroup$

            To answer your two questions separately:



            1) The property (A) is not a necessary condition for a set to be a Kraus decomposition. Your derivation is right - Kraus operators obtained from the eigenvectors of the Choi matrix (or the process matrix, for that matter), are almost always orthogonal to each other. Almost, because if the Choi matrix is degenerate, you can find a non-orthogonal eigenbasis $c_lambda_i$ for an eigenspace $lambda_i$ with $a.m. > 1$. This results in non-orthogonal Kraus operators as well.



            2) There is yet another option: Kraus operators may be linear combinations of each other (e.g. the operators in the other answer you linked). That also means that they never can all be orthogonal to each other. It also introduces some form of ambiguity, because there are then multiple ways to express the action of the channel.



            For instance, the canonical way of expressing the dephasing channel is with Kraus operators $A_1 = sqrt1-pI$ and $A_2 = sqrtpZ$ (which are, in fact, orthogonal). By limiting your answer to orthogonal Kraus operators, you omit this ambiguity.






            share|improve this answer









            $endgroup$

















              Your Answer








              StackExchange.ready(function()
              var channelOptions =
              tags: "".split(" "),
              id: "694"
              ;
              initTagRenderer("".split(" "), "".split(" "), channelOptions);

              StackExchange.using("externalEditor", function()
              // Have to fire editor after snippets, if snippets enabled
              if (StackExchange.settings.snippets.snippetsEnabled)
              StackExchange.using("snippets", function()
              createEditor();
              );

              else
              createEditor();

              );

              function createEditor()
              StackExchange.prepareEditor(
              heartbeatType: 'answer',
              autoActivateHeartbeat: false,
              convertImagesToLinks: false,
              noModals: true,
              showLowRepImageUploadWarning: true,
              reputationToPostImages: null,
              bindNavPrevention: true,
              postfix: "",
              imageUploader:
              brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
              contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
              allowUrls: true
              ,
              noCode: true, onDemand: true,
              discardSelector: ".discard-answer"
              ,immediatelyShowMarkdownHelp:true
              );



              );













              draft saved

              draft discarded


















              StackExchange.ready(
              function ()
              StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fquantumcomputing.stackexchange.com%2fquestions%2f6968%2fdo-the-kraus-operators-of-a-cptp-channel-need-to-be-orthogonal%23new-answer', 'question_page');

              );

              Post as a guest















              Required, but never shown

























              2 Answers
              2






              active

              oldest

              votes








              2 Answers
              2






              active

              oldest

              votes









              active

              oldest

              votes






              active

              oldest

              votes









              4












              $begingroup$

              There is an ambiguity in the choice of Kraus operators: If $E_a$ is a set of Kraus operators for a channel $mathcal E$, so is $F_b$ with $F_b=sum_a v_ab E_a$, with $(v_ab)$ an isometry.



              In particular, you can choose a $(v)$ which diagonalizes the matrix $X_ac=mathrmtr[E_a^dagger E_b]$, in which case $F_b$ satisfies your orthogonality property.



              However, this is an ambiguity in the Kraus representation, and all such representations are called Kraus representations. That's the way it is, without a condition (A). If you think condition (A) is good to have, then you should give it a different name.



              It is likely that this representation has certain advantages, just as an eigenvalue decomposition. Off the top of my head, it should e.g. mean that the different errors introduced by the different Kraus operators are orthogonal, so it should be a convenient representation in terms of error correction. Also, it is one representation with the minimal number of Kraus operators. I'm sure there are others.






              share|improve this answer









              $endgroup$



















                4












                $begingroup$

                There is an ambiguity in the choice of Kraus operators: If $E_a$ is a set of Kraus operators for a channel $mathcal E$, so is $F_b$ with $F_b=sum_a v_ab E_a$, with $(v_ab)$ an isometry.



                In particular, you can choose a $(v)$ which diagonalizes the matrix $X_ac=mathrmtr[E_a^dagger E_b]$, in which case $F_b$ satisfies your orthogonality property.



                However, this is an ambiguity in the Kraus representation, and all such representations are called Kraus representations. That's the way it is, without a condition (A). If you think condition (A) is good to have, then you should give it a different name.



                It is likely that this representation has certain advantages, just as an eigenvalue decomposition. Off the top of my head, it should e.g. mean that the different errors introduced by the different Kraus operators are orthogonal, so it should be a convenient representation in terms of error correction. Also, it is one representation with the minimal number of Kraus operators. I'm sure there are others.






                share|improve this answer









                $endgroup$

















                  4












                  4








                  4





                  $begingroup$

                  There is an ambiguity in the choice of Kraus operators: If $E_a$ is a set of Kraus operators for a channel $mathcal E$, so is $F_b$ with $F_b=sum_a v_ab E_a$, with $(v_ab)$ an isometry.



                  In particular, you can choose a $(v)$ which diagonalizes the matrix $X_ac=mathrmtr[E_a^dagger E_b]$, in which case $F_b$ satisfies your orthogonality property.



                  However, this is an ambiguity in the Kraus representation, and all such representations are called Kraus representations. That's the way it is, without a condition (A). If you think condition (A) is good to have, then you should give it a different name.



                  It is likely that this representation has certain advantages, just as an eigenvalue decomposition. Off the top of my head, it should e.g. mean that the different errors introduced by the different Kraus operators are orthogonal, so it should be a convenient representation in terms of error correction. Also, it is one representation with the minimal number of Kraus operators. I'm sure there are others.






                  share|improve this answer









                  $endgroup$



                  There is an ambiguity in the choice of Kraus operators: If $E_a$ is a set of Kraus operators for a channel $mathcal E$, so is $F_b$ with $F_b=sum_a v_ab E_a$, with $(v_ab)$ an isometry.



                  In particular, you can choose a $(v)$ which diagonalizes the matrix $X_ac=mathrmtr[E_a^dagger E_b]$, in which case $F_b$ satisfies your orthogonality property.



                  However, this is an ambiguity in the Kraus representation, and all such representations are called Kraus representations. That's the way it is, without a condition (A). If you think condition (A) is good to have, then you should give it a different name.



                  It is likely that this representation has certain advantages, just as an eigenvalue decomposition. Off the top of my head, it should e.g. mean that the different errors introduced by the different Kraus operators are orthogonal, so it should be a convenient representation in terms of error correction. Also, it is one representation with the minimal number of Kraus operators. I'm sure there are others.







                  share|improve this answer












                  share|improve this answer



                  share|improve this answer










                  answered Aug 8 at 13:32









                  Norbert SchuchNorbert Schuch

                  1,7384 silver badges11 bronze badges




                  1,7384 silver badges11 bronze badges


























                      0












                      $begingroup$

                      To answer your two questions separately:



                      1) The property (A) is not a necessary condition for a set to be a Kraus decomposition. Your derivation is right - Kraus operators obtained from the eigenvectors of the Choi matrix (or the process matrix, for that matter), are almost always orthogonal to each other. Almost, because if the Choi matrix is degenerate, you can find a non-orthogonal eigenbasis $c_lambda_i$ for an eigenspace $lambda_i$ with $a.m. > 1$. This results in non-orthogonal Kraus operators as well.



                      2) There is yet another option: Kraus operators may be linear combinations of each other (e.g. the operators in the other answer you linked). That also means that they never can all be orthogonal to each other. It also introduces some form of ambiguity, because there are then multiple ways to express the action of the channel.



                      For instance, the canonical way of expressing the dephasing channel is with Kraus operators $A_1 = sqrt1-pI$ and $A_2 = sqrtpZ$ (which are, in fact, orthogonal). By limiting your answer to orthogonal Kraus operators, you omit this ambiguity.






                      share|improve this answer









                      $endgroup$



















                        0












                        $begingroup$

                        To answer your two questions separately:



                        1) The property (A) is not a necessary condition for a set to be a Kraus decomposition. Your derivation is right - Kraus operators obtained from the eigenvectors of the Choi matrix (or the process matrix, for that matter), are almost always orthogonal to each other. Almost, because if the Choi matrix is degenerate, you can find a non-orthogonal eigenbasis $c_lambda_i$ for an eigenspace $lambda_i$ with $a.m. > 1$. This results in non-orthogonal Kraus operators as well.



                        2) There is yet another option: Kraus operators may be linear combinations of each other (e.g. the operators in the other answer you linked). That also means that they never can all be orthogonal to each other. It also introduces some form of ambiguity, because there are then multiple ways to express the action of the channel.



                        For instance, the canonical way of expressing the dephasing channel is with Kraus operators $A_1 = sqrt1-pI$ and $A_2 = sqrtpZ$ (which are, in fact, orthogonal). By limiting your answer to orthogonal Kraus operators, you omit this ambiguity.






                        share|improve this answer









                        $endgroup$

















                          0












                          0








                          0





                          $begingroup$

                          To answer your two questions separately:



                          1) The property (A) is not a necessary condition for a set to be a Kraus decomposition. Your derivation is right - Kraus operators obtained from the eigenvectors of the Choi matrix (or the process matrix, for that matter), are almost always orthogonal to each other. Almost, because if the Choi matrix is degenerate, you can find a non-orthogonal eigenbasis $c_lambda_i$ for an eigenspace $lambda_i$ with $a.m. > 1$. This results in non-orthogonal Kraus operators as well.



                          2) There is yet another option: Kraus operators may be linear combinations of each other (e.g. the operators in the other answer you linked). That also means that they never can all be orthogonal to each other. It also introduces some form of ambiguity, because there are then multiple ways to express the action of the channel.



                          For instance, the canonical way of expressing the dephasing channel is with Kraus operators $A_1 = sqrt1-pI$ and $A_2 = sqrtpZ$ (which are, in fact, orthogonal). By limiting your answer to orthogonal Kraus operators, you omit this ambiguity.






                          share|improve this answer









                          $endgroup$



                          To answer your two questions separately:



                          1) The property (A) is not a necessary condition for a set to be a Kraus decomposition. Your derivation is right - Kraus operators obtained from the eigenvectors of the Choi matrix (or the process matrix, for that matter), are almost always orthogonal to each other. Almost, because if the Choi matrix is degenerate, you can find a non-orthogonal eigenbasis $c_lambda_i$ for an eigenspace $lambda_i$ with $a.m. > 1$. This results in non-orthogonal Kraus operators as well.



                          2) There is yet another option: Kraus operators may be linear combinations of each other (e.g. the operators in the other answer you linked). That also means that they never can all be orthogonal to each other. It also introduces some form of ambiguity, because there are then multiple ways to express the action of the channel.



                          For instance, the canonical way of expressing the dephasing channel is with Kraus operators $A_1 = sqrt1-pI$ and $A_2 = sqrtpZ$ (which are, in fact, orthogonal). By limiting your answer to orthogonal Kraus operators, you omit this ambiguity.







                          share|improve this answer












                          share|improve this answer



                          share|improve this answer










                          answered Aug 8 at 12:38









                          Jarn de JongJarn de Jong

                          1191 bronze badge




                          1191 bronze badge






























                              draft saved

                              draft discarded
















































                              Thanks for contributing an answer to Quantum Computing Stack Exchange!


                              • Please be sure to answer the question. Provide details and share your research!

                              But avoid


                              • Asking for help, clarification, or responding to other answers.

                              • Making statements based on opinion; back them up with references or personal experience.

                              Use MathJax to format equations. MathJax reference.


                              To learn more, see our tips on writing great answers.




                              draft saved


                              draft discarded














                              StackExchange.ready(
                              function ()
                              StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fquantumcomputing.stackexchange.com%2fquestions%2f6968%2fdo-the-kraus-operators-of-a-cptp-channel-need-to-be-orthogonal%23new-answer', 'question_page');

                              );

                              Post as a guest















                              Required, but never shown





















































                              Required, but never shown














                              Required, but never shown












                              Required, but never shown







                              Required, but never shown

































                              Required, but never shown














                              Required, but never shown












                              Required, but never shown







                              Required, but never shown







                              Popular posts from this blog

                              Category:9 (number) SubcategoriesMedia in category "9 (number)"Navigation menuUpload mediaGND ID: 4485639-8Library of Congress authority ID: sh85091979ReasonatorScholiaStatistics

                              Circuit construction for execution of conditional statements using least significant bitHow are two different registers being used as “control”?How exactly is the stated composite state of the two registers being produced using the $R_zz$ controlled rotations?Efficiently performing controlled rotations in HHLWould this quantum algorithm implementation work?How to prepare a superposed states of odd integers from $1$ to $sqrtN$?Why is this implementation of the order finding algorithm not working?Circuit construction for Hamiltonian simulationHow can I invert the least significant bit of a certain term of a superposed state?Implementing an oracleImplementing a controlled sum operation

                              Magento 2 “No Payment Methods” in Admin New OrderHow to integrate Paypal Express Checkout with the Magento APIMagento 1.5 - Sales > Order > edit order and shipping methods disappearAuto Invoice Check/Money Order Payment methodAdd more simple payment methods?Shipping methods not showingWhat should I do to change payment methods if changing the configuration has no effects?1.9 - No Payment Methods showing upMy Payment Methods not Showing for downloadable/virtual product when checkout?Magento2 API to access internal payment methodHow to call an existing payment methods in the registration form?