Supplement III.B, Eqs.(146)–(149): exact illumination spectrum with source corrections
OpenQAlgorithms.Papers.Independent.Intakethird100.P49.illumination_exact_spectrumLet be the number of single-photon modes, , , , and . With one photon total plus vacuum, set , , and . These are CPTP. For their normalized Choi states , put and . Its spectrum, including multiplicity, consists of
where , , for , and for distinct positive . Thus . The factors omitted in the printed spectrum and lower-block diagonal are restored from exact Eq. (148), pending independent correction review. This retains an exact finite illumination calculation without relying on the subsequent expansion.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P49
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakethird100.P49
open QAlgorithms Filter
open scoped Matrix ComplexConjugate ComplexOrder BigOperators
attribute [local instance] Classical.propDecidable Classical.decEq
open QAlgorithms.Papers.Independent.Information100.P63 (Mat tensorPower)
open QAlgorithms.Papers.Independent.Dependency50.P18 (bipartiteTensor)
open QAlgorithms.Papers.Independent.Information100.P71 (diamond AdaptiveTest adaptiveInput adaptiveAccept)
open QAlgorithms.Papers.Independent.Bridge50.P25
(LOCCOn normalizedChannelChoi TwoWayGenerationCode TwoWayChannelProtocol
generationCodeError twoWayGenerationCapacity sendChannelRegister StateFunctional
IsDimensionChangingLOCCMonotone privateStateInPartyOrder)
open QAlgorithms.Papers.Independent.Support50.P07 (amplitudeDampingChannel)
/-- Supplement III.B, PDF p.17, (146)--(149): exact illumination spectrum.
Printed d^2-fold eigenvalue b^2/D^2 is changed to (1-eta)*b^2/D^2;
printed lower-block diagonal is changed as documented in illuminationBlock.
Both corrections are forced by exact (148); independent moderation is required.
Eigenvalues are a multiset, so coincidences and zero eigenvalues keep multiplicity. -/
theorem illumination_exact_spectrum (d : ℕ) (hd : 1 ≤ d) (b eta : ℝ)
(hb : 0 ≤ b) (hdb : (d : ℝ)*b ≤ 1) (heta : eta ∈ Set.Icc 0 1) :
IsChannel (illuminationChannel d b 0) ∧ IsChannel (illuminationChannel d b eta) ∧
(List.ofFn (ascEigenvalues (illuminationOmegaSquared d b eta))).Perm
(List.replicate (d*d) ((1-eta)*b^2/((d : ℝ)+1)^2) ++
List.replicate d ((1-eta)*(1-d*b)^2/((d : ℝ)+1)^2) ++
List.ofFn (ascEigenvalues (illuminationBlock d b eta))) ∧
rootFidelity (normalizedChannelChoi (illuminationChannel d b 0))
(normalizedChannelChoi (illuminationChannel d b eta)) =
∑ i, Real.sqrt (ascEigenvalues (illuminationOmegaSquared d b eta) i) := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P49
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every natural number and real numbers satisfying , , and , put , let on , and define the matrix map
For any such map , write , where ; here amplification by the identity means applying to each block indexed by the first register. Set , , and , with matrix square roots defined by continuous functional calculus. Define the matrix , indexed by , by
Then both and admit finite Kraus representations with ; the list of ascending eigenvalues of , including multiplicities, is a permutation of the concatenation of copies of , copies of , and the ascending eigenvalue list of ; and
The ascending-eigenvalue function used here returns the Hermitian eigenvalues in ascending order, and returns the all-zero list for a non-Hermitian matrix. The hypotheses include , , , and both endpoints , so zero eigenvalues and repeated eigenvalues are included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.