Schmidt coding erases complementary inputs and cannot be faithful
ProvedQAlgorithms.Papers.Independent.Support50.P42.schmidt_codingFor , source emits with uniform bit . Let be its length- product signal, with as in the section, for uniform binary label , and let be its complement. The Schmidt encoder measures the weight and retains both the quantum branch and the classical outcome. Then
for every decoder channel independent of , where is source-average squared fidelity. Bare transmission which forgets without decoding has average fidelity tending to zero. The displayed bound prevents arbitrary decoders, even using , from attaining asymptotically perfect fidelity.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P42
noncomputable section
namespace QAlgorithms.Papers.Independent.Support50.P42
open scoped BigOperators Matrix ComplexConjugate
open MeasureTheory ProbabilityTheory
attribute [local instance] Classical.propDecidable Classical.decEq
-- Reuse the exact accepted objects, without introducing same-name aliases.
open Information100.P21 (Op Vec FiniteLOCC)
open Dependency50.P42 (dimensionedPower singlets)
open Dependency50.P48 (pureFidelity)
open Gap48.P32 (pairOfState)
open Next46.P39 (rectAct)
/-- PDF pp.13--14: complement erasure even with the classical outcome,
bare-fidelity limit zero, and a uniform bound for every decoder channel.
The decoder receives the entire classical-quantum output, never the unknown x. -/
theorem schmidt_coding (p : ℝ) (hp : 0<p) (hp1 : p<1) :
(∀ (n : ℕ), 2<n → ∀ x : Fin n → Bool,
flaggedEncoder n (pureDensity (sourceKet p x))=
flaggedEncoder n (pureDensity (sourceKet p (fun i => !(x i))))) ∧
(∀ (n : ℕ) (D : Superop (Fin (n+1) × (Fin n → Bool)) (Fin n → Bool)),
2<n → IsChannel D → codingFidelity n p D≤(1+|1-2*p|^n)/2) ∧
Filter.Tendsto (fun n : ℕ => ((2 : ℝ)^(n+3))⁻¹*∑ x : Fin (n+3) → Bool,
pureFidelity (sourceKet p x) (bareEncoder (n+3) (pureDensity (sourceKet p x))))
Filter.atTop (nhds (0 : ℝ)) := by sorry
end QAlgorithms.Papers.Independent.Support50.P42
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every real with , define, for each natural number and each Boolean string , a vector by
Write , let be the diagonal projector onto strings containing exactly true bits, and define
Then three assertions hold: for every and every , , where ; for every natural and every channel from matrices on to matrices on ,
and
Here a channel means a map with a finite Kraus family satisfying ; the decoder bound quantifies over every such .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.