§IV.B: vectorization and transfer identities (172)
ProvedQAlgorithms.Papers.Independent.Advance50.P38.bipartiteVectorizationTransferprove2quantum
Let , let , and let . For column vectorization and the usual conjugate-linear-first inner product,
Putting and gives . In particular this trace is real and equals the transfer objective.
Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Advance50_P38
Formal statement
namespace QAlgorithms.Papers.Independent.Advance50.P38
open scoped BigOperators Topology Manifold ContDiff
noncomputable section
/-- Vectorization and pureStateTransfer (172), PDF p.27: column order, ordinary
transpose on W, and a modulus-square trace. -/
theorem bipartiteVectorizationTransfer {a b : ℕ} (ha : 0 < a) (hb : 0 < b)
(X Y : Matrix (Fin a) (Fin b) ℂ)
(V : Matrix.unitaryGroup (Fin a) ℂ) (W : Matrix.unitaryGroup (Fin b) ℂ) :
colVec ((V : (Matrix (Fin a) (Fin a) ℂ)) * Y * (W : (Matrix (Fin b) (Fin b) ℂ))) =
(Matrix.kronecker (W : (Matrix (Fin b) (Fin b) ℂ)).transpose (V : (Matrix (Fin a) (Fin a) ℂ))).mulVec (colVec Y) ∧
vInner (colVec X) (colVec Y) = Matrix.trace (X.conjTranspose * Y) ∧
Matrix.trace (rankOneMatrix (colVec X) * Matrix.kronecker (W : (Matrix (Fin b) (Fin b) ℂ)) (V : (Matrix (Fin a) (Fin a) ℂ)) *
rankOneMatrix (colVec Y) * (Matrix.kronecker (W : (Matrix (Fin b) (Fin b) ℂ)) (V : (Matrix (Fin a) (Fin a) ℂ))).conjTranspose) =
(Complex.normSq (Matrix.trace (X.conjTranspose * (V : (Matrix (Fin a) (Fin a) ℂ)) * Y * (W : (Matrix (Fin b) (Fin b) ℂ)).transpose)) : ℂ) ∧
pureStateTransfer (colVec X) (colVec Y) (Matrix.kronecker (W : (Matrix (Fin b) (Fin b) ℂ)) (V : (Matrix (Fin a) (Fin a) ℂ))) =
Complex.normSq (vInner (colVec X) (colVec ((V : (Matrix (Fin a) (Fin a) ℂ)) * Y * (W : (Matrix (Fin b) (Fin b) ℂ)).transpose))) := by sorry
end
end QAlgorithms.Papers.Independent.Advance50.P38
Source
Gradient Flows for Optimisation and Quantum Control: Foundations and Applications, arXiv:0802.4195v2, PDF p. 27, §IV.B: vectorization and transfer identities (172)
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For all positive natural numbers , arbitrary complex matrices , and unitary matrices , , define for any matrix , define , and let have entries . With , all four identities hold:
Here is ordinary transpose, is conjugate transpose, matrix action on a vector uses the usual sum over column indices, and the real number on the right of the third identity is regarded as a complex number. The vectors need not be normalized and may be zero.
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.