§4.1, p. 25 — with a′ = a + 1 and U′ = U ⊗ I₂, the block of U′†(I ⊗ CNOT)U′ at |0⟩^{⊗a′} equals K
ProvedQuantumSDP18.MeasureBE.cnot_identityblock-encodingcnotp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-information
Let be an operator on the system and ancilla qubits, append one fresh qubit, and put and . Let act on the measured (last) ancilla qubit as control and the fresh qubit as target. Then
The left side is the operator whose distance from the bias controls; the right side is the top-left block of the unitary , 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 , so the direction is pinned to the first. No hypothesis on 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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.