Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Both returned states are separable in the bad regime

Open
QAlgorithms.Papers.Independent.Intakenext100.P96.bad_regime_separability

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Work in the retained vacuum/single-photon model, on a signal space with vacuum ∣vac⟩|\mathrm{vac}\rangle∣vac⟩ and d≥1d\ge1d≥1 orthogonal single-photon modes. Let b≥0b\ge0b≥0 be the background probability per mode, with db≤1db\le1db≤1, and let 0≤η≤10\le\eta\le10≤η≤1 be the reflection probability. Set

ρ0=(1−db)∣vac⟩⟨vac∣+b∑k=1d∣k⟩⟨k∣.\rho_0=(1-db)|\mathrm{vac}\rangle\langle\mathrm{vac}|+b\sum_{k=1}^d|k\rangle\langle k|.ρ0​=(1−db)∣vac⟩⟨vac∣+bk=1∑d​∣k⟩⟨k∣.

Use the resource ∣Φd⟩=d−1/2∑k=1d∣k⟩S∣k⟩A|\Phi_d\rangle=d^{-1/2}\sum_{k=1}^d|k\rangle_S|k\rangle_A∣Φd​⟩=d−1/2∑k=1d​∣k⟩S​∣k⟩A​, transmitting only the signal and retaining the ancillary photon perfectly. Write PΦ=∣Φd⟩⟨Φd∣P_\Phi=|\Phi_d\rangle\langle\Phi_d|PΦ​=∣Φd​⟩⟨Φd​∣, σ0=ρ0⊗IA/d\sigma_0=\rho_0\otimes I_A/dσ0​=ρ0​⊗IA​/d, and σ1=(1−η)σ0+ηPΦ\sigma_1=(1-\eta)\sigma_0+\eta P_\Phiσ1​=(1−η)σ0​+ηPΦ​. In the bad regime ηd<b\eta d<bηd<b (equivalently ηd/b<1\eta d/b<1ηd/b<1, since this condition forces b>0b>0b>0), both returned states are normalized and separable across signal and ancilla:

σj=∑ℓ=1mjwjℓ ajℓ⊗cjℓ(j=0,1),\sigma_j=\sum_{\ell=1}^{m_j}w_{j\ell}\, a_{j\ell}\otimes c_{j\ell}\qquad (j=0,1),σj​=ℓ=1∑mj​​wjℓ​ajℓ​⊗cjℓ​(j=0,1),

where mjm_jmj​ is finite, wjℓ≥0w_{j\ell}\ge0wjℓ​≥0, ∑ℓwjℓ=1\sum_\ell w_{j\ell}=1∑ℓ​wjℓ​=1, and every ajℓa_{j\ell}ajℓ​ and cjℓc_{j\ell}cjℓ​ is a positive trace-one density operator on the appropriate subsystem.

This states actual separability of the specified returned pair, even though its ideal joint detector still has the background acceptance probability b/db/db/d. It makes no arbitrary-input entanglement-breaking claim.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P96
Formal statement
noncomputable section

open Filter

open scoped BigOperators Topology ComplexConjugate ComplexOrder Matrix.Norms.L2Operator

namespace QAlgorithms.Papers.Independent.Intakenext100.P96

attribute [local instance] Classical.propDecidable Classical.decEq

/-- PDF pp.8--9: in the bad regime eta*d/b<1, the returned pair is a separable
normalized density. The conclusion is finite convex-product separability,
not merely positivity of the partial transpose. -/
theorem bad_regime_separability (p : ModelParameters)
    (hbad : p.eta * (p.d : ℝ) < p.b) :
    (IsDensityMatrix (pairAbsent p.d p.b) ∧
      QAlgorithms.Entanglement.IsSeparablePositive (pairAbsent p.d p.b)) ∧
    (IsDensityMatrix (pairPresent p.d p.b p.eta) ∧
      QAlgorithms.Entanglement.IsSeparablePositive (pairPresent p.d p.b p.eta)) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P96

end
Source
Quantum Illumination, arXiv:0803.2022v2, PDF p. 8, Unnumbered: no signal–ancilla entanglement survives in the bad regime
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

Let ppp consist of a natural number d>0d>0d>0 and real numbers b,ηb,\etab,η satisfying b≥0b\ge0b≥0, db≤1db\le1db≤1, and 0≤η≤10\le\eta\le10≤η≤1, and suppose that ηd<b\eta d<bηd<b. On the space with basis e∗,e0,…,ed−1e_\ast,e_0,\ldots,e_{d-1}e∗​,e0​,…,ed−1​, put B=diag⁡(1−db,b,…,b)B=\operatorname{diag}(1-db,b,\ldots,b)B=diag(1−db,b,…,b), and on its tensor product with Cd\mathbb C^dCd define

Ω=1d∑i=0d−1ei⊗ei,ρ0=B⊗Idd,ρ1=(1−η)ρ0+η ΩΩ∗.\Omega=\frac1{\sqrt d}\sum_{i=0}^{d-1}e_i\otimes e_i,\qquad \rho_0=B\otimes\frac{I_d}{d},\qquad \rho_1=(1-\eta)\rho_0+\eta\,\Omega\Omega^\ast .Ω=d​1​i=0∑d−1​ei​⊗ei​,ρ0​=B⊗dId​​,ρ1​=(1−η)ρ0​+ηΩΩ∗.

The declaration asserts that each of ρ0\rho_0ρ0​ and ρ1\rho_1ρ1​ is positive semidefinite with trace exactly 111, and that each separately admits a representation

ρ=∑j=0q−1wj Aj⊗Dj\rho=\sum_{j=0}^{q-1}w_j\,A_j\otimes D_jρ=j=0∑q−1​wj​Aj​⊗Dj​

for some natural number qqq, some nonnegative real weights wjw_jwj​, and matrices AjA_jAj​ on the space indexed by ∗,0,…,d−1\ast,0,\ldots,d-1∗,0,…,d−1 and DjD_jDj​ on Cd\mathbb C^dCd, each positive semidefinite with trace exactly 111. The decomposition condition does not separately impose a sum-to-one equation on the weights. The assumptions allow η=0\eta=0η=0, db=1db=1db=1, and d=1d=1d=1, whenever the strict inequality ηd<b\eta d<bηd<b also holds.

Human review
  • Endorsed by Shuze Chen · Oct 31, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me