Lemma 13.10 — vector polarization
ProvedQSampVerif.lemma_13_10cryptographyp2o-gran-per-chapterp2o-plan-bookp2o-v1quantum-informationverification-of-quantum-computation
Let be vectors in a finite-dimensional complex inner-product space with , and let for . Then
and for every .
This writes a cross term as a combination of four positive rank-one operators built from vectors of norm at most one, which is how the soundness bound for positive inputs is extended to cross terms (Lemma 13.12).
Differences from the source:
- encoding: |a⟩⟨b|; 𝒵 → the matrix vecMulVec a (conj b); z ranging over i^k, k ∈ Fin 4; reason: same objects
Preamble
import Definitions.Def_QSampVerif_zPhase set_option autoImplicit false
Formal statement
namespace QSampVerif
/-- Chung, Cojocaru, Lee, Lin, STOC 2027 submission (held version, sha256 dbc19d8f…7ee7),
Lemma 13.10 (Vector polarization), (476), p.178 (PDF 179).
For vectors `a, b` with `‖a‖, ‖b‖ ≤ 1` and `u_z = (a + z b)/2`,
`|a⟩⟨b| = Σ_{z ∈ Z} z |u_z⟩⟨u_z|`, and `‖u_z‖ ≤ 1` for every `z ∈ Z = {1, i, −1, −i}`.
**Formalization Note.** `|a⟩⟨b|` is the matrix `vecMulVec a (star b)`; `Z` is enumerated as
`zPhase k = i^k`. -/
theorem lemma_13_10 {ι : Type*} [Fintype ι] (a b : EuclideanSpace ℂ ι) (ha : ‖a‖ ≤ 1)
(hb : ‖b‖ ≤ 1) :
Matrix.vecMulVec (WithLp.ofLp a) (star (WithLp.ofLp b)) =
∑ k : Fin 4, zPhase k • Matrix.vecMulVec (WithLp.ofLp ((2⁻¹ : ℂ) • (a + zPhase k • b)))
(star (WithLp.ofLp ((2⁻¹ : ℂ) • (a + zPhase k • b)))) ∧
∀ k : Fin 4, ‖(2⁻¹ : ℂ) • (a + zPhase k • b)‖ ≤ 1 := by sorry
end QSampVerif
Source
Chung, Cojocaru, Lee, Lin, Classical Verification of Quantum Sampling with Negligible Error, STOC 2027 submission (held version, sha256 dbc19d8f…7ee7), Lemma 13.10, (476), p.178 (PDF 179)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.