Schmidt projection does not require the common bias
ProvedQAlgorithms.Papers.Independent.Support50.P42.unknown_biasFor every batch size and a fixed known local Schmidt basis, there is one complete measurement chosen before the common bias . Here is the projector onto strings of weight . For all biases,
whenever that outcome has positive probability. Thus the successful conditional state and the measurement are independent of the unknown common bias. This expresses the source's operational contrast with its bias-dependent Procrustean construction, without asserting an impossibility theorem for every other filter.
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: one complete local measurement before every unknown common bias,
in a fixed known Schmidt basis. No blanket filter impossibility is asserted. -/
theorem unknown_bias (n : ℕ) :
∃ A : Fin (n+1) → Op (Fin n → Bool), IsKrausFamily A ∧
A=(fun k => schmidtTypeProjector n k.val) ∧ ∀ p : ℝ, 0≤p → p≤1 → ∀ k : Fin (n+1),
‖act (Matrix.kronecker (A k) (1 : Op (Fin n → Bool))) (schmidtBlock n p)‖^2=
schmidtOutcomeWeight n p k.val ∧
(0<schmidtOutcomeWeight n p k.val →
((Real.sqrt (schmidtOutcomeWeight n p k.val))⁻¹ : ℂ) •
act (Matrix.kronecker (A k) (1 : Op (Fin n → Bool))) (schmidtBlock n p)=typeState n k.val) := 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 natural number , there exists a family of matrices on the Boolean strings of length , indexed by , such that and , where is diagonal with entry on strings containing exactly true entries and elsewhere. This single family satisfies the following for every real and every such : define for and
Then , and if ,
The family is chosen before is quantified. The endpoints and are included, with empty products and equal to ; the normalized identity is asserted only for strictly positive outcome weight.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.