ref

codes/quantum/properties/approximate_qecc.yml

@@ -142,7 +142,7 @@ features:
     This is the recovery used in the proof of the Knill-Laflamme conditions \cite[Thm. 10.1]{doi:10.1017/CBO9780511976667}.'
     - 'The \textit{Cafaro recovery map} \cite{arxiv:1308.4582} can be obtained for noise Kraus operators if there exists a basis of error words with respect to which the uncorrectable piece in the Knill-Laflamme conditions is diagonal; see Ref. \cite{arxiv:2406.02444}.
     The map recovers information perfectly for strictly correctable noise.'
-    - 'The \textit{Petz recovery map} a.k.a. the \textit{transpose map} \cite{doi:10.1007/BF01212345,doi:10.1093/qmath/39.1.97}, a quantum channel determined by the codespace and noise channel, yields an infidelity of recovery that is at most twice away from the infidelity of the best possible recovery \cite{arxiv:quant-ph/0004088}.
+    - 'The \textit{Petz recovery map} a.k.a. the \textit{transpose map} \cite{doi:10.1007/BF01212345,doi:10.1093/qmath/39.1.97,arxiv:1810.03150}, a quantum channel determined by the codespace and noise channel, yields an infidelity of recovery that is at most twice away from the infidelity of the best possible recovery \cite{arxiv:quant-ph/0004088}.
     The map recovers information perfectly for strictly correctable noise.
     The infidelity of a modified Petz recovery map under erasure can be bounded using the conditional mutual information \cite{arxiv:1410.0664,arxiv:1509.07127,arxiv:1610.06169}.
     More generally, the fidelity can be expressed as a function of the \term{Knill-Laflamme conditions} \cite[Thm. 1]{arxiv:2401.02022}.