Lemma 3.1 — perfect correctness
ProvedPauliUnclonable531.Pauli.correctnesscryptographyp2o-batch-stoc27ap2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-information
For every n≥1, supported key k, message m and decryption outcome m′, the scheme's exact outcome law is
Here ρ is the Section 3 ciphertext and Q is the Section 3 decryption effect. In particular decryption returns the original bit with probability one for each supported key, rather than merely on average over keys. The full binary law is the displayed computation on p.16.
Differences from the source:
- encoding: finite-dimensional complex Hilbert-space operators and binary strings → complex matrices indexed by finite computational bases, Fin 2 bits, real Born probabilities, Euclidean spectral norm and PSD-difference order; reason: these are the same finite-dimensional objects and conventions after choosing the source basis
Preamble
import Mathlib import Definitions.Def_PauliUnclonable531_Pauli_Scheme open scoped Matrix Matrix.Norms.L2Operator ComplexOrder set_option autoImplicit false
Formal statement
namespace PauliUnclonable531.Pauli
/-- Lemma 3.1 and its displayed outcome law, pp.15–16. -/
theorem correctness (n : ℕ) (hn : 1 ≤ n) (k : Key n) (m m' : Fin 2) :
born (decryptEffect k m') (ciphertext k m) = if m' = m then 1 else 0 := by sorry
end PauliUnclonable531.Pauli
Source
Prabhanjan Ananth, Seyoon Ragavan, Amit Sahai, STOC 2027 submission #531 (October 2026), Lemma 3.1, p.15, with its outcome-law computation on p.16
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.