Kraus-count refinement and local unitary specialization
ProvedQAlgorithms.Papers.Independent.Advance50.P43.krausCountAndUnitaryBoundLet be the disjoint nonzero finite spin registers, with dimensions , let be their fixed network Hamiltonian, set , and let be an even state-independent operator-norm bound for every supported . Let the density matrix satisfy the finite-network and state-independent LR assumptions described in Eqs. (2)–(6). All register dimensions are positive; may be one-dimensional. Let be an A-local CPTP map with . Set and . With ,
In particular, for any A-local unitary , the encoding has a one-element Kraus presentation and the bound is .
This refinement retains the actual presentation size of the effective A-local encoding; it does not assert that a QA unitary followed by tracing Q induces a unitary on A.
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.5, (41): K counts Kraus operators of the effective
A-local map. The unitary clause concerns an A-local unitary, not an arbitrary
unitary on QA followed by discarding Q. -/
theorem krausCountAndUnitaryBound [Nonempty A] [Nonempty B] [Nonempty C]
(D : LRData A B C)
(tau : Matrix (A × (B × C)) (A × (B × C)) ℂ) (htau : IsDensityMatrix tau)
(t : ℝ) :
(∀ (K : ℕ) (F : Fin K → Matrix A A ℂ), IsKrausFamily F →
traceNorm (receive D t (mapFirst (krausApply F) tau) - receive D t tau) / 2 ≤
((K : ℝ) / 2) * D.epsilon t) ∧
(∀ V : Matrix.unitaryGroup A ℂ,
traceNorm (receive D t (mapFirst (conjSuperop (V : Matrix A A ℂ)) tau) -
receive D t tau) / 2 ≤ D.epsilon t / 2) := 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, satisfying
for every real and all matrices on , on . Given any positive semidefinite trace-one matrix on and any real , write . Then, for every natural number , including zero, and every family of matrices on satisfying ,
Also, for every unitary matrix on ,
Here . For , the required Kraus identity would be , which is impossible because is nonempty, so that instance of the conditional assertion is vacuous.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.