§III C, Eqs.(30)–(31): two-dimensional example and information gap
OpenQAlgorithms.Papers.Independent.Intakethird100.P67.two_sample_gapLet two unit sample vectors have overlap magnitude with . They span a two-dimensional input space. With the first sample as anchor, put and . Then
The fidelity bound holds for every supported density operator, target unitary and . For , , the pure output family from the second sample has quantum Fisher information
The identity links distinguishability to convergence. The identical-sample endpoint is not assigned dimension two.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P67
noncomputable section
open scoped ComplexConjugate Matrix Matrix.Norms.L2Operator
attribute [local instance] Classical.propDecidable
open MeasureTheory Filter
namespace QAlgorithms.Papers.Independent.Intakethird100.P67
variable {I J K L A : Type*} [Fintype I] [DecidableEq I]
[Fintype J] [DecidableEq J] [Fintype K] [DecidableEq K]
[Fintype L] [DecidableEq L] [Fintype A] [DecidableEq A]
/-- PDF pp.7–8, Eqs.(30)–(31): two-dimensional fidelity, compressed channel, and
quantum Fisher information (four times generator variance). The dimension-two promise
is made only for the strict interior overlap regime. -/
theorem two_sample_gap (phi : Fin 2 → EuclideanSpace ℂ I) (hphi : ∀ k, IsState (phi k))
(theta : ℝ) (htheta : 0 < theta ∧ theta < Real.pi)
(hoverlap : ‖inner ℂ (phi 0) (phi 1)‖ = Real.cos (theta / 2)) :
lambdaPerp phi 0 = Real.cos theta ^ 2 ∧
(∀ X : Matrix I I ℂ, let Q := samplePi (pureSamples phi) - pureDensity (phi 0)
compressedReflectionChannel phi 0 X = (Real.cos theta ^ 2 : ℂ) • (Q * X * Q)) ∧
(∀ (U : Matrix.unitaryGroup I ℂ) (rho : Matrix I I ℂ), IsDensityMatrix rho →
InSampleSupport (pureSamples phi) rho → ∀ T : ℕ,
1 - Real.cos theta ^ (2 * T) ≤
rootFidelity (emulate phi 0 (U : Matrix I I ℂ) T rho) (densityConjugation (U : Matrix I I ℂ) rho)) ∧
(∀ alpha : ℝ, 0 ≤ alpha → alpha < 2 * Real.pi →
let family := fun t : ℝ => act (positivePhaseEvolution (pureDensity (phi 0)) t) (phi 1)
let variance := (inner ℂ (phi 1) (act (pureDensity (phi 0) * pureDensity (phi 0)) (phi 1))).re -
((inner ℂ (phi 1) (act (pureDensity (phi 0)) (phi 1))).re) ^ 2
DifferentiableAt ℝ family alpha ∧
pureFisherInformation family alpha = 4 * variance ∧ 4 * variance = 1 - lambdaPerp phi 0) := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P67
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be a finite index type with decidable equality, let both have norm , and let satisfy . Put , let be the functional-calculus value of on , and set , , and . The compressed-reflection map is , and the parameter in the statement is , with Euclidean operator norm and entrywise conjugation. Define , , and . For , let , where the factors act on distinct ancilla qubits, let use in place of , put , and set . With and , define
This is the stated emulator: its history weights assign probability to sample and probability to sample ; empty products are identities. The conclusions are and, for every complex matrix , ; moreover, for every unitary , every positive semidefinite of trace satisfying , and every natural number , including ,
Finally, for every , the vector-valued function is differentiable at , and, writing
one has
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.