A maximum-erasure-protection code gives a perfect state
OpenQAlgorithms.Papers.Independent.Intakenext100.P95.perfect_code_to_perfect_stateLet , , and let be an isometry encoding one -dimensional spin into physical spins of dimension . For every erased set of at most physical spins, assume there is one CPTP recovery channel, chosen independently of the logical input, that exactly recovers all logical density matrices (equivalently all operators by linearity). Add a reference spin and construct
Then this vector is normalized and perfect. For every subset of at most of its spins,
This is the maximum-erasure-protection meaning of perfect code from the surrounding discussion on p.8. Neither purity nor maximally mixed physical marginals are assumed.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P95
namespace QAlgorithms.Papers.Independent.Intakenext100.P95
open scoped Matrix ComplexConjugate
noncomputable section
local instance (p : Prop) : Decidable p := Classical.propDecidable p
/-- PDF pp.8,45, Appendix A.1: the normalized Choi state of an isometric
[[2n−1,1,n]]_v maximum-erasure-protection code is a perfect 2n-spin state.
The assumptions require exact correction of n−1 erasures. In particular, no
maximally mixed physical marginal or purity conclusion is assumed. -/
theorem perfect_code_to_perfect_state {L V : Type*} [Fintype L] [Fintype V]
[DecidableEq L] [DecidableEq V] (n : ℕ) (hn : 1 ≤ n)
(hlegs : Fintype.card L = 2 * n - 1) (hv : 2 ≤ Fintype.card V)
(M : Matrix (L → V) V ℂ) (hcode : IsPerfectErasureCode n M) :
IsState (encoderPurification M) ∧ IsPerfect (encoderPurification M) ∧
∀ A : Finset (L ⊕ Unit), A.card ≤ n →
subsetDensity A (pureDensity (encoderPurification M)) = ((Fintype.card (SubsetConfig V A) : ℂ)⁻¹ • 1) := by sorry
end
end QAlgorithms.Papers.Independent.Intakenext100.P95
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be finite types with decidable equality, let be a natural number, suppose and , and let be a complex matrix from to configurations . Assume and that, for every with , there is a channel satisfying for every complex matrix on ; here a channel has a finite Kraus representation with , and sums over matching configurations on . On the disjoint union , define the vector , indexed by , by
Then ; the number is even, , and for every with , there exists a real number such that , where has rows indexed by , columns indexed by , and entries . Moreover, for every with ,
Thus the asserted reduced-matrix identity includes , whose configuration space has one element.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.