Both returned states are separable in the bad regime
OpenQAlgorithms.Papers.Independent.Intakenext100.P96.bad_regime_separabilityWork in the retained vacuum/single-photon model, on a signal space with vacuum and orthogonal single-photon modes. Let be the background probability per mode, with , and let be the reflection probability. Set
Use the resource , transmitting only the signal and retaining the ancillary photon perfectly. Write , , and . In the bad regime (equivalently , since this condition forces ), both returned states are normalized and separable across signal and ancilla:
where is finite, , , and every and 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 . It makes no arbitrary-input entanglement-breaking claim.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P96
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
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let consist of a natural number and real numbers satisfying , , and , and suppose that . On the space with basis , put , and on its tensor product with define
The declaration asserts that each of and is positive semidefinite with trace exactly , and that each separately admits a representation
for some natural number , some nonnegative real weights , and matrices on the space indexed by and on , each positive semidefinite with trace exactly . The decomposition condition does not separately impose a sum-to-one equation on the weights. The assumptions allow , , and , whenever the strict inequality also holds.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.