Complex representation of the gauge purification
ProvedQAlgorithms.Papers.Independent.Support50.P29.gaugePurificationCorrespondenceLet , , and let be a Hermitian positive semidefinite occupation matrix. Put
Construct with the reflected-reference purification formula and let , where . Under , together with the explicit permutation from to , one has
The square root is the nonnegative spectral square root. This algebraic representation includes zero occupation; no ordinary-density P integral at singular is asserted. It makes the purification available for the subsequent one-mode channel calculation.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P29
noncomputable section
open Filter
open scoped BigOperators ENNReal Topology ComplexOrder
attribute [local instance] Classical.propDecidable Classical.decEq
namespace QAlgorithms.Papers.Independent.Support50.P29
open QAlgorithms.RealRegisters (Hilbert)
open QAlgorithms.Papers.Independent.Dependency50.P10 (Phase sigma complexify)
open QAlgorithms.Papers.Independent.Dependency50.P33
(State IsDensity rankOne productCoeff tensorApply IsTraceClassChannel)
open QAlgorithms.Papers.Independent.Frontier18.P18 (operatorCoeff)
open QAlgorithms.Papers.Independent.Frontier18.P07 (extendedEntropyNats)
open QAlgorithms.Papers.Independent.Frontier30.P10 (WeylSystem)
open QAlgorithms.Papers.Independent.Frontier30.P14 (partialRight PureDensity)
open QAlgorithms.Papers.Independent.Claimed50.P35
(tracePair thermalInput thermalPurificationDensity vacuumChannel exchangeMatrix RealizedDensity)
open QAlgorithms.Papers.Independent.Dependency50.P39 (displacementMatrix)
open QAlgorithms.Papers.Independent.Information100.P49 (thermalEntropy)
/-- Holevo quant-ph/9809022v1, PDF pp.7-8, (3.8): exact complex
representation after the explicit middle-block shuffle. Positive semidefinite
occupation is enough: no ordinary Lebesgue P-density integral is asserted
at singular N, and the vacuum boundary is retained. -/
theorem gaugePurificationCorrespondence (s : ℕ) (hs : 0 < s)
(hbar : ℝ) (hhbar : 0 < hbar) (N : Matrix (Fin s) (Fin s) ℂ)
(hN : N.PosSemidef) :
(reflectedDelta s hbar)⁻¹ * purificationCovariance hbar (gaugeCovariance hbar N) =
(realify (gaugePurificationMatrix N)).submatrix shuffle shuffle := by sorry
end QAlgorithms.Papers.Independent.Support50.P29
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every positive natural number , every real , and every positive semidefinite complex matrix , the following matrix identity holds. Write
For any finite complex matrix and function , let be , using a chosen invertible diagonalization if one exists, and let it be zero otherwise. For a finite real matrix , let
where is first viewed as complex and the real part is taken entrywise; the real square root equals zero for negative inputs. Define
and
Let be the permutation of four blocks of indices which exchanges the second and third blocks and fixes the first and fourth; explicitly, on the nested disjoint-union indices it sends to , to , to , and to . Then
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.