Manuscript Oai283-A@1 · Oai283-A.tex · theorem · 6fb75895

Theorem: Serial teleportation with complete records

Serial teleportation and first-passage negative controls › A complete finite teleportation interface · lines 1417–1449 · proof included or linked

Oai283-A@1#thm:teleport

Back to manuscript

Suppose a path with hops supplies an independent Bell pair per hop and per payload qubit, local Bell measurement, classical outcome communication, and the corresponding Pauli correction.

For an -qubit payload, the deterministic complete channel after all corrections is

where is the retained -bit record. This identity holds with every untouched reference.

The resource ledger includes Bell pairs and transmitted classical bits. With fresh streamed Bell pairs, the active quantum interface can use qubits per hop; a preprovisioned external Bell-pair pool must additionally be counted.

Proof. For one qubit and one hop, each corrected Bell-measurement branch has Kraus map , up to an irrelevant branch phase. Its selective map is therefore . Summing the four branches returns , with a uniform independent classical record.

Tensoring over payload qubits and composing hops gives one selective map for each record. The operator identity proves the reference statement. The consumption and resource counts follow from one payload block and the two halves of one resource pair at each active hop.

Displayed formulas in this passage

  • unlabeled · line 1425

Nearby in this section