Manuscript En02-B@1 · En02-B-v1.tex · lemma · ca28dee4

Lemma: Recursive recovery normal form

A finite perfect-code tree and decoder schedules › Encoding and accessible leaves · lines 1301–1335 · proof included or linked

En02-B@1#lem:treenormal, En02-B@1#eq:treenormal

Back to manuscript

There is an ancilla-free unitary on such that

Every exact recovery channel on is therefore the same channel

whose Choi rank is .

Proof. At , use (eq:normalform). For the induction, apply the three child unitaries without yet measuring their syndrome factors. Each child outputs its intermediate logical qubit tensored with a maximally mixed syndrome independent of that qubit and every reference. The three intermediate qubits have the root accessible channel . Apply to them. The root contributes two further maximally mixed syndrome qubits. All syndrome factors are independent, giving (eq:treenormal).

The faithful-syndrome lemma proves uniqueness. Partial trace over qubits has exactly independent Kraus maps, and unitary precomposition does not change this rank.

Displayed formulas in this passage

  • En02-B@1#eq:treenormal · line 1304

  • unlabeled · line 1312

Nearby in this section