Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3.1 — sequential local Pauli measurements implement decryption

Proved
PauliUnclonable531.Pauli.decryption_execution

by sragavan · Nov 10, 2026 · Mathlib 0df444a (Lean v4.33.1)

cryptographyquantum-information

Fix a nonidentity Pauli key k=(x,z)k=(x,z)k=(x,z) on nnn qubits. The §3.1 decryption procedure measures, one after another, each nonidentity position jjj of kkk in the eigenbasis of the local Pauli σ(xj,zj)∈{X,Y,Z}\sigma_{(x_j,z_j)}\in\{X,Y,Z\}σ(xj​,zj​)​∈{X,Y,Z}, i.e. it applies the projective instrument {Πb(j)=12(I+(−1)bσ(xj,zj)) on wire j}b∈{0,1}\{\Pi^{(j)}_{b}=\tfrac12(I+(-1)^{b}\sigma_{(x_j,z_j)})\text{ on wire }j\}_{b\in\{0,1\}}{Πb(j)​=21​(I+(−1)bσ(xj​,zj​)​) on wire j}b∈{0,1}​ to the current unnormalized post-measurement state, and outputs the parity of the observed outcome bits.

For every operator σ\sigmaσ on the nnn-qubit space (in particular every density operator, including entangled ones) and every output bit bbb, the Born probability that this sequential procedure outputs bbb equals the probability of outcome bbb of the global two-outcome measurement {Qk,0,Qk,1}\{Q_{k,0},Q_{k,1}\}{Qk,0​,Qk,1​}:

Pr⁡[procedure outputs b∣σ]=Re⁡Tr⁡[Qk,b σ],Qk,b=12(I+(−1)bPk).\Pr[\text{procedure outputs } b\mid\sigma]=\operatorname{Re}\operatorname{Tr}\big[Q_{k,b}\,\sigma\big],\qquad Q_{k,b}=\tfrac12\big(I+(-1)^bP_k\big).Pr[procedure outputs b∣σ]=ReTr[Qk,b​σ],Qk,b​=21​(I+(−1)bPk​).

Thus decryption needs only single-qubit Pauli measurements and classical parity computation.

Formalization Note. The procedure is decProgram k, interpreted by executeDec, which sums over all outcome strings the traces of the unnormalized post-measurement states whose outcome parity equals bbb. The statement is proved for every complex matrix σ\sigmaσ; the density hypothesis of the headline theorem is not needed.

Differences from the source:

  • encoding: finite-dimensional complex Hilbert-space operators and binary strings → complex matrices indexed by finite computational bases, Fin 2 bits and real Born probabilities; reason: these are the same finite-dimensional objects after choosing the source basis
Preamble
import Mathlib
import Definitions.Def_PauliUnclonable531_Pauli_Ensemble

open scoped Matrix Matrix.Norms.L2Operator ComplexOrder
set_option autoImplicit false
Formal statement
namespace PauliUnclonable531.Pauli

theorem decryption_execution (n : ℕ) (k : Key n) (σ : Op (Bits n)) (b : Fin 2) :
    operationalDec k σ b = born (decryptEffect k b) σ := by sorry

end PauliUnclonable531.Pauli
Source
Prabhanjan Ananth, Seyoon Ragavan, Amit Sahai, STOC 2027 submission #531 (October 2026) / arXiv:2607.21551v4, §3.1, pp.16–17 (efficient decryption procedure); decryption effects of §3, p.15

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me