§5, Eq. (41): symmetric Gaussian minimizer and two-variable GREE
OpenQAlgorithms.Papers.Independent.Intakenext100.P46.symmetric_greeLet be an entangled centered symmetric two-mode Gaussian density with covariance blocks and in the sign chart . Its entropy is finite, even when it has pure modes. For normal eigenvalues , put , and . Construct the border covariance , then apply by covariance congruence, where and . Let be the infimum of actual operator divergences to those densities as varies. There exist , and an actual symmetric Gaussian border density attaining
For the strict chart put and . Then
Here is the infimum of the actual Umegaki divergence over all separable Gaussian densities on the same cut, with trace-norm closed convex-hull separability. This gives the two-variable minimization. At singular parameters is defined through the constructed density and independent Umegaki divergence; no unsupported real logarithmic endpoint or finite optimizer is assumed. The common squeeze preserves exchange symmetry and must be retained when .
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P46
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakenext100.P46
open scoped BigOperators ENNReal ComplexOrder Matrix
attribute [local instance] Classical.propDecidable Classical.decEq
open QAlgorithms.RealRegisters (Hilbert)
open QAlgorithms.Papers.Independent.Dependency50.P33 (State IsSeparable)
open QAlgorithms.Papers.Independent.Dependency50.P13
(finiteRelativeEntropy compression entropyWeight)
open QAlgorithms.Papers.Independent.Claimed50.P47
(Occupation bipartiteCharacteristic bipartiteWeyl gaussianStateCharacteristic)
-- These accepted definitions have the same completed Hilbert-space meaning.
open QAlgorithms.Papers.Independent.Next46.P13 (coordinateBasis)
open QAlgorithms.Papers.Independent.Frontier18.P18 (operatorCoeff boundedOperator)
open QAlgorithms.Papers.Independent.Claimed50.P41 (IsDiagonal)
/-- Chen, PDF pp.9,11–12, (41): a symmetric Gaussian border attains GREE;
the resulting optimization has two normal-mode parameters. Endpoints are
operator-defined in symmetricValue, and its literal finite chart is (41).
Pure rho modes are allowed; no faithful-optimizer assumption is inserted. The
common local squeezing is retained when kq and kp differ. Printed on p.9:
symmetric states are called type (iii). Changed: use exchange symmetry, the
a=b/type-(iv) chart. Why: p.8 defines symmetry as type (iv), and the displayed
Eq. (12) and Eq. (41) use that covariance. -/
theorem symmetric_gree (rho : State (Occupation (Fin 1) × Occupation (Fin 1)))
(m kq kp : ℝ) (hrho : HasGaussian rho 0 (symmetricCM m kq kp))
(hkq : 0 ≤ kq) (hkp : 0 ≤ kp)
(hentangled : ¬ IsSeparable rho.coefficients) :
densityEntropy rho < ⊤ ∧
(∃ (gA gB y : ℝ) (sigma : State (Occupation (Fin 1) × Occupation (Fin 1))),
1 / 2 ≤ gA ∧ 1 / 2 ≤ gB ∧ 0 < y ∧
HasGaussian sigma 0 (symmetricCandidateCM gA gB y) ∧ GaussianBorder sigma ∧
operatorRelativeEntropy rho sigma = gree rho ∧ symmetricValue rho gA gB = gree rho ∧
∀ a b : ℝ, 1 / 2 ≤ a → 1 / 2 ≤ b →
symmetricValue rho gA gB ≤ symmetricValue rho a b) ∧
(∀ gA gB : ℝ, 1 / 2 < gA → 1 / 2 < gB →
symmetricValue rho gA gB = ENNReal.ofReal (-(densityEntropy rho).toReal +
symmetricObjective m kq kp (modeEM gA) (modeEM gB))) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P46
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be a state on the label set , and let . Here, for any label set , a state is a complex matrix admitting sequences such that and , whose quadratic form on every finitely supported vector is real and nonnegative, and whose real diagonal is summable with sum . For any matrix , write
where the infimum ranges over those expansions of ; this takes values in , with an empty infimum equal to , and . A bipartite matrix is called separable here if, for every , it is within in this quantity of a finite convex combination of matrices , where and are states on . To specify the Gaussian hypothesis, order the four real coordinates as , put
and define the displacement coefficients, for , by
For , set , , and
Write for the following conditions: , is positive semidefinite, and, for every , each inner series below and the outer series are summable, with
Assume , , , and that is not separable. Define to be a chosen bounded operator on with matrix when one exists, and zero otherwise. With the coordinate vectors and functional calculus denoted by , define
For finite complex matrices , define
and define
where has the same physicality and summability conditions as , and characteristic function . The supremum defining includes . For real , put
Then , and there exist real and a state such that , , , is separable, and admits a centered Gaussian covariance such that, for every , there are a nonseparable state and covariance with and for every entry. These witnesses satisfy
Furthermore, for every , setting and gives
Here is the real conversion of , finite by the conclusion. The existence and minimization statements include or ; the displayed objective formula is asserted only when both inequalities are strict.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.