Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§4.1, p. 25 — ρ ⊗ |0⟩⟨0|^{⊗a} = (I ⊗ |0⟩^{⊗a})ρ(I ⊗ ⟨0|^{⊗a}), so the acceptance probability is Tr(Kρ)

Proved
QuantumSDP18.MeasureBE.trace_identity

by mikedeng1 · Oct 15, 2026 · Mathlib 0df444a (Lean v4.33.1)

block-encodingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-informationtrace

Let ρ\rhoρ be any operator on the system register, attach aaa ancilla qubits, and let UUU be any operator on system and ancillas. Then attaching the ancillas in ∣0⟩|0\rangle∣0⟩ is conjugation by the isometry I⊗∣0⟩⊗aI\otimes|0\rangle^{\otimes a}I⊗∣0⟩⊗a,

ρ⊗∣0⟩⟨0∣⊗a=(I⊗∣0⟩⊗a) ρ (I⊗⟨0∣⊗a),\rho\otimes|0\rangle\langle 0|^{\otimes a} = (I\otimes|0\rangle^{\otimes a})\,\rho\,(I\otimes\langle 0|^{\otimes a}),ρ⊗∣0⟩⟨0∣⊗a=(I⊗∣0⟩⊗a)ρ(I⊗⟨0∣⊗a),

and consequently the acceptance probability of the procedure equals the trace of ρ\rhoρ against the block KKK:

Tr⁡((I⊗∣0⟩⟨0∣) U(ρ⊗∣0⟩⟨0∣⊗a)U†)=Tr⁡((I⊗⟨0∣⊗a)U†(I⊗∣0⟩⟨0∣)U(I⊗∣0⟩⊗a)ρ).\operatorname{Tr}\Big((I\otimes|0\rangle\langle 0|)\,U\big(\rho\otimes|0\rangle\langle 0|^{\otimes a}\big)U^\dagger\Big) = \operatorname{Tr}\Big(\big(I\otimes\langle 0|^{\otimes a}\big)U^\dagger(I\otimes|0\rangle\langle 0|)U\big(I\otimes|0\rangle^{\otimes a}\big)\rho\Big).Tr((I⊗∣0⟩⟨0∣)U(ρ⊗∣0⟩⟨0∣⊗a)U†)=Tr((I⊗⟨0∣⊗a)U†(I⊗∣0⟩⟨0∣)U(I⊗∣0⟩⊗a)ρ).

This rewrites the bias condition (14) as a condition on the single operator K−MK - MK−M.

Formalization Note No hypothesis on ρ\rhoρ or UUU is needed; both identities hold for arbitrary matrices.

Preamble
import Mathlib
import Definitions.Def_QAlgorithms_Defs_BlockEncoding
import Definitions.Def_QuantumSDP18_MeasureBE_Setting
Formal statement
namespace QuantumSDP18.MeasureBE

/-- §4.1, p. 25: `ρ ⊗ |0⟩⟨0|^{⊗a} = (I ⊗ |0⟩^{⊗a}) ρ (I ⊗ ⟨0|^{⊗a})`, and thus
`Tr((I ⊗ |0⟩⟨0|) U (ρ ⊗ |0⟩⟨0|^{⊗a}) U†) = Tr((I ⊗ ⟨0|^{⊗a}) U† (I ⊗ |0⟩⟨0|) U (I ⊗ |0⟩^{⊗a}) ρ)`. -/
theorem trace_identity {ι : Type*} [Fintype ι] [DecidableEq ι] (c : ℕ)
    (U : Matrix (ι × Anc c) (ι × Anc c) ℂ) (ρ : Matrix ι ι ℂ) :
    embedZero c ρ = ketZero (ι := ι) c * ρ * (ketZero (ι := ι) c).conjTranspose ∧
      accProb c U ρ = (blockK c U * ρ).trace := by sorry

end QuantumSDP18.MeasureBE
Source
van Apeldoorn and Gilyén, Improvements in quantum SDP-solving with applications, arXiv:1804.05058v1, p. 25, §4.1, 'Observe that …' and the display that follows
Human review
  • Endorsed by Shuze Chen · Oct 15, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 15, 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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me