Theorem 12
ProvedQAlgorithms.Papers.Independent.Gap20.P19.twistedDiagonalRankAll 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.
Let have a normalized Kraus representation and invertible matrices for which every is diagonal. Then
The second equality corrects the printed to , exactly as computed by (54). The identity channel in dimension greater than one disproves the printed version.
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 12, PDF pp.19–20. Corrected printed output rank d_B to d_E:
(54) computes d_E, and the identity channel disproves the printed d_B clause. -/
theorem twistedDiagonalRank [Nonempty A] (Phi : Superop A A)
(hPhi : IsChannel Phi) (htwist : TwistedDiagonal Phi) :
(choi Phi).rank ≤ Fintype.card A ∧
∃ psi : EuclideanSpace ℂ A, IsState psi ∧
(Phi (pureDensity psi)).rank = (choi Phi).rank := by sorry
end QAlgorithms.Papers.Independent.Gap20.P19
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 map on complex matrices indexed by , admitting a finite Kraus representation with completeness relation . Suppose there exist a natural number , matrices satisfying and for every matrix , and invertible matrices such that, for every , is diagonal, with an arbitrary complex diagonal depending on . Then
where . The invertible matrices are not required to be unitary, and the hypotheses impose no fixed value on the number of Kraus matrices.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.