Finite or locally compact group postselection
OpenQAlgorithms.Papers.Independent.Support50.P22.groupPostselectionLet be a finite group or a Hausdorff locally compact topological group, and let be a continuous unitary representation on a nonzero finite-dimensional complex space (finite groups carry the discrete topology). Give a coordinate copy the dual action . Define
Then and both technical results extend as follows. For any fixed normalized purification of and any complex-linear map , if for every there is a CPTP satisfying , then
Also, for any fixed normalized purification of and any density supported on the fixed vector space , there is an effect such that
This uses the invariant-space dimension in place of the permutation factor; no polynomial bound on is asserted.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P22
noncomputable section
open scoped Matrix ComplexConjugate ComplexOrder Matrix.Norms.L2Operator
open MeasureTheory
namespace QAlgorithms.Papers.Independent.Support50.P22
attribute [local instance] Classical.decEq Classical.propDecidable
open QAlgorithms.Papers.Independent.Gap48.P20 (Copies)
open QAlgorithms.Papers.Independent.Information100.P69 (diamond)
open QAlgorithms.Papers.Independent.Dependency50.P18 (ClassicalOutput)
attribute [local instance] QAlgorithms.Papers.Independent.Support50.P22.postselectionMatrixMeasurableSpace
attribute [local instance] QAlgorithms.Papers.Independent.Support50.P22.postselectionMatrixBorelSpace
/-- Group extension of BOTH technical results, PDF p.3 concluding remark and
p.4 footnote 17. Finite groups use their discrete topology; for locally
compact groups the finite-dimensional unitary representation is continuous.
The factor is the invariant-space dimension, with no polynomial claim. -/
theorem groupPostselection
(G : Type*) [Group G] [TopologicalSpace G] [IsTopologicalGroup G] [T2Space G]
(hG : Finite G ∨ LocallyCompactSpace G)
(v : ℕ) (hv : 0 < v) (U : G →* Matrix.unitaryGroup (Fin v) ℂ) (hU : Continuous U) :
let S := invariantSpace U
let m := Module.finrank ℂ S
0 < m ∧
(∀ (R B : Type*) [Fintype R] [DecidableEq R] [Nonempty R]
[Fintype B] [DecidableEq B] [Nonempty B],
∀ psi : EuclideanSpace ℂ (Fin v × R),
FinitePurification psi (traceRight (groupTau U)) →
∀ Delta : Matrix (Fin v) (Fin v) ℂ →ₗ[ℂ] Matrix B B ℂ,
(∀ g : G, ∃ K : Superop B B, IsChannel K ∧
∀ X, Delta (conjSuperop (U g : Matrix (Fin v) (Fin v) ℂ) X) = K (Delta X)) →
diamond Delta ≤ (m : ℝ) * traceNorm (tensorId Delta (pureDensity psi))) ∧
(∀ (N : Type*) [Fintype N] [DecidableEq N] [Nonempty N],
∀ psi : EuclideanSpace ℂ ((Fin v × Fin v) × N), FinitePurification psi (groupTau U) →
∀ rho : Matrix (Fin v × Fin v) (Fin v × Fin v) ℂ,
IsDensityMatrix rho → RangeSupported rho S →
∃ M : Matrix N N ℂ, IsEffect M ∧ rho = (m : ℂ) • postselect M (pureDensity psi)) := by sorry
end QAlgorithms.Papers.Independent.Support50.P22
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be a Hausdorff topological group, assume that is finite or locally compact, let satisfy , and let be a continuous group homomorphism. Write
where is the orthogonal projection onto , represented in the standard basis. Then , and the following two assertions hold. First, for every pair of finite nonempty types with decidable equality, every unit vector satisfying
and every complex linear map from matrices to matrices on , if for each there exists a channel on such that
then
Here a channel has a finite Kraus expression with ; no channel or positivity assumption is imposed on . The trace quantity is , the tensor extension applies to each fixed reference block, and is the supremum of over all complex matrices on with , without restricting to states or Hermitian matrices. Second, for every finite nonempty type with decidable equality, every unit vector satisfying , and every positive semidefinite trace-one matrix on whose range lies in , there exists a matrix on such that and are positive semidefinite and
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.