§4.1, p. 25 — ρ ⊗ |0⟩⟨0|^{⊗a} = (I ⊗ |0⟩^{⊗a})ρ(I ⊗ ⟨0|^{⊗a}), so the acceptance probability is Tr(Kρ)
ProvedQuantumSDP18.MeasureBE.trace_identityblock-encodingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-informationtrace
Let be any operator on the system register, attach ancilla qubits, and let be any operator on system and ancillas. Then attaching the ancillas in is conjugation by the isometry ,
and consequently the acceptance probability of the procedure equals the trace of against the block :
This rewrites the bias condition (14) as a condition on the single operator .
Formalization Note No hypothesis on or 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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.