Manuscript Oai280-B@1 · Oai280-B.tex · theorem · 6d92ab75

Theorem: Accessible patch recovery

A normalized two-pentagon network › Constructive subsystem recovery · lines 2071–2117 · proof included or linked

Oai280-B@1#thm:patchrecovery

Back to manuscript

The following sufficient recovery statements hold on all matrices on :

  1. If , a decoder on satisfies

  2. If , a decoder on satisfies

  3. If , or , a decoder on recovers the entire two-qubit input:

All decoders are finite compositions of the locally constructed isometries and decoders. They preserve arbitrary reference correlations, including correlations with the spectator input.

Proof. Use the right-to-left orientation in Proposition prop:patchisometry. The left block is the two-input isometry on and the internal edge. Any three received left outputs recover these two input registers by Lemma lem:oriented. Discarding the recovered edge and all other outputs returns . As a channel on the original two-qubit input, this is exactly , proving item one. The opposite orientation proves item two.

If three left outputs and two right outputs are received, first invert the left block on the received triple. This returns and the internal edge coherently. The recovered edge and the two right outputs constitute three boundary legs of the original right five-qubit encoding. Apply the corresponding decoder from Theorem thm:idealaccess to recover . Return . The other cardinality pattern uses the opposite orientation.

All intermediate identities are channel identities on their full input spaces, and hence remain valid on arbitrary entangled inputs and after independent reference amplification.

Displayed formulas in this passage

  • unlabeled · line 2077

  • unlabeled · line 2081

  • unlabeled · line 2086

Nearby in this section