Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3.1 — resource counts of the encryption and decryption procedures

Proved
PauliUnclonable531.Pauli.resource_counts

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

cryptographyquantum-information

Fix n≥1n\ge1n≥1 and a nonidentity Pauli key k=(x,z)k=(x,z)k=(x,z) on nnn qubits. The generated §3.1 procedures satisfy the following resource bounds.

  1. The pivot found by the left-to-right key scan exists and is the least nonidentity position: it is a position ppp with (xp,zp)≠(0,0)(x_p,z_p)\ne(0,0)(xp​,zp​)=(0,0) and (xi,zi)=(0,0)(x_i,z_i)=(0,0)(xi​,zi​)=(0,0) for all i<pi<pi<p.
  2. The random tapes (bit strings vanishing at the pivot) number exactly 2n−12^{n-1}2n−1.
  3. The encryption instruction list contains exactly n−1n-1n−1 fair coin draws, exactly nnn computational-basis preparations, and at most 2n2n2n H/SH/SH/S gates.
  4. Its classical address-bit cost 10(n+1) (n+Lenc+1)10(n+1)\,(n+L_{\mathrm{enc}}+1)10(n+1)(n+Lenc​+1), with LencL_{\mathrm{enc}}Lenc​ the instruction-list length, is at most 100(n+1)2100(n+1)^2100(n+1)2.
  5. The decryption instruction list has at most nnn local Pauli measurements, and its cost 10(n+1)(n+2Ldec+1)10(n+1)(n+2L_{\mathrm{dec}}+1)10(n+1)(n+2Ldec​+1) is at most 100(n+1)2100(n+1)^2100(n+1)2.

These are the efficiency claims of Theorem 1.1: encryption and decryption run in time O(n2)O(n^2)O(n2) in the declared bit-cost model, using n−1n-1n−1 random bits, nnn basis preparations and O(n)O(n)O(n) single-qubit Clifford gates or measurements.

Formalization Note. The counts are of the concrete instruction lists encProgram k and decProgram k; the cost functions encBitCost and decBitCost are the mission's declared address-bit cost model, in which each wire address occupies n+1n+1n+1 bits.

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 resource_counts (n : ℕ) (hn : 1 ≤ n) (k : Key n) :
    (∃ j, pivot k = some j ∧ active k.val j = true ∧
      ∀ i : Fin n, i < j → active k.val i = false) ∧
    Fintype.card (Tape k) = 2^(n-1) ∧
    fairCount (encProgram k) = n-1 ∧ preparationCount (encProgram k) = n ∧
    gateCount (encProgram k) ≤ 2*n ∧ encBitCost k ≤ 100*(n+1)^2 ∧
    (decProgram k).length ≤ n ∧ decBitCost k ≤ 100*(n+1)^2 := by sorry

end PauliUnclonable531.Pauli
Source
Prabhanjan Ananth, Seyoon Ragavan, Amit Sahai, STOC 2027 submission #531 (October 2026) / arXiv:2607.21551v4, Theorem 1.1 (efficiency clause), p.3, and §3.1, pp.16–17

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