Geometric support ensures exact Majorana-ring correction
OpenQAlgorithms.Papers.Independent.Intakethird100.P44.majorana_ring_geometric_correctionAll Hilbert spaces are finite dimensional and nonzero, and every channel is completely positive and trace preserving on the full matrix algebra. Consider Majorana operators on the -dimensional Fock space, satisfying . There are free modes in cyclic order, with even-length intervals of nearest-neighbor paired modes between consecutive free modes. The isometry encodes all free-mode states and initializes each paired fermion in its specified vacuum; its range projector is the product of the paired-mode vacuum projectors. Write for total parity and . Let . Let have a normalized finite Kraus family. Suppose each whole is an even Majorana polynomial supported on some cyclic interval of length with . The intervals may differ with . Then, writing , there is one complex array such that
for every and every commuting with the whole-chain even algebra. Moreover a CPTP recovery strongly local to that algebra exactly recovers on the code. If , only scalar Kraus operators meet the support condition.
This is finite exact correction under geometric support, without a common support region for the channel or a standard full-code Knill–Laflamme assertion.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P44
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakethird100.P44
open scoped Matrix ComplexConjugate ComplexOrder
open QAlgorithms.Papers.Independent.Information100.P60 (Mat)
open QAlgorithms.Papers.Independent.Information100.P67 (mapFirst)
open QAlgorithms.Papers.Independent.Claimed50.P48 (operatorTraceDual)
open QAlgorithms.Papers.Independent.Renew46.P43 (purification)
variable {H K L J E F B : Type*}
variable [Fintype H] [DecidableEq H] [Fintype K] [DecidableEq K]
variable [Fintype L] [DecidableEq L] [Fintype J] [DecidableEq J]
variable [Fintype E] [DecidableEq E] [Fintype F] [DecidableEq F]
variable [Fintype B] [DecidableEq B]
/-- PDF pp.10--11, Section IV F: each even Kraus operator may have its OWN
geometric interval, of length at most half the shortest paired interval.
Conclusion is Eq.(54) and exact strong-local physical correction; the disputed
whole-code standard-KL reduction is not used or asserted.
Parity correction, PDF p.2 Eq.(1): printed i^(|omega|-1) for Majorana labels;
changed to i^m on 2m ordered modes. Why: the printed four-mode value is
anti-Hermitian with square -I, whereas the source requires parity sectors of
a Hermitian involution. Only this normalization (up to sign) is corrected. -/
theorem majorana_ring_geometric_correction {n k : ℕ}
(f : Fermions n) (r : RingLayout n k) (code : RingCode f r)
(noise : J → Mat (Fin (2 ^ n))) (hnoise : IsKrausFamily noise)
(hsupport : ∀ j, ∃ length : ℕ, 2 * length ≤ minimumGap r ∧
HasIntervalSupport f (noise j) length) :
RegionalCoefficients (evenRegion f Finset.univ : Set _) (totalParity f)
noise code.W ∧
StrongCorrectable (evenRegion f Finset.univ : Set _) (totalParity f)
(krausApply noise) code.W := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P44
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For all natural numbers , let be Hermitian complex matrices satisfying , and let a ring layout specify and strictly increasing free indices with even cyclic gaps . Let be a complex matrix with and
ordered by increasing and then increasing , with empty products equal to . For a finite index type , let be complex matrices satisfying . Suppose that for each there exist a natural number and a starting index such that and belongs to the complex linear span of even-length products of matrices whose indices satisfy ; repetitions, arbitrary ordering, and empty products are allowed. In particular, is permitted and then is a scalar multiple of ; an empty cannot satisfy the normalization above. Write for the complex linear span of all even-length products of the , set , and put for . The first conclusion is that there exist complex coefficients such that, for every , every , and every matrix commuting with every element of ,
The second conclusion is that there exists a channel , admitting a finite Kraus representation with Kraus operators satisfying , whose trace dual sends every element of into and fixes every matrix commuting with , and such that
for every complex matrix .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.