Example 5: formation and cost for all mixtures of the two Pauli-dilation vectors
OpenQAlgorithms.Papers.Independent.Intakenext100.P60.pauli_mixturesLet sum to one, with
In output:environment order on , put
Write for , , and , where and . Entanglement is measured across the two displayed parties.
For every ,
Moreover, for each positive integer , form the tensor-word projectors from and . Every convex mixture of these projectors has formation , across all output qubits versus all environments. This assertion does not include arbitrary entangled superpositions of the words.
Here is the infimum of average pure-state marginal entropy over normalized finite decompositions of the stated density matrix. is the asymptotic EPR preparation rate under deterministic two-way LOCC, and is the corresponding asymptotic distillation rate, in bits per copy. All entropies and logarithms are in bits.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P60
namespace QAlgorithms.Papers.Independent.Intakenext100.P60
open scoped Matrix ComplexConjugate ComplexOrder TensorProduct
noncomputable section
attribute [local instance] Classical.propDecidable Classical.decEq
-- Exact accepted matrix, normalized ensemble, convex roof, grouped copies and LOCC.
open QAlgorithms.Papers.Independent.Information100.P21 (Op FiniteLOCC)
open QAlgorithms.Papers.Independent.Information100.P08 (PureEnsemble pureAverage formation)
open QAlgorithms.Papers.Independent.Information100.P80 (groupedPower)
open QAlgorithms.Papers.Independent.Gap48.P32 (twoWayDistillable)
/-- PDF pp.8--9, Example 5 and (14): cost and formation for every mixture,
plus optimality of every convex mixture of the named positive-length tensor words. -/
theorem pauli_mixtures (p : Fin 4 → ℝ) (hp : PauliAdmissible p) :
(∀ s ∈ Set.Icc (0 : ℝ) 1,
formationCostBits (pauliMixture p s) = binEntropy2 (p 0 + p 3) ∧
formation (pauliMixture p s) = binEntropy2 (p 0 + p 3)) ∧
(∀ n : ℕ, 0 < n → ∀ mu : (Fin n → Fin 2) → ℝ,
(∀ w, 0 ≤ mu w) → (∑ w, mu w) = 1 →
formation (pauliWordMixture p n mu) = n * binEntropy2 (p 0 + p 3)) := by sorry
end
end QAlgorithms.Papers.Independent.Intakenext100.P60
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be real numbers satisfying , , and both inequalities and . Put , where . Define , with , , , and ; let be column of , and set . For a bipartite matrix , define as the real infimum of over every finite family of unit vectors and real weights , , satisfying , where uses continuous functional calculus. Define , after the specified fixed bijections reindex both local bases by finite integer sets, as the real infimum of all real such that, for every , there exist natural numbers with and a finite local-operations-and-classical-communication map for which and . Here , ; tensor powers group the two parties and use the specified finite-index bijections; ; and finite local-operations-and-classical-communication maps are generated from identity maps by finite local Kraus instruments with , branch-dependent continuations of the same kind, and summation of the branch outputs. No separate condition is inserted in this infimum, and is allowed. The theorem asserts that for every , including both endpoints,
and that for every natural number and every with and , the vectors satisfy
Zero coordinates of and zero weights of are permitted; the second assertion does not quantify over .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.