B.3: unital-qubit antidegrader feasibility (94)–(98)
OpenQAlgorithms.Papers.Independent.Gap20.P19.unitalAntidegraderFeasibilityAll 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 . For real amplitudes with , put and , where .
For real triples , let
Then is antidegradable iff there exist with and for all distinct . For any such pair, the map (94), reconstructed as , is CPTP and satisfies , where and the other two are obtained by the cycles and . Necessarily .
This direct PSD criterion remains valid at singular Schur-complement boundaries.
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.3, PDF pp.31–33, (94)–(98): necessary and sufficient PSD
feasibility, and the resulting explicit CPTP antidegrader. No inverse at y_k=±1. -/
theorem unitalAntidegraderFeasibility (a : Fin 4 → ℝ)
(ha : ∀ k, 0 ≤ a k) (hnorm : ∑ k, a k^2 = 1) :
((∃ envSize : ℕ, ∃ witness : Matrix (_ × Fin envSize) _ ℂ, receiverChannel witness = (qubitPauliMap a) ∧ IsAntidegradable witness) ↔ ∃ x y : Fin 3 → ℝ,
(feasibilityMatrix x y).PosSemidef ∧
∀ k : Fin 3, 2*a 0*a k.succ*x k + 2*a (k+1).succ*a (k+2).succ*y k =
pauliMultipliers a k) ∧
(∀ x y : Fin 3 → ℝ, (feasibilityMatrix x y).PosSemidef →
(∀ k : Fin 3, 2*a 0*a k.succ*x k + 2*a (k+1).succ*a (k+2).succ*y k =
pauliMultipliers a k) →
IsChannel (pauliAntidegrader x y) ∧
(∀ rho, pauliAntidegrader x y
(complementaryChannel (indexedKrausDilation (pauliKraus a)) rho) = qubitPauliMap a rho) ∧
(∀ k, |x k| ≤ 1 ∧ |y k| ≤ 1)) := 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 nonnegative real numbers satisfying . Write and for the standard Pauli matrices, put , and set . There exists a natural number and an isometry whose receiver map is and for which some channel maps its complementary output back to its receiver output on every matrix if and only if there exist real triples such that
for . Moreover, every such pair defines a channel
satisfying for every matrix , where ; it also satisfies and for each . Throughout, a channel means a finite Kraus map with ; the existential environment size includes , which cannot support the required isometry.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.