Theorem 2.1 — normalized Choi trace identity
ProvedPauliUnclonable531.Pauli.choi_identitycryptographyp2o-batch-stoc27ap2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-information
Let A be a nonzero finite input register and B,C arbitrary nonzero finite output registers. Let Φ:L(A)→L(B⊗C) be CPTP, and let M∈L(A), N∈L(B⊗C) be arbitrary operators. With τ=(id⊗Φ)(|Ω⟩⟨Ω|) for the normalized maximally entangled state, one has the complex trace identity
The transpose is ordinary transpose in the chosen matching reference basis. No Hermiticity or positivity is imposed on the test operators, and the output dimension is unrelated to the input dimension. This fixes the normalization used by the game reduction.
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_Choi open scoped Matrix Matrix.Norms.L2Operator ComplexOrder set_option autoImplicit false
Formal statement
namespace PauliUnclonable531.Pauli
/-- Theorem 2.1, pp.10–11. Ordinary transpose, normalized Choi, arbitrary test operators. -/
theorem choi_identity {A B C : Type} [Fintype A] [Fintype B] [Fintype C]
[DecidableEq A] [DecidableEq B] [DecidableEq C] [Nonempty A] [Nonempty B] [Nonempty C]
(Φ : Op A →ₗ[ℂ] Op (B × C)) (hΦ : WildeQIT.EntBreaking.IsQuantumChannel Φ)
(M : Op A) (N : Op (B × C)) :
(Fintype.card A : ℂ)⁻¹ * (N * Φ M).trace =
(Matrix.kronecker M.transpose N * choi Φ).trace := by sorry
end PauliUnclonable531.Pauli
Source
Prabhanjan Ananth, Seyoon Ragavan, Amit Sahai, STOC 2027 submission #531 (October 2026), Theorem 2.1, pp.10–11
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.