Encoding-independent induced state distance
ProvedQAlgorithms.Papers.Independent.Advance50.P43.inducedDistanceBoundLet be the nonzero finite-dimensional spin registers in the source's fixed network, with Alice and Bob controlling disjoint separated regions and . Write for their dimensions; an empty remaining region has dimension one. Fix the self-adjoint network Hamiltonian , set , and suppose the nonnegative even function bounds all supported commutators in operator norm:
Let be any density matrix, including correlated mixed states. Let be an arbitrary nonzero finite memory register, initially independent of , and let be any fixed CPTP encoding acting only on . The induced channel is
Write and .
For channel pairs define , where . Then
This controls every received state independently of the encoding. The distance has no factor of one half.
import Definitions.Def_QAlgorithms_Papers_Independent_Advance50_P43
noncomputable section
open scoped Matrix ComplexConjugate ComplexOrder Matrix.Norms.L2Operator
namespace QAlgorithms.Papers.Independent.Advance50.P43
open QAlgorithms.Papers.Independent.Dependency50.P45
(holevoCapacity resourceCapacity standardEbit)
open QAlgorithms.Papers.Independent.Information100.P32 (evolution)
open QAlgorithms.Papers.Independent.Information100.P69 (replacer diamond)
open QAlgorithms.Papers.Independent.Information100.P67 (mapFirst privateCapacity)
open QAlgorithms.Papers.Independent.Information100.P22 (quantumCapacity)
open QAlgorithms.Papers.Independent.Dependency50.P23 (ordinaryClassicalCapacity)
open QAlgorithms.Papers.Independent.Information100.P34 (choi)
variable {A B C Q : Type}
variable [Fintype A] [Fintype B] [Fintype C] [Fintype Q]
variable [DecidableEq A] [DecidableEq B] [DecidableEq C] [DecidableEq Q]
/-- arXiv:1905.11920v2, PDF p.4, (19), with the density-input convention (34),
p.5: induced state distance, uniformly over the input, initial state and encoding. -/
theorem inducedDistanceBound [Nonempty A] [Nonempty B] [Nonempty C] [Nonempty Q]
(D : LRData A B C)
(tau : Matrix (A × (B × C)) (A × (B × C)) ℂ) (htau : IsDensityMatrix tau)
(E : Superop (Q × A) (Q × A)) (hE : IsChannel E) (t : ℝ) :
stateDistance (snc D tau E t) (comparisonZero D tau t) ≤
(Fintype.card A : ℝ) ^ 2 * D.epsilon t := by sorry
end QAlgorithms.Papers.Independent.Advance50.P43
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be finite nonempty types with decidable equality. Suppose is Hermitian on , and is nonnegative and even, with
for every and all matrices on and on . For every positive semidefinite trace-one matrix on , every channel on , and every real , form by taking , applying to while leaving untouched, tracing out , evolving by , and tracing out . Channels here have finite Kraus representations with . Put and . Then
The supremum ranges over density matrices on ; the distance contains no factor . The assertion includes every real and .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.