Cat phase errors have identical restrictions; distance is one
ProvedQAlgorithms.Papers.Independent.Support50.P40.cat_phaseErrors_distanceOneLet and let . For a physical wire , write for Pauli on that wire and identity elsewhere.
The code has dimension two and distance exactly one. Its phase-error restrictions satisfy
These are identities of operators restricted to the entire code, so they apply to every normalized code state. At the distinct-wire pair claim is vacuous, while the distance claim remains meaningful. No formal claim of degeneracy for correction radius zero is made.
Formalization Note Page 20 prints “pairs of amplitude errors.” The statement corrects this to phase errors, as forced by Eqs. (31)–(33). For example leaves the three-qubit cat subspace, whereas fixes it. Independent moderation of the correction is required.
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.16,20, Eqs.(31)--(33): corrected phase-error degeneracy and
exact distance one. Printed: "all pairs of amplitude errors". Changed to
pairs of PHASE errors: Z_a Z_b stabilizes the displayed code; X_a X_b
does not (p=3), and at p=2 it is logical X. This source correction requires
independent moderation. It does not claim degeneracy at t=floor(d/2)=0. -/
theorem cat_phaseErrors_distanceOne (m : ℕ) :
Module.finrank ℂ (catSpace m) = 2 ∧ HasDistance (catSpace m) 1 ∧
(∀ (a b : Fin (m + 1)) (psi : EuclideanSpace ℂ (Qubits (m + 1))),
psi ∈ catSpace m → act (singleZ a) psi = act (singleZ b) psi) ∧
(∀ (a b : Fin (m + 1)), a ≠ b →
∀ psi : EuclideanSpace ℂ (Qubits (m + 1)), psi ∈ catSpace m →
act (singleZ a * singleZ b) psi = psi) := by sorry
end
end QAlgorithms.Papers.Independent.Support50.P40
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every integer , let be the complex span of the two computational basis vectors and . This subspace has complex dimension , and it has distance in the following precise sense: every matrix acting on at most zero wires is detectable on , while some matrix acting on at most one wire is not detectable on . Here a matrix acts on at most wires if there exist a set of at most wire positions, an integer , an injection with image contained in , and an arbitrary complex -qubit matrix , such that its entry at bit strings is when agree outside the image of , and is zero otherwise. Detectability means that there exists a complex scalar such that for every unit vector ; failure of detectability means no such common scalar exists. Let be the diagonal matrix whose entry at a bit string is if and if . For every pair of wire positions and every vector ,
For every such pair with , and every vector ,
These last two assertions do not require to be normalized and include the zero vector. When , is the entire one-qubit space, and the assertion concerning distinct wire positions is vacuous.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.