Procrustean filtering in finite Schmidt rank
ProvedQAlgorithms.Papers.Independent.Support50.P42.procrustean_filterLet and let satisfy . Put . For the Schmidt state , Alice's successful filter is , using the totalized value zero at a zero amplitude; its complementary failure filter is . They form a complete instrument, and
The positive-probability normalized branch is maximally entangled. For a qubit bias , success is , zero at product endpoints and one at maximal entanglement. This constructs concentration without an optimality claim. The source's printed absorbed fraction is corrected to the retained fraction, as required by equal successful amplitudes.
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 p.9: finite-rank Procrustean filter, including zero Schmidt amplitudes.
Printed absorption tan squared theta is corrected to RETENTION of that
fraction, as uniquely fixed by equalization of successful amplitudes. -/
theorem procrustean_filter (d : ℕ) (hd : 0<d) (c : Fin d → ℝ)
(hc : ∀ i, 0≤c i) (hnorm : ∑ i, (c i)^2=1) :
IsKrausFamily (fun j : Fin 2 => if j=0 then procrusteanSuccess c else filterFailure c) ∧
pureDensity (aliceKetBranch (procrusteanSuccess c) (diagonalKet c))=
((((d : ℝ)*(leastAmplitude c)^2 : ℝ)) : ℂ) • pureDensity (uniformKet d) ∧
‖aliceKetBranch (procrusteanSuccess c) (diagonalKet c)‖^2=(d : ℝ)*(leastAmplitude c)^2 ∧
(0<leastAmplitude c →
((Real.sqrt ((d : ℝ)*(leastAmplitude c)^2))⁻¹ : ℂ) •
aliceKetBranch (procrusteanSuccess c) (diagonalKet c)=uniformKet d) ∧
(∀ p : ℝ, 0≤p → p≤1 →
(2 : ℝ)*(leastAmplitude (fun i : Fin 2 => if i=0 then Real.sqrt (1-p) else Real.sqrt p))^2=
procrusteanYield p) := 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 positive natural number and real vector with and , let , which here is the minimum of a nonempty finite set, and define
The theorem asserts
If , it further asserts . For every real , it also asserts
the right side being the defined two-dimensional yield. Rank-one matrices have entries . Zero coordinates of are permitted: division by zero is defined as , and then and the successful branch is zero; the normalized-branch assertion applies only when .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.