Coset masses identify syndromes and residual logical Paulis
ProvedQAlgorithms.Papers.Independent.Support50.P40.coset_probabilitiesFix a normalized additive code encoding one qubit into physical qubits. Its phase-inclusive stabilizer is commuting, excludes , and has independent generators. Let be its phase-free label set and its commutation centralizer. Choose complete representatives of physical syndromes and of logical , with the identity representatives at the zero syndrome and logical identity. The logical representatives act as the named Paulis on the entire encoded operator algebra. Let be the independent depolarizing error law, with identity probability and other-Pauli probability .
Then is exactly the mass of errors acting as the identity channel on the whole code. For , is the mass of undetected errors acting as logical ; is the no-syndrome probability. For every syndrome and logical label,
For the normalized encoded Bell input these are the syndrome and generalized Bell measurement probabilities. After correcting with , the unnormalized logical branch on any logical operator is . Logical correspond to as density operators.
These identifications retain zero-mass outcomes without conditional division and supply the probability law used in the concatenation rate.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P40
namespace QAlgorithms.Papers.Independent.Support50.P40
open QAlgorithms QAlgorithms.Stabilizer
open scoped ComplexConjugate Matrix
noncomputable section
/-- PDF pp.7--8,13, five probability interpretations and Eqs.(18)--(19).
All logical actions are compared on the entire encoded operator algebra;
the recovered branch retains its mass even for zero-probability syndromes. -/
theorem coset_probabilities {m : ℕ} (C : InnerCode m) (T : CosetChoices C)
(f : ℝ) (hf0 : 0 ≤ f) (hf1 : f ≤ 1) :
weightPolynomial f (stabilizerLabels C.stabilizer) =
errorEventMass f (fun e : ErrorLabel (m + 1) =>
∀ rho : Matrix Bool Bool ℂ,
conjSuperop (pauliOps e) (conjSuperop (innerEncoderMatrix C) rho) =
conjSuperop (innerEncoderMatrix C) rho) ∧
(∀ j : Pauli, j ≠ .I →
weightPolynomial f (labelCoset (T.logicalRep j) (stabilizerLabels C.stabilizer)) =
errorEventMass f (fun e : ErrorLabel (m + 1) =>
e ∈ centralizerLabels C.stabilizer ∧ ∀ rho : Matrix Bool Bool ℂ,
conjSuperop (pauliOps e) (conjSuperop (innerEncoderMatrix C) rho) =
conjSuperop (innerEncoderMatrix C) (conjSuperop j.mat rho))) ∧
weightPolynomial f (centralizerLabels C.stabilizer) =
effectProb (syndromeProjector C T (fun _ => false)) (outputQ C f) ∧
(∀ i, syndromeMass C T f i =
effectProb (syndromeProjector C T i) (outputQ C f)) ∧
(∀ i j, jointMass C T f i j =
effectProb (pureDensity (bellBasis C T i j)) (outputRQ C f)) ∧
(∀ i (rho : Matrix Bool Bool ℂ), recoveredBranch C T f i rho =
∑ j : Pauli, (jointMass C T f i j : ℂ) • conjSuperop j.mat rho) := by sorry
end
end QAlgorithms.Papers.Independent.Support50.P40
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be any natural number, put , and write . Use for the usual Pauli matrices in the Boolean basis, with , and let for each Pauli label string . Multiplication of labels, denoted by , discards the phase in Pauli multiplication: under , , , , it is coordinatewise addition modulo . The supplied inner-code data consist of a subgroup of the unitary matrices on , contained in the subgroup generated by all matrices with , whose elements commute pairwise and none of which is ; and two orthonormal vectors whose span is exactly the space fixed by every element of . Let have columns , and define
The inner-code data also require . The supplied representative data consist of strings for and for , with ; every label string belongs to for exactly one ; every belongs to ; every element of belongs to for exactly one ; and, for every and every complex matrix ,
For every real with , let count nonidentity entries, set , and write . Define
Here applies to each block indexed by the reference bit, and . The theorem asserts the conjunction
The matrices quantified in the action conditions and final equality are arbitrary complex matrices, without positivity or trace assumptions. The theorem includes and , and all powers with exponent equal .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.