Broadcast Choi teleportation simulation
ProvedQAlgorithms.Papers.Independent.Support50.P49.broadcast_choi_teleportationThere is one sender and any positive finite number of receivers.
Let there be finitely many senders and receivers, with positive finite transmitted input dimensions and output dimensions ; dimension one is allowed. Let be a completely positive trace-preserving channel on the joint input, allowing entanglement between senders. For every tuple of input Weyl labels, assume there are separate output unitaries , fixed independently of the unknown input, satisfying
for every normalized input . Construct by sending one half of an independent normalized maximally entangled pair from every sender through , leaving its other half with that sender. There is a fixed table of the local corrections such that the explicit teleportation protocol has complete local Bell instruments, is trace preserving after averaging their outcomes, and satisfies
Here each sender measures its own input and resource half, broadcasts the outcome, and each receiver applies its own inverse correction; tensor factors in the displayed equation are regrouped accordingly. The equality holds for every reference system and input operator , hence in particular every normal density operator entangled with an arbitrary reference. No product-input or finite reference dimension restriction is imposed.
This realizes the physical channel by LOCC using its normalized Choi resource, the simulation needed for teleportation stretching.
Formalization Note The finite transmitted factors permit a blockwise formula for arbitrary reference matrix kernels. Equality on all kernels is the linear-map formulation of reference-preserving channel equality, not an assignment of probabilities to unnormalized states. The local Bell bras and product inverse corrections are body-defined; their completeness is concluded, never assumed.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P49
noncomputable section
namespace QAlgorithms.Papers.Independent.Support50.P49
open scoped Matrix ComplexConjugate
open QAlgorithms.Papers.Independent.Information100.P75 (Register)
open QAlgorithms.Papers.Independent.Information100.P56 (normalizedChoi)
open QAlgorithms.Papers.Independent.Claimed50.P43 (finiteWeyl)
attribute [local instance] Classical.propDecidable Classical.decEq
/-- PDF p.6, Eq.(28), Eq.(27), Fig.3: arbitrary positive M receivers.
The channel is simulated by the explicit sender-local Bell instruments and
receiver-local inverse corrections. The equality on every reference kernel
states equality of the linear maps, hence also includes all normalized inputs
entangled with arbitrary references. The resource is the computed Choi state;
no shared resource is granted to the original channel protocol. -/
theorem broadcast_choi_teleportation
{m k : ℕ} (hm : m = 1) (hk : 0 < k)
(d : Fin m → ℕ) (e : Fin k → ℕ)
(hd : ∀ i, 0 < d i) (he : ∀ j, 0 < e j)
(E : Superop (Register d) (Register e)) (hE : IsChannel E)
(hcov : ProductTeleportationCovariant hd E) :
∃ V : BellOutcome d → (j : Fin k) → Matrix.unitaryGroup (Fin (e j)) ℂ,
CorrectionCovariance hd E V ∧
IsDensityMatrix (normalizedChoi E) ∧
(∀ i : Fin m, IsKrausFamily (fun o : Fin (d i) × Fin (d i) => bellBra (d i) (hd i) o)) ∧
IsKrausFamily (simulationKraus hd V) ∧
∀ (R : Type) (X : Matrix (R × Register d) (R × Register d) ℂ),
idTensorSuperop (R := R) (teleportationLOCC hd V) (attachResource X (normalizedChoi E)) =
idTensorSuperop (R := R) E X := by sorry
end QAlgorithms.Papers.Independent.Support50.P49
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be natural numbers with and , let every input dimension and output dimension be positive, and put , , and . Suppose is a channel, meaning that there is a finite family of matrices with and for every matrix . Suppose also that there exists a family of output unitaries for which conjugating a density input by each product input correction is carried by to conjugation by the corresponding product output correction. Then there exists a family of unitaries , for every outcome and every , such that all of the following hold: writing and , one has for every density matrix ; the matrix
is positive semidefinite with trace ; each local family satisfies ; and the matrices
satisfy . Here equals if , and otherwise. Finally, for every type , without a finiteness or nonemptiness assumption, and every complex matrix on , define and . Then
Thus the final equality applies to arbitrary matrices , including matrices that are not density matrices. Dimensions equal to are included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.