Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Lemma 12, display line 1 — the zero ancilla block of V

Proved
QuantumSDP18.DensityBE.block_eq_sandwich

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

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

Let φ=G|0⟩ be the column of a matrix G at the all-zero input. The block of V obtained by fixing both the extra qubit and G's entire register to zero equals the SWAP sandwich formed with φ:

(I⊗⟨0∣⟨φ∣)S(I⊗∣0⟩∣φ⟩).(I\otimes\langle0|\langle\varphi|)S(I\otimes|0\rangle|\varphi\rangle).(I⊗⟨0∣⟨φ∣)S(I⊗∣0⟩∣φ⟩).

This identifies the block to be evaluated in the remaining steps of the proof. It is an algebraic identity for every complex matrix G; unitarity is used separately.

Formalization Note The system is the first factor of V, while the referenced block-encoding predicate expects the ancilla first. This theorem writes entries of the system-first block directly. The ancilla is the extra qubit followed by G's w+1+c qubits.

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

theorem block_eq_sandwich {w c : ℕ} (G : Matrix (Reg w c) (Reg w c) ℂ) :
    (Matrix.of fun i j : QAlgorithms.Qubits w =>
      V G ((i, false), zeroReg w c) ((j, false), zeroReg w c)) =
    sandwich (purifVec G) := by sorry

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