Theorem 2: two-copy invariant purity classifier
ProvedQAlgorithms.Papers.Independent.Advance50.P50.theorem2An -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 . Fix , , and , with nonempty classes of purity and . Write for their union and . For every pair of fixed real numbers , there exists a two-copy model satisfying
It is -invariant on all density matrices. If , its exact output sets for the two purity classes are disjoint. The choice returns purity exactly. There is no gate-count or finite-shot claim.
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 pp.7–8, Theorem 2 and Eq.(15): all real affine combinations are
realizable, invariant, and separating when the swap coefficient is nonzero.
The coefficient choice (0,1) gives purity exactly. -/
theorem theorem2 {n : ℕ} (hn : 1 ≤ n) (b : ℝ)
(hb : 1 / (2 : ℝ) ^ n ≤ b ∧ b < 1)
(hpure : ∃ rho : Mat (Qubits n), IsDensityMatrix rho ∧ purity rho = 1)
(hmixed : ∃ rho : Mat (Qubits n), IsDensityMatrix rho ∧ purity rho = b) :
∀ a s : ℝ, ∃ M : ExpectationModel (Qubits n) 2,
M.effective = (a : ℂ) • 1 + (s : ℂ) • copySwap (Qubits n) ∧
DomainInvariant (Matrix.unitaryGroup (Qubits n) ℂ : Set (Mat (Qubits n)))
{rho | IsDensityMatrix rho} M.response ∧
(∀ rho, IsDensityMatrix rho → M.response rho = a + s * purity rho) ∧
(s ≠ 0 → SeparatesPurity b M.response) := by sorry
end QAlgorithms.Papers.Independent.Advance50.P50
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every integer and real with , assume there exist positive semidefinite trace-one matrices of purity and of purity , respectively, where purity means . For every pair of real numbers , there exist a unitary and a Hermitian observable on two copies of the -qubit space such that
where exchanges the two copies. Their response satisfies for every unitary and every positive semidefinite trace-one , and satisfies for every such . If , then for every pair of positive semidefinite trace-one matrices with purities and , respectively. The existence and response assertions also apply when ; only the final separation assertion is conditional on .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.