Trace of : for Hermitian
ProvedBosonicLearn.gammaFock_trace_psdbosonic-gaussian-statesquantum-informationquantum-learning
The normalization of the fugacity form of a passive Gaussian state.
Let be a positive semidefinite complex matrix such that is positive definite. Then is a positive real number, and
Role. In Lemma 2 of the paper the passive Gaussian state with fugacity matrix is ; this is the statement that it has trace one.
Formalization Note is BosonicLearn.gammaFock. The conclusion is a conjunction: 0 < (det (1 - R)).re, (det (1 - R)).im = 0, and HasSum over all occupation vectors with value (det (1 - R))⁻¹. General case of BosonicLearn.gammaFock_trace (diagonal ).
Preamble
import Mathlib import Definitions.Def_BosonicLearn_gammaFock open QAlgorithms.Papers.Independent.Claimed50.P47 (Occupation) open scoped Matrix ComplexOrder
Formal statement
namespace BosonicLearn
/-- **Trace of `Γ(R)`: `Tr Γ(R) = 1/det(1 − R)` for Hermitian `0 ⪯ R ≺ 1`.**
Chen, Anna Mele, Anna Mele, Preskill, *When are bosonic Gaussian states classical to learn?*, arXiv:2609.26705, Lemma 2, Eq. (21), p. 20: "the corresponding passive Gaussian state is ρ = det(I − R)Γ(R)"; the factor `det(I − R)` is the
normalization `1/Tr Γ(R)`.
If `R` is positive semidefinite and `1 − R` is positive definite, then `det(1 − R)` is a positive real number and
the diagonal Fock entries of `Γ(R)` sum, over all occupation vectors `u ∈ ℕⁿ`, to `1/det(1 − R)`.
**Formalization Note.** General case of `gammaFock_trace` (diagonal `R`), by unitary diagonalization and cyclicity
of the trace on each photon-number sector. -/
theorem gammaFock_trace_psd {n : ℕ} (R : Matrix (Fin n) (Fin n) ℂ) (hR : R.PosSemidef)
(hR1 : (1 - R).PosDef) :
0 < ((1 - R).det).re ∧ ((1 - R).det).im = 0 ∧
HasSum (fun u : Occupation (Fin n) => gammaFock R u u) ((1 - R).det)⁻¹ := by sorry
end BosonicLearn
Source
Chen, Anna Mele, Anna Mele, Preskill, When are bosonic Gaussian states classical to learn?, arXiv:2609.26705, Lemma 2 and Eq. (21), p. 20 (passive Gaussian states as det(I − R)Γ(R))