Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

§III C, Eqs.(30)–(31): two-dimensional example and information gap

Open
QAlgorithms.Papers.Independent.Intakethird100.P67.two_sample_gap

by Gohan · Nov 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let two unit sample vectors have overlap magnitude cos⁡(θ/2)\cos(\theta/2)cos(θ/2) with 0<θ<π0<\theta<\pi0<θ<π. They span a two-dimensional input space. With the first sample as anchor, put P=∣ϕ1⟩⟨ϕ1∣P=\lvert\phi_1\rangle\langle\phi_1\rvertP=∣ϕ1​⟩⟨ϕ1​∣ and Q=Πin−PQ=\Pi_{\rm in}-PQ=Πin​−P. Then

λ⊥=cos⁡2θ,D⊥(X)=cos⁡2θ QXQ,F(EU(ρ),UρU†)≥1−(cos⁡θ)2T.\lambda_\perp=\cos^2\theta,\qquad \mathcal D_\perp(X)=\cos^2\theta\,QXQ,\qquad F(\mathcal E_U(\rho),U\rho U^\dagger)\ge1-(\cos\theta)^{2T}.λ⊥​=cos2θ,D⊥​(X)=cos2θQXQ,F(EU​(ρ),UρU†)≥1−(cosθ)2T.

The fidelity bound holds for every supported density operator, target unitary and T≥0T\ge0T≥0. For U(α)=exp⁡(iαP)U(\alpha)=\exp(i\alpha P)U(α)=exp(iαP), 0≤α<2π0\le\alpha<2\pi0≤α<2π, the pure output family from the second sample has quantum Fisher information

Iα=4(⟨P2⟩ϕ2−⟨P⟩ϕ22)=1−λ⊥.I_\alpha=4\bigl(\langle P^2\rangle_{\phi_2}-\langle P\rangle_{\phi_2}^2\bigr)=1-\lambda_\perp.Iα​=4(⟨P2⟩ϕ2​​−⟨P⟩ϕ2​2​)=1−λ⊥​.

The identity links distinguishability to convergence. The identical-sample endpoint is not assigned dimension two.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P67
Formal statement
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
Source
Universal Quantum Emulator, arXiv:1606.02734v2, PDF p. 7, §III C, Eqs.(30)–(31): two-dimensional example and information gap
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

Let III be a finite index type with decidable equality, let ϕ0,ϕ1∈CI\phi_0,\phi_1\in\mathbb C^Iϕ0​,ϕ1​∈CI both have norm 111, and let 0<θ<π0<\theta<\pi0<θ<π satisfy ∣⟨ϕ0,ϕ1⟩∣=cos⁡(θ/2)|\langle\phi_0,\phi_1\rangle|=\cos(\theta/2)∣⟨ϕ0​,ϕ1​⟩∣=cos(θ/2). Put Pk=ϕkϕk†P_k=\phi_k\phi_k^\daggerPk​=ϕk​ϕk†​, let Π\PiΠ be the functional-calculus value of x↦1x≠0x\mapsto\mathbf1_{x\ne0}x↦1x=0​ on P0+P1P_0+P_1P0​+P1​, and set Q=Π−P0Q=\Pi-P_0Q=Π−P0​, Rk=1−2PkR_k=1-2P_kRk​=1−2Pk​, and Ck=QRkQC_k=QR_kQCk​=QRk​Q. The compressed-reflection map is C(X)=C1XC1\mathcal C(X)=C_1XC_1C(X)=C1​XC1​, and the parameter in the statement is λ=∥C1⊗C1‾∥op\lambda=\|C_1\otimes\overline{C_1}\|_{\mathrm{op}}λ=∥C1​⊗C1​​∥op​, with Euclidean operator norm and entrywise conjugation. Define C(V)=1I⊗∣0⟩⟨0∣+V⊗∣1⟩⟨1∣C(V)=1_I\otimes|0\rangle\langle0|+V\otimes|1\rangle\langle1|C(V)=1I​⊗∣0⟩⟨0∣+V⊗∣1⟩⟨1∣, H=2−1/2(111−1)H=2^{-1/2}\begin{pmatrix}1&1\\1&-1\end{pmatrix}H=2−1/2(11​1−1​), and E=C(R1)(1I⊗H)C(R0)E=C(R_1)(1_I\otimes H)C(R_0)E=C(R1​)(1I​⊗H)C(R0​). For T≥0T\ge0T≥0, let VT=E(T−1)⋯E(0)V_T=E^{(T-1)}\cdots E^{(0)}VT​=E(T−1)⋯E(0), where the factors act on distinct ancilla qubits, let VU,TV_{U,T}VU,T​ use (U⊗12)E(U†⊗12)(U\otimes1_2)E(U^\dagger\otimes1_2)(U⊗12​)E(U†⊗12​) in place of EEE, put ηT=((∣0⟩−∣1⟩)/2)⊗T\eta_T=((|0\rangle-|1\rangle)/\sqrt2)^{\otimes T}ηT​=((∣0⟩−∣1⟩)/2​)⊗T, and set XT=VT(ρ⊗ηTηT†)VT†X_T=V_T(\rho\otimes\eta_T\eta_T^\dagger)V_T^\daggerXT​=VT​(ρ⊗ηT​ηT†​)VT†​. With Pfalse=P0P_{\mathrm{false}}=P_0Pfalse​=P0​ and Ptrue=1−P0P_{\mathrm{true}}=1-P_0Ptrue​=1−P0​, define

EUT(ρ)=Tr⁡anc∑bVU,T†[UP0U†⊗Tr⁡I ⁣((Pb⊗1)XT(Pb⊗1))]VU,T.\mathcal E_U^T(\rho)= \operatorname{Tr}_{\mathrm{anc}} \sum_bV_{U,T}^\dagger \left[ UP_0U^\dagger\otimes \operatorname{Tr}_{I}\!\left((P_b\otimes1)X_T(P_b\otimes1)\right) \right]V_{U,T}.EUT​(ρ)=Tranc​b∑​VU,T†​[UP0​U†⊗TrI​((Pb​⊗1)XT​(Pb​⊗1))]VU,T​.

This is the stated emulator: its history weights assign probability 000 to sample 000 and probability 111 to sample 111; empty products are identities. The conclusions are λ=cos⁡2θ\lambda=\cos^2\thetaλ=cos2θ and, for every complex matrix XXX, C(X)=cos⁡2θ QXQ\mathcal C(X)=\cos^2\theta\,QXQC(X)=cos2θQXQ; moreover, for every unitary UUU, every positive semidefinite ρ\rhoρ of trace 111 satisfying ΠρΠ=ρ\Pi\rho\Pi=\rhoΠρΠ=ρ, and every natural number TTT, including T=0T=0T=0,

1−cos⁡2Tθ≤Re⁡tr⁡EUT(ρ) UρU†EUT(ρ).1-\cos^{2T}\theta \le \operatorname{Re}\operatorname{tr} \sqrt{\sqrt{\mathcal E_U^T(\rho)}\,U\rho U^\dagger \sqrt{\mathcal E_U^T(\rho)}}.1−cos2Tθ≤RetrEUT​(ρ)​UρU†EUT​(ρ)​​.

Finally, for every 0≤α<2π0\le\alpha<2\pi0≤α<2π, the vector-valued function v(t)=eitP0ϕ1v(t)=e^{itP_0}\phi_1v(t)=eitP0​ϕ1​ is differentiable at α\alphaα, and, writing

Var⁡=Re⁡⟨ϕ1,P02ϕ1⟩−(Re⁡⟨ϕ1,P0ϕ1⟩)2,\operatorname{Var} =\operatorname{Re}\langle\phi_1,P_0^2\phi_1\rangle -\bigl(\operatorname{Re}\langle\phi_1,P_0\phi_1\rangle\bigr)^2,Var=Re⟨ϕ1​,P02​ϕ1​⟩−(Re⟨ϕ1​,P0​ϕ1​⟩)2,

one has

4 ⁣(∥v′(α)∥2−∣⟨v(α),v′(α)⟩∣2)=4Var⁡=1−λ.4\!\left(\|v'(\alpha)\|^2- |\langle v(\alpha),v'(\alpha)\rangle|^2\right) =4\operatorname{Var} =1-\lambda.4(∥v′(α)∥2−∣⟨v(α),v′(α)⟩∣2)=4Var=1−λ.
Human review
  • Endorsed by Shuze Chen · Nov 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Nov 1, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me