Equation (6): exact logical-Pauli and specific-syndrome joint distribution
OpenQAlgorithms.Papers.Independent.Intakenext100.P93.cat_joint_lawLet , , and . Apply this Pauli law independently to all physical qubits of the cat code. For a specified syndrome string of weight , let be the probability, summed over physical error strings, of logical Pauli and syndrome . Set when , and when . Then
This is the law of one syndrome string, so no binomial coefficient occurs. It supplies the full joint Pauli law, including correlated amplitude and phase errors.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P93
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakenext100.P93
open QAlgorithms
open scoped BigOperators ComplexConjugate Matrix
attribute [local instance] Classical.propDecidable Classical.decEq
/-- Smith--Smolin, PDF p.2, Eq.(6): one specific syndrome's joint law, with
piecewise nonnegative exponents equivalent to u(m-2r)+r and (1-u)(m-2r)+r. -/
theorem cat_joint_law (k : ℕ) (px py pz : ℝ)
(hx : 0 ≤ px) (hy : 0 ≤ py) (hz : 0 ≤ pz) (hsum : px + py + pz ≤ 1)
(u v : Bool) (s : Qubits k) :
catLogicalSyndromeMass k px py pz u v s =
((px + py) ^ amplitudeCount k u s * (1 - px - py) ^ noAmplitudeCount k u s +
(if v then (-1 : ℝ) else 1) * (px - py) ^ amplitudeCount k u s *
(1 - px - py - 2 * pz) ^ noAmplitudeCount k u s) / 2 := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P93
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every natural number , nonnegative real numbers with , Boolean values , and syndrome string , assign a pair of error strings the weight , where
Let be the sum of these weights over all satisfying , , and for every . If is the number of true bits of , put when is false, and when is true. The theorem asserts
where is for false and for true. Zero error parameters, , and are included; zero exponents use the convention , including .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.