§2.3: equal input/output dimensions with larger environment
ProvedQAlgorithms.Papers.Independent.Gap20.P19.equalDimensionsLargeEnvironmentAll 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 and let have Choi rank . Let , and let be the channel from the symmetric-subspace inclusion into . The explicitly regrouped tensor dilation of is degradable and has
This gives equal input/output dimensions with a larger minimum environment.
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]
/-- Section 2.3, PDF p.11: explicit tensor construction with equal input/output
size 6d and larger minimum environment 3(d^2+1), for d>1. -/
theorem equalDimensionsLargeEnvironment [Nonempty A] [Nonempty E]
(U : Matrix (A × E) A ℂ) (hU : IsIsometry U)
(hd : 1 < Fintype.card A) (hfull : (choi (receiverChannel U)).rank = Fintype.card A^2) :
let V := tensorDilation (flaggedDilation (1/2) U) symmetricIsometry
IsDegradable V ∧
Fintype.card (A × Fin 6) = 6*Fintype.card A ∧
Fintype.card ((Bool × A) × Fin 3) = 6*Fintype.card A ∧
(choi (receiverChannel V)).rank = 3*(Fintype.card A^2+1) ∧
6*Fintype.card A < (choi (receiverChannel V)).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 nonempty finite types with decidable equality, let satisfy , and suppose and the Choi matrix of has rank , where . Define by
Define to have columns , and form with input , receiver , and environment , by
Then , and there exists a channel from its receiver to its environment such that for every input matrix ; a channel means a finite Kraus map with . The input and receiver dimensions both equal , while
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.