Theorem 1: postselection bound
OpenQAlgorithms.Papers.Independent.Support50.P22.postselectionLet have positive dimension , let , and set
Let , where is the Hilbert–Schmidt induced probability law obtained by reducing a Haar pure state on , with . Fix any normalized purification of this state before choosing the map. Let be complex-linear, with arbitrary finite nonzero output space . Suppose that for every tensor-factor permutation there is a CPTP output map such that . Then
The trace norm has no factor , and the diamond norm ranges over all complex matrices. This reduces the norm bound to a single fixed purified input.
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
/-- Theorem 1, PDF p.2; tensor convention in footnote 10 on p.4.
Delta remains arbitrary complex-linear, with arbitrary finite output.
The fixed test purification is quantified before Delta. The source's
state-maximization assertion for arbitrary maps is not used as a definition. -/
theorem postselection (n d : ℕ) (hd : 0 < d)
{R B : Type*} [Fintype R] [DecidableEq R] [Nonempty R]
[Fintype B] [DecidableEq B] [Nonempty B]
(psi : EuclideanSpace ℂ (Copies (Fin d) n × R)) (hpsi : FinitePurification psi (deFinettiState n d hd))
(Delta : Matrix (Copies (Fin d) n) (Copies (Fin d) n) ℂ →ₗ[ℂ] Matrix B B ℂ)
(hcov : ∀ pi : Equiv.Perm (Fin n), ∃ K : Superop B B, IsChannel K ∧
∀ X, Delta (permuteInput pi X) = K (Delta X)) :
diamond Delta ≤ (factor n d : ℝ) * traceNorm (tensorId Delta (pureDensity psi)) ∧
factor n d ≤ (n+1) ^ (d^2-1) := by sorry
end QAlgorithms.Papers.Independent.Support50.P22
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every with , let , and let be finite nonempty types with decidable equality. Define , where and is obtained by taking for a Haar-distributed unitary in dimension , reshaping this vector as using the standard finite-index bijection, and forming . Suppose satisfies and . Let be any complex-linear map from complex matrices on to complex matrices on . Assume that for every permutation of the positions there is a map on matrices on admitting a finite Kraus representation with , such that, for every matrix on , , where . Then, with ,
Here , with the square root defined by continuous functional calculus; the diamond quantity is exactly over all complex matrices on . The map applies separately to each matrix block with fixed row and column indices in . The statement includes and ; in either case .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.