Section III.C: Schmidt phase randomization and the attained classical correlation
OpenQAlgorithms.Papers.Independent.Intakenext100.P47.schmidtPhase_disentanglingLet be finite nonzero complex spaces and let . Let and be orthonormal families indexed by , and let , . Put and define , extending by the identity on the unused orthogonal complement. The -term uniform Alice-only ensemble has output
This is a separable density matrix and its attained classical mutual information is
The construction supplies an explicit finite disentangling map, including unequal ambient dimensions and . It makes no optimality assertion over general local operations.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P47
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakenext100.P47
open QAlgorithms Filter
open QAlgorithms.Papers.Independent.Gap48.P20 (Copies localProduct)
open QAlgorithms.Papers.Independent.Dependency50.P19 (mutualInformation first)
open QAlgorithms.Papers.Independent.Dependency50.P45 (entropyExchange)
open QAlgorithms.Papers.Independent.Information100.P27 (shannon Config)
open QAlgorithms.Papers.Independent.Information100.P71 (channelPower)
open QAlgorithms.Papers.Independent.Advance50.P05 (RectangularInstrument)
open scoped Matrix ComplexConjugate
attribute [local instance] Classical.propDecidable Classical.decEq
/-- PDF p.8, III.C: D equiprobable phase unitaries, separability, and the attained classical bit entropy.
The index range 0,...,D-1 is the same root-of-unity ensemble as the printed 1,...,D. -/
theorem schmidtPhase_disentangling {A B : Type} [Fintype A] [Fintype B]
[Nonempty A] [Nonempty B] (D : ℕ) (hD : 0 < D) (f : Fin D → ℝ)
(hf : ∀ j, 0 < f j) (hsum : ∑ j, f j = 1)
(a : Matrix A (Fin D) ℂ) (b : Matrix B (Fin D) ℂ)
(ha : aᴴ * a = 1) (hb : bᴴ * b = 1) :
∃ R : COLUR A B, ∃ e : Fin R.count ≃ Fin D,
R.count = D ∧ (∀ i, R.weight i = (D : ℝ)⁻¹) ∧ R.allowed .alice ∧
(∀ i, (R.alice i : Matrix A A ℂ) = schmidtPhase a (e i)) ∧
R.operation (pureDensity (schmidtKet f a b)) = schmidtDiagonal f a b ∧
Entanglement.IsSeparableDensity (schmidtDiagonal f a b) ∧
mutualInformation (schmidtDiagonal f a b) = shannon f ∧
shannon f = vnEntropy (traceRight (pureDensity (schmidtKet f a b))) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P47
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be finite nonempty types, let be a natural number, let for every , with , and let and satisfy . Write , , and define
Then there exist a finite random local-unitary family and a bijection such that , every weight is , every Bob unitary is the identity, and Alice’s unitary at index has entries
Here a random local-unitary family consists of a positive natural count, nonnegative weights summing to one, and one unitary on each side at every index; its operation is . The asserted family satisfies ; moreover, is a finite convex combination of tensor products of positive semidefinite trace-one matrices, and
Here , and , using continuous functional calculus and the convention . The case is included; neither the family nor the bijection is asserted to be unique.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.