§3.1.4 / Eq.(23): forgetting heralding
ProvedQAlgorithms.Papers.Independent.Extend50.P06.forgetting_heraldAll registers have specified computational bases and positive finite dimensions. An unknown operation is the channel of , with identical black-box uses. Every process, probe, measurement and guess is fixed independently of . The unnormalized input-first Choi operator is , where . For a target of dimension , write and , for probability Haar measure. Parallel, sequential and general processes mean Definitions 2–4, with arbitrary finite memory. Write for the greatest attained average fidelity in class ; any displayed optimum includes attainment.
Let be Borel-measurable. Let be positive semidefinite branches whose sum is a deterministic process in a specified class. Suppose a fixed satisfies for every . Then the explicitly constructed process lies in that class and satisfies
Forgetting the herald produces a deterministic approximation; the source's phrase deterministic exact is a typo.
import Definitions.Def_QAlgorithms_Papers_Independent_Extend50_P06
namespace QAlgorithms.Papers.Independent.Extend50.P06
open scoped BigOperators ComplexConjugate Matrix ComplexOrder
open MeasureTheory
noncomputable section
attribute [local instance] Classical.propDecidable
-- Exact accepted interfaces; no duplicate SU subtype or ambient-coordinate Haar law.
open QAlgorithms.Papers.Independent.Information100.P47 (Mat)
open QAlgorithms.Papers.Independent.Claimed50.P21 (SU HaarLaw)
open QAlgorithms.Papers.Independent.Dependency50.P05 (ChannelChoi)
attribute [local instance] QAlgorithms.Papers.Independent.Extend50.P06.targetMatrixMeasurable
/-- PDF p.13, Eq.(23): forgetting the herald gives S=Ss+Sf. Printed
“deterministic exact” is changed to deterministic non-exact, consistent with
the section heading and the displayed inequality; only Ss is exact. -/
theorem forgetting_herald (d e k : ℕ) (hd : 0 < d) (he : 0 < e) (hk : 1 ≤ k)
(H : HaarLaw d) (f : Target d e) (c : StrategyClass)
(Ss Sf : TransformationProcess k d e) (ps : ℝ) (hps : 0 ≤ ps ∧ ps ≤ 1)
(hs : Ss.PosSemidef) (hf : Sf.PosSemidef) (hdet : TransformationAdmissible c (Ss+Sf))
(hexact : ∀ U : SU d, insertSlots Ss (unitarySlots U.val) = (ps : ℂ) • transformationChoi (f.value U)) :
TransformationAdmissible c (Ss+Sf) ∧
transformationAverage H f.value (Ss+Sf) = ps +
(∫ U, pointFidelity Sf f.value U ∂H.law) ∧
ps ≤ transformationAverage H f.value (Ss+Sf) := by sorry
end
end QAlgorithms.Papers.Independent.Extend50.P06
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For natural numbers with , , and , let be a probability measure on invariant under left and right multiplication, and let be continuous and take values in . Put , , and define
Write and . For selected coordinate wires , define to be zero when disagree on , and otherwise . With the first and last wires and all query input and output wires, parallel admissibility means positivity, trace , , and . Sequential admissibility means positivity, the same trace and latter equality, and for every , where . General admissibility means positivity and that insertion of every family of positive semidefinite slot matrices with output partial trace equal to the identity yields a positive semidefinite matrix with output partial trace equal to the identity. Choose any of these classes , positive semidefinite process matrices , and , and assume is admissible in class and
Then is admissible in class , and
The endpoints and dimensions or are included. No product-preserving or product-reversing assumption on , and no separate admissibility assumption on or , is imposed.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.