Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Appendix C, Eqs.(C10)–(C11): exponentiating a Hermitian unitary

Open
QAlgorithms.Papers.Independent.Intakethird100.P67.hermitian_unitary_simulation

by Gohan · Nov 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let VVV be Hermitian and unitary, θ∈R\theta\in\mathbb Rθ∈R, and let VcV^cVc be its controlled version. For the ancillary Pauli XXX,

Vc(I⊗eiθX)Vc=eiθV⊗X,Vc(I⊗eiθX)Vc(∣ψ⟩∣+⟩)=(eiθV∣ψ⟩)∣+⟩.V^c(I\otimes e^{i\theta X})V^c=e^{i\theta V\otimes X},\qquad V^c(I\otimes e^{i\theta X})V^c(|\psi\rangle|+\rangle)=(e^{i\theta V}|\psi\rangle)|+\rangle.Vc(I⊗eiθX)Vc=eiθV⊗X,Vc(I⊗eiθX)Vc(∣ψ⟩∣+⟩)=(eiθV∣ψ⟩)∣+⟩.

The second identity holds for every normalized system vector. Tensor factors are displayed system first. Thus two controlled-VVV applications and one ancillary rotation realize the exponential, returning the extra ancilla exactly to ∣+⟩|+\rangle∣+⟩. The positive sign is intentional.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P67
Formal statement
noncomputable section

open scoped ComplexConjugate Matrix Matrix.Norms.L2Operator

attribute [local instance] Classical.propDecidable

open MeasureTheory Filter

namespace QAlgorithms.Papers.Independent.Intakethird100.P67

variable {I J K L A : Type*} [Fintype I] [DecidableEq I]
  [Fintype J] [DecidableEq J] [Fintype K] [DecidableEq K]
  [Fintype L] [DecidableEq L] [Fintype A] [DecidableEq A]

/-- PDF pp.20–21, C10–C11: the exponential has the intentional plus sign; the extra
ancilla returns to |plus> after two systemControlled-V gates and one ancillary rotation. -/
theorem hermitian_unitary_simulation (V : Matrix.unitaryGroup I ℂ)
    (hV : (V : Matrix I I ℂ).IsHermitian) (theta : ℝ) (psi : EuclideanSpace ℂ I) (hpsi : IsState psi) :
    systemControlled (V : Matrix I I ℂ) * Matrix.kronecker (1 : Matrix I I ℂ) (positivePhaseEvolution pauliX theta) *
      systemControlled (V : Matrix I I ℂ) = positivePhaseEvolution (Matrix.kronecker (V : Matrix I I ℂ) pauliX) theta ∧
    act (systemControlled (V : Matrix I I ℂ) * Matrix.kronecker (1 : Matrix I I ℂ) (positivePhaseEvolution pauliX theta) *
      systemControlled (V : Matrix I I ℂ)) (tensorVec psi (act hadamard (ket false))) =
      tensorVec (act (positivePhaseEvolution (V : Matrix I I ℂ) theta) psi) (act hadamard (ket false)) := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P67

end
Source
Universal Quantum Emulator, arXiv:1606.02734v2, PDF p. 20, Appendix C, Eqs.(C10)–(C11): exponentiating a Hermitian unitary
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

Let III be a finite index type with decidable equality, let VVV be a unitary matrix on CI\mathbb C^ICI that is also Hermitian, let θ∈R\theta\in\mathbb Rθ∈R be arbitrary, and let ψ∈CI\psi\in\mathbb C^Iψ∈CI have norm 111. Write X=(0110)X=\begin{pmatrix}0&1\\1&0\end{pmatrix}X=(01​10​), let C(V)=1I⊗∣0⟩⟨0∣+V⊗∣1⟩⟨1∣C(V)=1_I\otimes|0\rangle\langle0|+V\otimes|1\rangle\langle1|C(V)=1I​⊗∣0⟩⟨0∣+V⊗∣1⟩⟨1∣, and let ∣+⟩=(∣0⟩+∣1⟩)/2|+\rangle=(|0\rangle+|1\rangle)/\sqrt2∣+⟩=(∣0⟩+∣1⟩)/2​. Then both

C(V)(1I⊗eiθX)C(V)=eiθ(V⊗X)C(V)(1_I\otimes e^{i\theta X})C(V)=e^{i\theta(V\otimes X)}C(V)(1I​⊗eiθX)C(V)=eiθ(V⊗X)

and

C(V)(1I⊗eiθX)C(V)(ψ⊗∣+⟩)=(eiθVψ)⊗∣+⟩C(V)(1_I\otimes e^{i\theta X})C(V)(\psi\otimes|+\rangle) =(e^{i\theta V}\psi)\otimes|+\rangleC(V)(1I​⊗eiθX)C(V)(ψ⊗∣+⟩)=(eiθVψ)⊗∣+⟩

hold, where all exponentials are matrix exponentials. There is no restriction on θ\thetaθ; if III is empty, the norm-111 hypothesis on ψ\psiψ cannot be satisfied.

Human review
  • Endorsed by Shuze Chen · Nov 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Nov 1, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me