§3.1 — sequential local Pauli measurements implement decryption
ProvedPauliUnclonable531.Pauli.decryption_executionFix a nonidentity Pauli key on qubits. The §3.1 decryption procedure measures, one after another, each nonidentity position of in the eigenbasis of the local Pauli , i.e. it applies the projective instrument to the current unnormalized post-measurement state, and outputs the parity of the observed outcome bits.
For every operator on the -qubit space (in particular every density operator, including entangled ones) and every output bit , the Born probability that this sequential procedure outputs equals the probability of outcome of the global two-outcome measurement :
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 . The statement is proved for every complex matrix ; 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
import Mathlib import Definitions.Def_PauliUnclonable531_Pauli_Ensemble open scoped Matrix Matrix.Norms.L2Operator ComplexOrder set_option autoImplicit false
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