Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§4.1, p. 25 — with a′ = a + 1 and U′ = U ⊗ I₂, the block of U′†(I ⊗ CNOT)U′ at |0⟩^{⊗a′} equals K

Proved
QuantumSDP18.MeasureBE.cnot_identity

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

block-encodingcnotp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-information

Let UUU be an operator on the system and aaa ancilla qubits, append one fresh qubit, and put a′=a+1a' = a+1a′=a+1 and U′=U⊗I2U' = U\otimes I_2U′=U⊗I2​. Let CNOT\mathrm{CNOT}CNOT act on the measured (last) ancilla qubit as control and the fresh qubit as target. Then

(I⊗⟨0∣⊗a)U†(I⊗∣0⟩⟨0∣)U(I⊗∣0⟩⊗a)=(I⊗⟨0∣⊗a′)U′†(I⊗CNOT)U′(I⊗∣0⟩⊗a′).\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) = \Big(I\otimes\langle 0|^{\otimes a'}\Big)U'^\dagger(I\otimes\mathrm{CNOT})U'\Big(I\otimes|0\rangle^{\otimes a'}\Big).(I⊗⟨0∣⊗a)U†(I⊗∣0⟩⟨0∣)U(I⊗∣0⟩⊗a)=(I⊗⟨0∣⊗a′)U′†(I⊗CNOT)U′(I⊗∣0⟩⊗a′).

The left side is the operator KKK whose distance from MMM the bias controls; the right side is the top-left block of the unitary U′†(I⊗CNOT)U′U'^\dagger(I\otimes\mathrm{CNOT})U'U′†(I⊗CNOT)U′, so this identity turns a non-unitary sandwich into a block of a unitary circuit.

Formalization Note The page does not print the direction of the CNOT. With the measured qubit as control and the fresh qubit as target the identity holds; with the roles swapped the right side is U†UU^\dagger UU†U, so the direction is pinned to the first. No hypothesis on UUU is needed.

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

/-- §4.1, p. 25: with `a′ := a + 1` and `U′ := U ⊗ I₂`,
`(I ⊗ ⟨0|^{⊗a}) U† (I ⊗ |0⟩⟨0|) U (I ⊗ |0⟩^{⊗a}) = (I ⊗ ⟨0|^{⊗a′}) U′† (I ⊗ CNOT) U′ (I ⊗ |0⟩^{⊗a′})`,
the CNOT controlled by the measured (last) ancilla qubit and targeting the fresh qubit. -/
theorem cnot_identity {ι : Type*} [Fintype ι] [DecidableEq ι] (c : ℕ)
    (U : Matrix (ι × Anc c) (ι × Anc c) ℂ) :
    blockK c U = (ketZeroPrime (ι := ι) c).conjTranspose * (Uprime c U).conjTranspose *
      cnotLast (ι := ι) c * Uprime c U * ketZeroPrime (ι := ι) c := 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, 'Finally let a′ := a + 1 and U′ := U ⊗ I₂, then it is easy to see 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