B.5: nonuniqueness of complementary degraders
ProvedQAlgorithms.Papers.Independent.Gap20.P19.depolarizingAntidegraderNonuniqueAll 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 put and . Fix the dilation of given by the four Kraus operators , with complement . There exist two distinct CPTP maps such that
Distinctness is on the same full complementary operator space. No uniqueness claim is made at either endpoint.
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]
/-- Appendix B.5, PDF pp.35–36: distinct CPTP antidegraders on the SAME
fixed complementary output for -1/3<lam<2/3. No endpoint uniqueness is asserted. -/
theorem depolarizingAntidegraderNonunique (lam : ℝ)
(hlo : -1/3 < lam) (hhi : lam < 2/3) :
let a := depolarizingAmplitudes lam
let U := indexedKrausDilation (pauliKraus a)
∃ D1 D2 : Superop (Fin 4) Bool, IsChannel D1 ∧ IsChannel D2 ∧ D1 ≠ D2 ∧
(∀ rho, D1 (complementaryChannel U rho) = qubitPauliMap a rho) ∧
(∀ rho, D2 (complementaryChannel U rho) = qubitPauliMap a rho) := 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 every real number with , set and . Let be the standard Pauli matrices, define , and define by . There exist two distinct channels from complex matrices to complex matrices such that, for every complex matrix ,
Each channel is required to admit a finite Kraus representation with , and distinctness means inequality as maps on all matrices.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.