§3.1 — the encryption instructions realize the parity ensemble
ProvedPauliUnclonable531.Pauli.encryption_executionFix , a nonidentity Pauli key and a message bit . The §3.1 encryption procedure first scans the key for its pivot (the least position with ), then draws a fair bit for every position , sets , prepares from by applying on the wires with , and finally applies on every wire with , followed by when also .
Let be the state output by this procedure averaged over the equally likely random tapes (all actual gate matrices are used, each acting on its wire of the possibly entangled -qubit register). Then
where exactly at the nonidentity positions of and with if , if , if .
Together with Proposition 3.2 (the right-hand side equals the ciphertext ), this shows that the explicit instruction list of §3.1 prepares exactly the ciphertext of the scheme.
Formalization Note. The procedure is the instruction list encProgram k, executed by executeEnc on a tape Tape k (bit strings vanishing at the pivot); operationalEnc averages over all tapes with uniform weight.
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
import Mathlib import Definitions.Def_PauliUnclonable531_Pauli_Ensemble open scoped Matrix Matrix.Norms.L2Operator ComplexOrder set_option autoImplicit false
namespace PauliUnclonable531.Pauli
theorem encryption_execution (n : ℕ) (hn : 1 ≤ n) (k : Key n) (m : Fin 2) :
operationalEnc k m = parityEnsemble k m := by sorry
end PauliUnclonable531.Pauli