The explicit qutrit erasure code and self-dual CSS perfect state
OpenQAlgorithms.Papers.Independent.Intakenext100.P95.three_qutrit_code_and_four_qutrit_perfect_stateUse arithmetic modulo three. Define the encoder by
and define the four-qutrit state, with reference leg last, by
The encoder is isometric, and erasure of any set of at most one physical qutrit is correctable by a CPTP recovery channel. The displayed state is normalized and perfect; every marginal on at most two qutrits is maximally mixed. It spans the joint space of the X-type and Z-type checks with the same rows and , so this state is self-dual CSS. Here and with . The construction supplies the source’s concrete qutrit example.
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.45–46, Appendix A.2: the explicit three-qutrit erasure code and
normalized four-qutrit perfect state. Recovery channels precede the input operator.
The shared X/Z check rows and the one-dimensional +1 space state the self-dual CSS clause. -/
theorem three_qutrit_code_and_four_qutrit_perfect_state :
qutritEncoderᴴ * qutritEncoder = 1 ∧
(∀ A : Finset (Fin 3), A.card ≤ 1 →
∃ R : Superop (SubsetConfig Trit Aᶜ) Trit, IsChannel R ∧
∀ rho : Matrix Trit Trit ℂ,
R (subsetDensity Aᶜ (qutritEncoder * rho * qutritEncoderᴴ)) = rho) ∧
IsState fourQutritState ∧ IsPerfect fourQutritState ∧
(∀ A : Finset (Fin 4), A.card ≤ 2 →
subsetDensity A (pureDensity fourQutritState) = ((Fintype.card (SubsetConfig Trit A) : ℂ)⁻¹ • 1)) ∧
qutritCSSSpace = Submodule.span ℂ {fourQutritState} := 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 , let be the matrix
and let be given by when and , and zero otherwise, with all these equations in . For any subset of the relevant positions, define reduction onto by
The theorem asserts , and for every with , there exists a map from complex matrices indexed by to complex matrices indexed by such that
for some natural number and matrices , and for every complex matrix , without a positivity or trace restriction on . This includes . The vector has norm one and is nonzero, its number of positions is even, and for every with , the matrix satisfies for some real . Furthermore,
including the empty subset. Finally, the complex subspace of vectors satisfying, for , , both , and every ,
is exactly , where takes the representative modulo in .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.