Pinching kraus ker of ne zero
pinching_kraus_ker_of_ne_zero
Project documentation
Lemma 3.10 of Hayashi's book "Quantum Information Theory - Mathematical Foundations". Also, Lemma 5 in https://arxiv.org/pdf/quant-ph/0107004. -- Used in (S60) -/ theorem pinching_bound (ρ σ : MState d) : ρ.M ≤ (↑(Fintype.card (spectrum ℝ σ.m)) : ℝ) • (pinching_map σ ρ).M := by rw [pinchingMap_apply_M] suffices ρ.M ≤ (Fintype.card (spectrum ℝ σ.m) : ℝ) •...
Exact Lean statement
theorem pinching_kraus_ker_of_ne_zero {d : Type*} [Fintype d] [DecidableEq d]
(σ : MState d) (v : d → ℂ) (hv : σ.m.mulVec v = 0)
(k : spectrum ℝ σ.m) (hk : k.val ≠ 0) :
(pinching_kraus σ k).mat *ᵥ v = 0Formal artifact
Lean source
theorem pinching_kraus_ker_of_ne_zero {d : Type*} [Fintype d] [DecidableEq d] (σ : MState d) (v : d → ℂ) (hv : σ.m.mulVec v = 0) (k : spectrum ℝ σ.m) (hk : k.val ≠ 0) : (pinching_kraus σ k).mat *ᵥ v = 0 := by -- Applying the equation $(pinching_kraus \sigma k).toMat * \sigma.m = k.val \bullet (pinching_kraus \sigma k).toMat$ to $v$, we get $(pinching_kraus \sigma k).toMat (\sigma.m v) = k.val (pinching_kraus \sigma k).toMat v$. have h_eq_zero : ((pinching_kraus σ k).mat * σ.m) *ᵥ v = k.val • ((pinching_kraus σ k).mat *ᵥ v) := by have h_eq_zero : ((pinching_kraus σ k).mat * σ.m) = k.val • (pinching_kraus σ k).mat := by convert pinching_kraus_mul_self σ k using 1; simp [ h_eq_zero]; ext i simp [ Matrix.mulVec, dotProduct ] ; simp only [mul_assoc, Finset.mul_sum]; simp_all [ ← Matrix.mulVec_mulVec ]; rw [eq_comm] at h_eq_zero aesop- Project
- quantumInfo
- License
- MIT
- Commit
- 56e83a9288a3
- Source
- QuantumInfo/Finite/Pinching.lean:321-335
Reuse this declaration
Bring the exact result into your workflow
The import identifies the source module. Your project still needs the pinned package dependency shown on this page.
What this badge means
This completion status comes from the project or community source. It has not yet been represented here as an independent rebuild and axiom audit.
Continue in this project
Related declarations
Conj Transpose isometry mul isometry le one
conjTranspose_isometry_mul_isometry_le_one
Project documentation
The operator norm of the conjugate transpose is equal to the operator norm. -/ theorem Matrix.opNorm_conjTranspose_eq_opNorm {m n : Type*} [Fintype m] [Fintype n] [DecidableEq m] [DecidableEq n] (A : Matrix m n 𝕜) : Matrix.opNorm Aᴴ = Matrix.opNorm A := by unfold Matrix.opNorm rw [← ContinuousLinearMap.adjoint.norm_map (toEuclideanLin A).toContinuousLine...
Source project: quantumInfo
Person-level attribution pending.
Convex roof of pure
convex_roof_of_pure
Plain-language statement
The convex roof extension of g : KetUpToPhase d → ℝ≥0 applied to a pure state ψ is g (KetUpToPhase.mk ψ).
Source project: quantumInfo
Person-level attribution pending.
Id achieves Rate log dim
CPTPMap.id_achievesRate_log_dim
Plain-language statement
The identity channel on D dimensional space achieves a rate of log2(D).
Source project: quantumInfo
Person-level attribution pending.