Elementary random preparation of the fixed Werner state
ProvedQAlgorithms.Papers.Independent.Support50.P42.werner_preparationLet , a normalized two-qubit Werner density. For , choose independent fair bits . At position , use a singlet if and locally prepare otherwise. If is the resulting product state and , then
For every choice an actual local protocol prepares from exactly supplied singlets. An initial supply of is sufficient; is expected consumption, rather than a deterministic budget. This is the elementary preparation in Eq. (11), separate from the improved external results cited later.
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.17, Eq.(11): independent fair local preparation of W tensor n.
Each branch is an actual LOCC protocol consuming its number of singlet choices;
that number is bounded by n and has expectation n/2, never a fixed n/2 budget. -/
theorem werner_preparation (n : ℕ) :
IsDensityMatrix wernerState ∧
(((2 : ℝ)^n)⁻¹ : ℂ) • (∑ z : Fin n → Bool, wernerBranch n z)=dimensionedPower wernerState n ∧
((2 : ℝ)^n)⁻¹*(∑ z : Fin n → Bool, (downCount z : ℝ))=(n : ℝ)/2 ∧
(∀ z : Fin n → Bool, downCount z≤n ∧
∃ L : Superop (Fin (2^(downCount z)) × Fin (2^(downCount z))) (Fin (2^n) × Fin (2^n)),
FiniteLOCC L ∧ L (singlets (downCount z))=wernerBranch n z) := 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 , including zero, let , , and . For a Boolean string , let be its number of true bits and let be the grouped tensor product whose -th bipartite factor is when is true and otherwise, reindexed on each party using the fixed equivalence between binary strings and . Then is positive semidefinite of trace one,
and, for every such , and there exists a finite recursive LOCC map from matrices on to matrices on satisfying . Here is the similarly reindexed tensor power, and is the reindexed -fold singlet tensor power. Finite recursive LOCC maps are generated by identities and complete finite local Kraus measurements on either party, followed by outcome-dependent recursive continuations and summation over outcomes. At , the unique string is empty, its count is zero, all tensor products are the scalar matrix , and the average count is zero.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.