Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Appendix G2, Eq.(G2): bridge samples enable controlled emulation

Open
QAlgorithms.Papers.Independent.Intakethird100.P67.controlled_with_bridge

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

prove2quantum

Let a finite nonempty mixed sample family generate all operators on HinH_{\rm in}Hin​. Take a unit vector ϕ∈Hin\phi\in H_{\rm in}ϕ∈Hin​ and normalized control amplitudes α,β\alpha,\betaα,β with both nonzero. In addition to tagged original samples, supply the pure bridge ∣Φin⟩=∣ϕ⟩(α∣0⟩+β∣1⟩)|\Phi_{\rm in}\rangle=|\phi\rangle(\alpha|0\rangle+\beta|1\rangle)∣Φin​⟩=∣ϕ⟩(α∣0⟩+β∣1⟩) and its exact output ∣Φout⟩=Uc∣Φin⟩|\Phi_{\rm out}\rangle=U^c|\Phi_{\rm in}\rangle∣Φout​⟩=Uc∣Φin​⟩. The augmented input family satisfies

Alg⁡C ⁣({ρk⊗∣b⟩⟨b∣:b=0,1}∪{∣Φin⟩⟨Φin∣})=L(Hin⊗C2).\operatorname{Alg}_{\mathbb C}\!\left(\{\rho_k\otimes|b\rangle\langle b|:b=0,1\}\cup\{|\Phi_{\rm in}\rangle\langle\Phi_{\rm in}|\}\right)=\mathcal L(H_{\rm in}\otimes\mathbb C^2).AlgC​({ρk​⊗∣b⟩⟨b∣:b=0,1}∪{∣Φin​⟩⟨Φin​∣})=L(Hin​⊗C2).

The actual mixed-sample emulator with this pure anchor consequently converges uniformly to controlled conjugation on supported input density operators. The bridge output supplies the relative phase; that phase is not inferred from the original density records.

The tagged output resources are ρkin⊗∣0⟩⟨0∣\rho_k^{\rm in}\otimes|0\rangle\langle0|ρkin​⊗∣0⟩⟨0∣ and ρkout⊗∣1⟩⟨1∣\rho_k^{\rm out}\otimes|1\rangle\langle1|ρkout​⊗∣1⟩⟨1∣, together with the output bridge; controlled UUU leaves the zero-control branch unchanged.

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 p.28, G2: nonzero control amplitudes in an additional pure bridge generate
the full systemControlled-space algebra and enable emulation by the actual mixed-sample channel.
Printed: the final output-record list uses both control projectors tensor S_out.
Changed: the constructed target-conjugated records use S_in on control zero and
S_out on control one, plus the given output bridge. Why: the defined controlled-U
acts as identity on control zero; these records are available from the given resources. -/
theorem controlled_with_bridge [Nonempty K] (S : K → Matrix I I ℂ)
    (hS : ∀ k, IsDensityMatrix (S k)) (hgen : Generates S)
    (phi : EuclideanSpace ℂ I) (hphi : IsState phi)
    (hsupport : InSampleSupport S (pureDensity phi)) (alpha beta : ℂ)
    (hnorm : ‖alpha‖ ^ 2 + ‖beta‖ ^ 2 = 1) (halpha : alpha ≠ 0) (hbeta : beta ≠ 0) :
    let B := bridgeSamples S phi alpha beta
    let bridge := tensorVec phi (WithLp.toLp 2 fun b => if b then beta else alpha)
    Generates B ∧ ∀ (U : Matrix.unitaryGroup I ℂ) (eps : ℝ), 0 < eps →
      ∃ N : ℕ, ∀ T ≥ N, ∀ rho : Matrix (I × Bool) (I × Bool) ℂ, IsDensityMatrix rho → InSampleSupport B rho →
        traceDistance (mixedEmulate B none bridge (systemControlled (U : Matrix I I ℂ)) T rho)
          (densityConjugation (systemControlled (U : Matrix I I ℂ)) rho) ≤ eps := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P67

end
Source
Universal Quantum Emulator, arXiv:1606.02734v2, PDF p. 28, Appendix G2, Eq.(G2): bridge samples enable controlled emulation
Read-back

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

Let I,KI,KI,K be finite index types with decidable equality, with KKK nonempty. Let every SkS_kSk​ be positive semidefinite of trace 111, let ΠS\Pi_SΠS​ be the functional-calculus value of x↦1x≠0x\mapsto\mathbf1_{x\ne0}x↦1x=0​ on ∑kSk\sum_kS_k∑k​Sk​, and assume that the complex span of all nonempty products of the SkS_kSk​ equals {X:ΠSXΠS=X}\{X:\Pi_SX\Pi_S=X\}{X:ΠS​XΠS​=X}. Let ϕ∈CI\phi\in\mathbb C^Iϕ∈CI have norm 111 and satisfy ΠSϕϕ†ΠS=ϕϕ†\Pi_S\phi\phi^\dagger\Pi_S=\phi\phi^\daggerΠS​ϕϕ†ΠS​=ϕϕ†, and let α,β∈C\alpha,\beta\in\mathbb Cα,β∈C satisfy ∣α∣2+∣β∣2=1|\alpha|^2+|\beta|^2=1∣α∣2+∣β∣2=1, α≠0\alpha\ne0α=0, and β≠0\beta\ne0β=0. On H=CI⊗C2\mathcal H=\mathbb C^I\otimes\mathbb C^2H=CI⊗C2, put ξ=ϕ⊗(α∣0⟩+β∣1⟩)\xi=\phi\otimes(\alpha|0\rangle+\beta|1\rangle)ξ=ϕ⊗(α∣0⟩+β∣1⟩), and define the family indexed by Λ={none}⊔({false,true}×K)\Lambda=\{\mathrm{none}\}\sqcup(\{\mathrm{false},\mathrm{true}\}\times K)Λ={none}⊔({false,true}×K) by

Bnone=ξξ†,B(b,k)=Sk⊗∣b⟩⟨b∣.B_{\mathrm{none}}=\xi\xi^\dagger, \qquad B_{(b,k)}=S_k\otimes|b\rangle\langle b|.Bnone​=ξξ†,B(b,k)​=Sk​⊗∣b⟩⟨b∣.

Let ΠB\Pi_BΠB​ be the functional-calculus value of x↦1x≠0x\mapsto\mathbf1_{x\ne0}x↦1x=0​ on ∑ℓ∈ΛBℓ\sum_{\ell\in\Lambda}B_\ell∑ℓ∈Λ​Bℓ​. The assertion is that the complex span of all nonempty products of the BℓB_\ellBℓ​ equals {X:ΠBXΠB=X}\{X:\Pi_BX\Pi_B=X\}{X:ΠB​XΠB​=X}, and that the following approximation holds. For a unitary UUU on CI\mathbb C^ICI, put Z=1I⊗∣0⟩⟨0∣+U⊗∣1⟩⟨1∣Z=1_I\otimes|0\rangle\langle0|+U\otimes|1\rangle\langle1|Z=1I​⊗∣0⟩⟨0∣+U⊗∣1⟩⟨1∣. For operators on H\mathcal HH, define CH(V)=1H⊗∣0⟩⟨0∣+V⊗∣1⟩⟨1∣C_{\mathcal H}(V)=1_{\mathcal H}\otimes|0\rangle\langle0|+V\otimes|1\rangle\langle1|CH​(V)=1H​⊗∣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ℓ(s)=CH(e−isBℓ)(1H⊗H)CH(e−iπBnone).E_\ell(s)=C_{\mathcal H}(e^{-isB_\ell})(1_{\mathcal H}\otimes H) C_{\mathcal H}(e^{-i\pi B_{\mathrm{none}}}).Eℓ​(s)=CH​(e−isBℓ​)(1H​⊗H)CH​(e−iπBnone​).

For h∈ΛTh\in\Lambda^Th∈ΛT and s∈[0,1]Ts\in[0,1]^Ts∈[0,1]T, let Vh,sV_{h,s}Vh,s​ apply Ehj(sj)E_{h_j}(s_j)Ehj​​(sj​) successively on H\mathcal HH and ancilla jjj, let ηT=((∣0⟩−∣1⟩)/2)⊗T\eta_T=((|0\rangle-|1\rangle)/\sqrt2)^{\otimes T}ηT​=((∣0⟩−∣1⟩)/2​)⊗T, set Xh,s=Vh,s(ρ⊗ηTηT†)Vh,s†X_{h,s}=V_{h,s}(\rho\otimes\eta_T\eta_T^\dagger)V_{h,s}^\daggerXh,s​=Vh,s​(ρ⊗ηT​ηT†​)Vh,s†​, and set V^h,s=(Z⊗1)Vh,s(Z†⊗1)\widehat V_{h,s}=(Z\otimes1)V_{h,s}(Z^\dagger\otimes1)Vh,s​=(Z⊗1)Vh,s​(Z†⊗1). Define the matrix map

MZ,T(ρ)=1∣Λ∣T∑h∈ΛT∫[0,1]TTr⁡anc ⁣[V^h,s†(Zξξ†Z†⊗Tr⁡HXh,s)V^h,s]ds,\mathcal M_{Z,T}(\rho)= \frac1{|\Lambda|^T}\sum_{h\in\Lambda^T}\int_{[0,1]^T} \operatorname{Tr}_{\mathrm{anc}}\!\left[ \widehat V_{h,s}^\dagger \left(Z\xi\xi^\dagger Z^\dagger\otimes\operatorname{Tr}_{\mathcal H}X_{h,s}\right) \widehat V_{h,s} \right]ds,MZ,T​(ρ)=∣Λ∣T1​h∈ΛT∑​∫[0,1]T​Tranc​[Vh,s†​(Zξξ†Z†⊗TrH​Xh,s​)Vh,s​]ds,

with entrywise Lebesgue integration and empty products interpreted as identities. For every such UUU and every real ε>0\varepsilon>0ε>0, there exists a natural number NNN such that, for every T≥NT\ge NT≥N and every positive semidefinite matrix ρ\rhoρ on H\mathcal HH of trace 111 satisfying ΠBρΠB=ρ\Pi_B\rho\Pi_B=\rhoΠB​ρΠB​=ρ,

12Re⁡tr⁡(MZ,T(ρ)−ZρZ†)†(MZ,T(ρ)−ZρZ†)≤ε.\tfrac12\operatorname{Re}\operatorname{tr} \sqrt{(\mathcal M_{Z,T}(\rho)-Z\rho Z^\dagger)^\dagger (\mathcal M_{Z,T}(\rho)-Z\rho Z^\dagger)} \le\varepsilon.21​Retr(MZ,T​(ρ)−ZρZ†)†(MZ,T​(ρ)−ZρZ†)​≤ε.

The averaging family has 1+2∣K∣1+2|K|1+2∣K∣ indices and includes the anchor index none\mathrm{none}none.

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