Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 12 — exact block-encoding of a subnormalized density operator (proof’s corrected ancilla count)

Proved
QuantumSDP18.DensityBE.lemma_12

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

block-encodingdensity-operatorp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-information

Let G be a unitary on w+a qubits, where a=c+1 includes a one-qubit flag, and suppose G|0⟩ is a purification of the subnormalized w-qubit density operator ϱ. Form V by preparing this state with G, swapping the initial w-qubit system and extra qubit with the system-and-flag part of the prepared register, then applying G†. The resulting unitary is an exact block-encoding of ϱ:

∥ϱ−(I⊗⟨0∣⊗(w+a+1))V(I⊗∣0⟩⊗(w+a+1))∥=0.\left\|\varrho-(I\otimes\langle0|^{\otimes(w+a+1)})V(I\otimes|0\rangle^{\otimes(w+a+1)})\right\|=0.​ϱ−(I⊗⟨0∣⊗(w+a+1))V(I⊗∣0⟩⊗(w+a+1))​=0.

This converts purified access to a subnormalized density operator into the operator input model used by the paper.

Formalization Note The published block-encoding predicate is used after reindexing V to put the ancillas first; it includes V's unitarity. The ancilla type has 1+w+a qubits. The paper prints w+a in Lemma 12, while its proof takes a 1+w+a-qubit zero block of a (2w+a+1)-qubit V. The statement uses the proof's count. The purification and subnormalization hypotheses are both explicit as in the page, although purification implies subnormalization and G's unitarity implies its vector has norm one. The construction contains one G and one G†; gate count is outside this matrix statement.

Preamble
import Mathlib
import Definitions.Def_QAlgorithms_Defs_BlockEncoding
import Definitions.Def_QuantumSDP18_DensityBE_Setting
Formal statement
namespace QuantumSDP18.DensityBE

theorem lemma_12 {w c : ℕ} (G : Matrix (Reg w c) (Reg w c) ℂ)
    (ϱ : Matrix (QAlgorithms.Qubits w) (QAlgorithms.Qubits w) ℂ)
    (hG : G ∈ Matrix.unitaryGroup (Reg w c) ℂ)
    (hϱ : IsSubnormDensity ϱ)
    (hpur : IsPurification (purifVec G) ϱ) :
    QAlgorithms.IsBlockEncoding (ancZero w c)
      (Matrix.reindex (blockEquiv w c) (blockEquiv w c) (V G)) 1 0 ϱ := by sorry

end QuantumSDP18.DensityBE
Source
van Apeldoorn and Gilyén, Improvements in quantum SDP-solving with applications, arXiv:1804.05058v1, p. 15, Lemma 12; p. 16, proof and first display
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