can_certify_noiseless_codes
A dimension d admits certification of noiseless quantum codes by k binary measurements if there exist a parametrized family of measurement operators M : ℝ → Fin k → Matrix (Fin d) (Fin d) ℂ and a parameter bound s_max : ℝ such that certifies_noiseless_codes M s_max holds.
Statement
def can_certify_noiseless_codes (d k : ℕ) : Prop
- Defined in
- arXiv:2610.37347 Discussion and outlook, paragraph 3
- Verified
- 07 Nov 2026
- Axioms
- none listed
- Built on 1
- certifies_noiseless_codesGiven $M : \mathbb{R} \to \mathrm{Fin}\,k \to \mathrm{Matrix}(\mathrm{Fin}\,d)(\mathrm{Fin}\,d)\mathbb{C}$ and $s_{\max} : \mathbb{R}$,…
- Used by 1
- not_can_certify_noiseless_codes_oneFor any dimension d, a single binary measurement cannot certify noiseless quantum codes, so ¬ can_certify_noiseless_codes d 1 holds.
Read back from the Lean
Given natural numbers d and k, can_certify_noiseless_codes d k asserts that there exist:
1. A parameter-dependent family of k-tuples of d × d complex matrices, M : ℝ → Fin k → Matrix (Fin d) (Fin d) ℂ, and
2. A real number s_max,
such that all of the following hold:
- 1 < s_max;
- For every s ∈ [0, s_max] and every j : Fin k, M s j is positive semidefinite and 1 - M s j is positive semidefinite (i.e., each M s j is a valid quantum effect on ℂ^d);
- For every s ∈ [0, s_max], the collection of effects M s is jointly measurable on the identity matrix 1 if and only if s ≤ 1;
- For every dimension D ≥ d, every natural number m, and every collection of Kraus operators K : Fin m → Matrix (Fin d) (Fin D) ℂ satisfying the completeness relation ∑ i, (K i)ᴴ * K i = 1 (the identity matrix on ℂ^D):
Defining the quantum channel N(X) = ∑ i, K i * X * (K i)ᴴ (from D × D to d × d matrices) and its dual map Λ(Y) = ∑ i, (K i)ᴴ * Y * K i (from d × d to D × D matrices),
the following two statements are equivalent:
(a) There exists an isometry W : Matrix (Fin D) (Fin d) ℂ (with Wᴴ * W = 1) such that for all density matrices ρ : Matrix (Fin d) (Fin d) ℂ (positive semidefinite with trace 1), N (W * ρ * Wᴴ) = ρ;
(b) For all s ∈ [0, s_max], the pulled-back effects j ↦ Λ (M s j) are jointly measurable on the identity matrix 1 (on ℂ^D) if and only if s ≤ 1.
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
Lean source view module on GitHub
/-- A dimension d admits certification of noiseless quantum codes by k binary measurements if there exists a parametrized family M and bound s_max such that certifies_noiseless_codes M s_max holds. -/ def can_certify_noiseless_codes (d k : ℕ) : Prop := ∃ (M : ℝ → Fin k → Matrix (Fin d) (Fin d) ℂ) (s_max : ℝ), certifies_noiseless_codes M s_max