Tensor powers retain the private-state structure with constructed data
ProvedQAlgorithms.Papers.Independent.Gap48.P42.private_tensor_closureLet be positive integers, let be a positive semidefinite trace-one shield state on , and let each be a unitary on that joint shield. Write
with the bipartition and local shield dimensions . All logarithms and resource rates are in bits.
For every positive integer , use the same fixed bijection between key tuples and labels in on both owners. Construct and . Then is a density operator, each is unitary, and after regrouping all key and shield registers within each owner,
Thus the resulting state has private key dimension with the computed shield and twists. This structural identity supplies the tensor-power input to the cost bound.
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P42
namespace QAlgorithms.Papers.Independent.Gap48.P42
open scoped BigOperators Matrix ComplexConjugate ComplexOrder ENNReal
noncomputable section
attribute [local instance] Classical.propDecidable Classical.decEq
/-- PDF p.4, observation immediately before Property 1a: the actual regrouped
m-copy matrix is private with computed shield rho^tensor m and tensor twists.
The conclusion certifies normalization and both unitary identities of those
computed twists; no unrelated private target is existentially introduced. -/
theorem private_tensor_closure {d a b : ℕ}
(hd : 0 < d) (ha : 0 < a) (hb : 0 < b)
(rho : Matrix (Fin a × Fin b) (Fin a × Fin b) ℂ) (hrho : IsDensityMatrix rho)
(U : Fin d → Matrix.unitaryGroup (Fin a × Fin b) ℂ) (m : ℕ) (hm : 0 < m) :
IsDensityMatrix (Dependency50.P42.dimensionedPower rho m) ∧
(∀ key, (tensorTwists U m key)ᴴ * tensorTwists U m key = 1 ∧
tensorTwists U m key * (tensorTwists U m key)ᴴ = 1) ∧
(fun x y : Fin (d ^ m * a ^ m) × Fin (d ^ m * b ^ m) =>
Dependency50.P42.dimensionedPower (bipartitePrivate rho U) m
(regroupIndex d a m x.1, regroupIndex d b m x.2)
(regroupIndex d a m y.1, regroupIndex d b m y.2)) =
bipartitePrivateRaw (Dependency50.P42.dimensionedPower rho m) (tensorTwists U m) := by sorry
end
end QAlgorithms.Papers.Independent.Gap48.P42
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be positive natural numbers, let be a positive semidefinite trace-one matrix on , and let be unitaries on that space for . For each natural , write for the fixed cardinality bijection, and write for the fixed local-index bijection. Define the grouped tensor power by . Define by its key blocks when and , and zero otherwise. For each , define on by . Define by splitting as and setting , and define in the same way. Then is positive semidefinite of trace , every satisfies both and , and the matrix obtained from by applying and to its two local row indices and likewise to its column indices equals the following matrix: after splitting each local index using or , its block between matching row keys and matching column keys is , and every other key block is zero. The conclusion is equality of the entire matrices. The cases , , or are included, while is excluded.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.