Theorem 11
ProvedQAlgorithms.Papers.Independent.Gap20.P19.pseudoDiagonalAndEBAll Hilbert spaces are finite dimensional, complex, and nonzero. A channel is completely positive and trace preserving on every operator. Write for its Choi rank, the minimum pure-environment dimension. Receiver and complementary channels are always obtained from the same isometry.
A pseudo-diagonal channel has, in an orthonormal output basis and for arbitrary input vectors , the form , where is positive semidefinite and the full map is trace preserving. Every such channel is degradable. Equivalently, every entanglement-breaking channel is antidegradable:
The vectors need not be orthogonal or separately normalized; the output basis may be changed unitarily.
import Definitions.Def_QAlgorithms_Papers_Independent_Gap20_P19
noncomputable section
namespace QAlgorithms.Papers.Independent.Gap20.P19
open scoped BigOperators Matrix ComplexConjugate ComplexOrder Kronecker
open Filter Topology
open QAlgorithms.Papers.Independent.Information100.P67
(IsIsometry receiverChannel complementaryChannel IsDegradable IsAntidegradable
maximumCoherentInformation dilationPower)
open QAlgorithms.Papers.Independent.Claimed50.P48
(MinimalDilation indexedKrausDilation arbitraryVectorComplement superopTensor tensorDilation)
open QAlgorithms.Papers.Independent.Claimed50.P24 (ChannelEB)
open QAlgorithms.Papers.Independent.Information100.P60 (wernerHolevo)
open QAlgorithms.Papers.Independent.Gap48.P36 (finWeyl WeylLabel)
open QAlgorithms.Papers.Independent.Information100.P69 (choi)
open QAlgorithms.Papers.Independent.Information100.P50 (matrixRange)
open QAlgorithms.Papers.Independent.Information100.P08 (IsPure)
attribute [local instance] Classical.propDecidable Classical.decEq
variable {A B C E F R K A2 B2 E2 : Type}
variable [Fintype A] [DecidableEq A] [Nonempty A]
variable [Fintype B] [DecidableEq B] [Nonempty B]
variable [Fintype C] [DecidableEq C] [Nonempty C]
variable [Fintype E] [DecidableEq E] [Nonempty E]
variable [Fintype F] [DecidableEq F] [Nonempty F]
variable [Fintype R] [DecidableEq R] [Nonempty R]
variable [Fintype K] [DecidableEq K]
variable [Fintype A2] [DecidableEq A2] [Nonempty A2]
variable [Fintype B2] [DecidableEq B2] [Nonempty B2]
variable [Fintype E2] [DecidableEq E2] [Nonempty E2]
/-- Theorem 11, PDF p.19. Both formulations are retained, on arbitrary
nonzero finite systems. No individual frame-vector normalization is required. -/
theorem pseudoDiagonalAndEB [Nonempty A] [Nonempty B] :
(∀ Phi : Superop A B, IsChannel Phi → PseudoDiagonal Phi → (∃ envSize : ℕ, ∃ witness : Matrix (_ × Fin envSize) _ ℂ, receiverChannel witness = Phi ∧ IsDegradable witness)) ∧
(∀ Phi : Superop A B, IsChannel Phi → ChannelEB Phi → (∃ envSize : ℕ, ∃ witness : Matrix (_ × Fin envSize) _ ℂ, receiverChannel witness = Phi ∧ IsAntidegradable witness)) := by sorry
end QAlgorithms.Papers.Independent.Gap20.P19
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For any nonempty finite types with decidable equality, the statement asserts two universally quantified implications. First, let map complex matrices to complex matrices and be a finite Kraus channel. Suppose there exist a positive semidefinite matrix indexed by , vectors , and a unitary on such that for every matrix , where
Then has a finite environment dilation satisfying , whose receiver map is , and whose environment map equals for some finite Kraus channel . Second, for every finite Kraus channel , suppose that for every unit vector , the matrix , obtained by applying to each block on the second factor, is a finite convex sum , with , , and positive semidefinite of trace . Then has such an isometric dilation whose receiver map equals a finite Kraus channel applied to its environment map. In both implications the receiver and environment maps are respectively and , the asserted identities hold for every matrix , and a finite Kraus channel means with .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.