Eq.(37): concentratable entanglement response
ProvedQAlgorithms.Papers.Independent.Advance50.P50.concentratable_responseAn -qubit input is a positive semidefinite, trace-one matrix on the fixed computational basis, of dimension . A -copy model has a fixed input-independent unitary , a Hermitian observable , effective observable , and exact response . Let be a pure -qubit density matrix with , and let for . For two copies, swaps the copies at precisely the sites in and acts as identity elsewhere. For any , let the effective observable be identity minus times the tensor product of on each paired site in and identity on the remaining sites. Then
The empty subsystem reduction is the scalar trace one. Hence gives zero, with a nonzero denominator. This is the purity formula associated with the concentratable-entanglement observable, without an added identification axiom.
import Definitions.Def_QAlgorithms_Papers_Independent_Advance50_P50
noncomputable section
namespace QAlgorithms.Papers.Independent.Advance50.P50
open MeasureTheory ProbabilityTheory
open scoped ComplexConjugate ENNReal
-- Exact accepted primitives; no paper-local redeclarations.
open QAlgorithms.Papers.Independent.Information100.P63 (Mat tensorPower)
open QAlgorithms.Papers.Independent.Gap48.P20 (Copies)
open QAlgorithms.Papers.Independent.Gap48.P38 (subsystemReduction)
open QAlgorithms.Papers.Independent.Information100.P32 (purity)
open QAlgorithms.Papers.Independent.Information100.P08 (IsPure)
-- Matrices carry the associative commutator bracket X*Y-Y*X.
attribute [local instance 100] LieRing.ofAssociativeRing
/-- PDF p.14, Eq.(37): the tensor observable gives the subset-purity formula.
Q may be empty; then the response is zero. -/
theorem concentratable_response {n : ℕ} (Q : Finset (Fin n))
(M : ExpectationModel (Qubits n) 2) (hobs : M.effective = concentratableObservable Q)
(rho : Mat (Qubits n)) (hpure : IsPure rho) :
M.response rho = 1 - ((2 : ℝ) ^ Q.card)⁻¹ *
∑ A ∈ Q.powerset, purity (subsystemReduction (fun _ => Bool) rho A) := by sorry
end QAlgorithms.Papers.Independent.Advance50.P50
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be an integer and any subset of its qubit sites, including the empty subset. Let consist of a unitary and a Hermitian observable on two -qubit copies, and assume
where exchanges the two copies’ bits at site , and the empty product is the identity. For every pure matrix with ,
Here , where ranges over assignments on the complement of . The sum includes , whose reduction is the one-dimensional matrix with entry . In particular, , including the case , gives response .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.