Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Controlled-unitary content from folded eigenphases and its cost

Open
QAlgorithms.Papers.Independent.Intakethird100.P99.controlledUnitary_content_cost

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

prove2quantum

Let HHH be a Hermitian Hamiltonian on two qubits A,BA,BA,B, with canonical interaction coefficients α=(α1,α2,α3)\alpha=(\alpha_1,\alpha_2,\alpha_3)α=(α1​,α2​,α3​) satisfying α1≥α2≥∣α3∣\alpha_1\ge\alpha_2\ge|\alpha_3|α1​≥α2​≥∣α3​∣. Local terms in HHH are allowed. Local unitary controls are instantaneous and free, interaction intervals are nonnegative, and ℏ=1\hbar=1ℏ=1. Write CH(U)C_H(U)CH​(U) for the infimum of the interaction durations of protocols implementing the gate UUU, allowing the ideal limit of arbitrarily fine pulses at fixed total duration and disregarding global phase. This cost is an extended nonnegative real, with value +∞+\infty+∞ for an impossible simulation. Let WWW be any one-qubit unitary and ctrl-W=∣0⟩⟨0∣⊗I+∣1⟩⟨1∣⊗W\mathrm{ctrl}\text{-}W=|0\rangle\langle0|\otimes I+|1\rangle\langle1|\otimes Wctrl-W=∣0⟩⟨0∣⊗I+∣1⟩⟨1∣⊗W. There exists a scalar zzz of modulus one such that zWzWzW has eigenvalues e2ib,e−2ibe^{2ib},e^{-2ib}e2ib,e−2ib for some 0≤b≤π/20\le b\le\pi/20≤b≤π/2. For every such choice let c=min⁡{b,π/2−b}c=\min\{b,\pi/2-b\}c=min{b,π/2−b}. Assuming α1>0\alpha_1>0α1​>0,

β(ctrl-W)=(c,0,0),CH(ctrl-W)=cα1.\beta(\mathrm{ctrl}\text{-}W)=(c,0,0),\qquad C_H(\mathrm{ctrl}\text{-}W)=\frac{c}{\alpha_1}.β(ctrl-W)=(c,0,0),CH​(ctrl-W)=α1​c​.

The scalar phase of WWW induces a free phase gate on the control. Folding the half-angle removes the branch ambiguity in the interaction content.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P99
Formal statement
namespace QAlgorithms.Papers.Independent.Intakethird100.P99

open scoped Matrix Kronecker NNReal ENNReal

open QAlgorithms.Papers.Independent.Information100.P10 (pauli)

open QAlgorithms.Papers.Independent.Information100.P32 (evolution)

noncomputable section

/-- PDF pp.7,13, III.D.1 and Appendix A: after a free determinant phase, the eigenvalues
are exp(±2ib), 0≤b≤pi/2. The content coordinate is min(b,pi/2-b). -/
theorem controlledUnitary_content_cost (W : OneGate) (H : TwoMatrix) (a : Triple)
    (hH : HasCanonicalHamiltonian H a) (ha : 0 < a 0) :
    (∃ b : ℝ, ControlPhase (W : OneMatrix) b) ∧
    ∀ b : ℝ, ControlPhase (W : OneMatrix) b →
      HasContent (controlled (W : OneMatrix)) (controlledContent b) ∧
      interactionCost H (controlled (W : OneMatrix)) =
        ENNReal.ofReal (min b (Real.pi / 2 - b) / a 0) := by sorry

end

end QAlgorithms.Papers.Independent.Intakethird100.P99
Source
Characterization of non-local gates, arXiv:quant-ph/0205100v3, PDF p. 7, III.D.1 and Appendix A: controlled-U content and cost
Read-back

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

For every one-qubit unitary WWW, complex two-qubit matrix HHH, and real triple aaa, assume H=H†H=H^\daggerH=H†, a1≤a0a_1\le a_0a1​≤a0​, ∣a2∣≤a1|a_2|\le a_1∣a2​∣≤a1​, a0>0a_0>0a0​>0, and there exist one-qubit unitaries A,BA,BA,B and Hermitian one-qubit matrices K,LK,LK,L such that

(A⊗B)H(A⊗B)†=∑j=02ajσj⊗σj+K⊗I+I⊗L,(σ0,σ1,σ2)=(X,Y,Z).(A\otimes B)H(A\otimes B)^\dagger =\sum_{j=0}^2a_j\sigma_j\otimes\sigma_j+K\otimes I+I\otimes L, \qquad(\sigma_0,\sigma_1,\sigma_2)=(X,Y,Z).(A⊗B)H(A⊗B)†=j=0∑2​aj​σj​⊗σj​+K⊗I+I⊗L,(σ0​,σ1​,σ2​)=(X,Y,Z).

There exists a real b∈[0,π/2]b\in[0,\pi/2]b∈[0,π/2] for which some complex scalar zzz, ∣z∣=1|z|=1∣z∣=1, satisfies

charpoly⁡(zW)=(x−e2ib)(x−e−2ib).\operatorname{charpoly}(zW) =(x-e^{2ib})(x-e^{-2ib}).charpoly(zW)=(x−e2ib)(x−e−2ib).

For every real bbb satisfying precisely this interval and characteristic-polynomial condition, put d=(min⁡(b,π/2−b),0,0)d=(\min(b,\pi/2-b),0,0)d=(min(b,π/2−b),0,0). The controlled matrix VVV, which acts as the identity on the target when the control bit is false and as WWW when the control bit is true, is unitary, ddd satisfies d1≤d0d_1\le d_0d1​≤d0​, ∣d2∣≤d1|d_2|\le d_1∣d2​∣≤d1​, d0≤π/4d_0\le\pi/4d0​≤π/4, and there are four one-qubit unitaries A′,B′,C′,D′A',B',C',D'A′,B′,C′,D′ with V=(A′⊗B′)exp⁡(−i∑jdjσj⊗σj)(C′⊗D′)V=(A'\otimes B')\exp(-i\sum_jd_j\sigma_j\otimes\sigma_j)(C'\otimes D')V=(A′⊗B′)exp(−i∑j​dj​σj​⊗σj​)(C′⊗D′). Its interaction cost satisfies

CH(V)=min⁡(b,π/2−b)a0.C_H(V)=\frac{\min(b,\pi/2-b)}{a_0}.CH​(V)=a0​min(b,π/2−b)​.

Here CH(V)C_H(V)CH​(V) is the extended nonnegative infimum, with empty infimum +∞+\infty+∞, of times t≥0t\ge0t≥0 admitting arbitrarily accurate finite pulse simulation: for every ε>0\varepsilon>0ε>0, one-qubit unitaries and nonnegative durations summing exactly to ttt give a product (Am⊗Bm)e−itmH⋯(A1⊗B1)e−it1H(A0⊗B0)(A_m\otimes B_m)e^{-it_mH}\cdots(A_1\otimes B_1)e^{-it_1H}(A_0\otimes B_0)(Am​⊗Bm​)e−itm​H⋯(A1​⊗B1​)e−it1​H(A0​⊗B0​) at operator-norm distance strictly less than ε\varepsilonε from z′Vz'Vz′V for some ∣z′∣=1|z'|=1∣z′∣=1. Empty pulse lists are permitted, and the phase range includes b=0b=0b=0 and b=π/2b=\pi/2b=π/2, where the displayed cost is zero.

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