§6.4.2 (6.97)–(6.100): product-state finite-size bound
OpenQAlgorithms.Papers.Independent.Intakenext100.P07.product_finite_size_boundAll quantum systems below are finite-dimensional complex Hilbert spaces of positive dimension, and logarithms are binary. A normalized state is positive semidefinite with trace one; a subnormalized state has trace at most one. Marginals are partial traces. Here is squared algebraic fidelity, is squared generalized fidelity, is purified distance, and . The symbols and denote conditional min- and max-entropy, with values and at zero. Smoothing optimizes over all subnormalized states in the purified-distance ball; every entropy radius satisfies . Write for .
For a finite set of normalized supported pairs (ρ_i,σ_i), choose a common C≥0 before all n and all sequences of pairs. For n≥1, (1/n)Dmax^ε(⊗ρ_i||⊗σ_i)≤(1/n)ΣD_i + (g(ε)+(1/(2log(e)n))ΣV_i)/sqrt(n)+C/n.
This result records the source’s operational or structural relation, with the stated endpoint and attainment clauses retained.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P07
noncomputable section
open Filter
open scoped BigOperators Matrix ComplexConjugate ComplexOrder Matrix.Norms.L2Operator Topology
namespace QAlgorithms.Papers.Independent.Intakenext100.P07
attribute [local instance] Classical.propDecidable Classical.decEq
variable {I J A B C D X Y Z : Type*}
variable [Fintype I] [DecidableEq I] [Fintype J] [DecidableEq J]
variable [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]
variable [Fintype C] [DecidableEq C] [Fintype D] [DecidableEq D]
variable [Fintype X] [DecidableEq X] [Fintype Y] [DecidableEq Y]
variable [Fintype Z] [DecidableEq Z]
/-- NODE paper:1504.00233#6.noniid
§6.4.2 (6.97)–(6.100): product-state finite-size bound, arXiv:1504.00233v5, PDF p.109. -/
theorem product_finite_size_bound [Nonempty I] (S : Finset (paperMat I × paperMat I))
(hS : ∀ x ∈ S, IsDensityMatrix x.1 ∧ IsDensityMatrix x.2 ∧ paperSupported x.1 x.2) :
∃ C : ℝ, 0 ≤ C ∧ ∀ n : ℕ, 0 < n → ∀ r s : Fin n → paperMat I, (∀ i, (r i,s i) ∈ S) →
∀ e : ℝ, 0 < e → e < 1 →
((1/(n:ℝ):ℝ):EReal)*smoothMaxD (productState r) (productState s) e ≤ (((∑ i, (paperRelativeD (r i) (s i)).toReal)/(n:ℝ)+
(paperPenalty e+(∑ i, paperVariance (r i) (s i))/(2*Real.logb 2 (Real.exp 1)*(n:ℝ)))/Real.sqrt n+C/(n:ℝ):ℝ):EReal) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P07
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be a nonempty finite type with decidable equality, and let be a finite set of pairs of matrices on such that every consists of positive semidefinite matrices of complex trace satisfying . For positive semidefinite matrices define by functional calculus, using , and set
with the first branch embedded into the extended reals, and
where is the extended-real-to-real conversion, equal to at either infinity. For subnormalized positive semidefinite , put
and define
with both infima taken in the extended reals and meaning . There exists a real constant such that, for every integer , every two sequences indexed by with , and every real , the product matrices
satisfy
where the right side is embedded into the extended reals. The constant is chosen before , the sequences, and ; and are excluded. The set may be empty, in which case no sequences satisfy the membership hypothesis for .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.