Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Result 2: the two-branch attained interaction cost

Open
QAlgorithms.Papers.Independent.Intakethird100.P99.interactionCost_twoBranches

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. For a two-qubit unitary UUU, let β\betaβ be an actual interaction-content witness: UUU is locally equivalent, up to global phase, to Uβ=exp⁡[−i∑k=13βkσk⊗σk]U_\beta=\exp[-i\sum_{k=1}^3\beta_k\sigma_k\otimes\sigma_k]Uβ​=exp[−i∑k=13​βk​σk​⊗σk​], where σ1,σ2,σ3\sigma_1,\sigma_2,\sigma_3σ1​,σ2​,σ3​ are the Pauli matrices X,Y,ZX,Y,ZX,Y,Z and π/4≥β1≥β2≥∣β3∣\pi/4\ge\beta_1\ge\beta_2\ge|\beta_3|π/4≥β1​≥β2​≥∣β3​∣. For real triples, x≺syx\prec_s yx≺s​y means s-majorization: sort their absolute coordinates in descending order, give the smallest coordinate the sign of the product, and compare the first coordinate and the two sums x1+x2∓x3x_1+x_2\mp x_3x1​+x2​∓x3​. Put βn=β+(π/2)n\beta_n=\beta+(\pi/2)nβn​=β+(π/2)n for n∈Z3n\in\mathbb Z^3n∈Z3. If α1>0\alpha_1>0α1​>0, there is a least feasible time t∗t_*t∗​, attained in the ideal control model, such that

CH(U)=t∗=min⁡{t≥0:β≺stα or β(−1,0,0)≺stα}.C_H(U)=t_* = \min\{t\ge0:\beta\prec_s t\alpha\ \text{or}\ \beta_{(-1,0,0)}\prec_s t\alpha\}.CH​(U)=t∗​=min{t≥0:β≺s​tα or β(−1,0,0)​≺s​tα}.

For zero canonical interaction, the cost is 000 for local gates and +∞+\infty+∞ otherwise. This characterizes time cost using just two periodic branches.

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 p.6, Result 2 (abstract p.1): the two-branch minimum is attained for a nonzero
interaction. For a zero canonical interaction the extended cost is 0 on local gates and
infinity otherwise; no division by zero or empty real infimum is used. -/
theorem interactionCost_twoBranches (H U : TwoMatrix) (a b : Triple)
    (hH : HasCanonicalHamiltonian H a) (hU : HasContent U b) :
    (0 < a 0 → ∃ t : ℝ, IsLeast {s : ℝ | 0 ≤ s ∧
        (SMajorized b (s • a) ∨ SMajorized (secondShift b) (s • a))} t ∧
      IdealSimulates H U t ∧ interactionCost H U = ENNReal.ofReal t) ∧
    (a = 0 → (TwoQubitLocalEquivalent U 1 → interactionCost H U = 0) ∧
      (¬ TwoQubitLocalEquivalent U 1 → interactionCost H U = ⊤)) := by sorry

end

end QAlgorithms.Papers.Independent.Intakethird100.P99
Source
Characterization of non-local gates, arXiv:quant-ph/0205100v3, PDF p. 6, Result 2: interaction cost; main result selected from the p.1 abstract
Read-back

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

For every pair of complex two-qubit matrices H,UH,UH,U and every pair of real triples a,ba,ba,b, assume that HHH is Hermitian, a1≤a0a_1\le a_0a1​≤a0​, ∣a2∣≤a1|a_2|\le a_1∣a2​∣≤a1​, and there exist single-qubit unitary matrices A,BA,BA,B and Hermitian single-qubit matrices K,LK,LK,L satisfying (A⊗B)H(A⊗B)†=J(a)+K⊗I2+I2⊗L(A\otimes B)H(A\otimes B)^\dagger=J(a)+K\otimes I_2+I_2\otimes L(A⊗B)H(A⊗B)†=J(a)+K⊗I2​+I2​⊗L, where J(x)=x0X⊗X+x1Y⊗Y+x2Z⊗ZJ(x)=x_0X\otimes X+x_1Y\otimes Y+x_2Z\otimes ZJ(x)=x0​X⊗X+x1​Y⊗Y+x2​Z⊗Z and X,Y,ZX,Y,ZX,Y,Z are the standard Pauli matrices. Assume also that UUU is unitary, b1≤b0b_1\le b_0b1​≤b0​, ∣b2∣≤b1|b_2|\le b_1∣b2​∣≤b1​, b0≤π/4b_0\le\pi/4b0​≤π/4, and U=(A′⊗B′)e−iJ(b)(C′⊗D′)U=(A'\otimes B')e^{-iJ(b)}(C'\otimes D')U=(A′⊗B′)e−iJ(b)(C′⊗D′) for some single-qubit unitary matrices A′,B′,C′,D′A',B',C',D'A′,B′,C′,D′. For a real triple xxx, let xmax⁡=max⁡j∣xj∣x_{\max}=\max_j|x_j|xmax​=maxj​∣xj​∣, xmin⁡=min⁡j∣xj∣x_{\min}=\min_j|x_j|xmin​=minj​∣xj​∣, and define

σ(x)=(xmax⁡, ∑j=02∣xj∣−xmax⁡−xmin⁡, {−xmin⁡,x0x1x2<0,xmin⁡,x0x1x2≥0.).\sigma(x)=\left(x_{\max},\ \sum_{j=0}^{2}|x_j|-x_{\max}-x_{\min},\ \begin{cases}-x_{\min},&x_0x_1x_2<0,\\x_{\min},&x_0x_1x_2\ge0.\end{cases}\right).σ(x)=(xmax​, j=0∑2​∣xj​∣−xmax​−xmin​, {−xmin​,xmin​,​x0​x1​x2​<0,x0​x1​x2​≥0.​).

Write x⪯syx\preceq_s yx⪯s​y for the three inequalities σ(x)0≤σ(y)0\sigma(x)_0\le\sigma(y)_0σ(x)0​≤σ(y)0​, σ(x)0+σ(x)1−σ(x)2≤σ(y)0+σ(y)1−σ(y)2\sigma(x)_0+\sigma(x)_1-\sigma(x)_2\le\sigma(y)_0+\sigma(y)_1-\sigma(y)_2σ(x)0​+σ(x)1​−σ(x)2​≤σ(y)0​+σ(y)1​−σ(y)2​, and σ(x)0+σ(x)1+σ(x)2≤σ(y)0+σ(y)1+σ(y)2\sigma(x)_0+\sigma(x)_1+\sigma(x)_2\le\sigma(y)_0+\sigma(y)_1+\sigma(y)_2σ(x)0​+σ(x)1​+σ(x)2​≤σ(y)0​+σ(y)1​+σ(y)2​. Say that HHH ideally simulates UUU at time ttt when HHH is Hermitian, UUU is unitary, t≥0t\ge0t≥0, and for every real ε>0\varepsilon>0ε>0 there exist a finite list of nonnegative durations τ1,…,τm\tau_1,\ldots,\tau_mτ1​,…,τm​, single-qubit unitary matrices Aj,BjA_j,B_jAj​,Bj​ for j=0,…,mj=0,\ldots,mj=0,…,m, and z∈Cz\in\mathbb Cz∈C with ∣z∣=1|z|=1∣z∣=1, such that ∑j=1mτj=t\sum_{j=1}^{m}\tau_j=t∑j=1m​τj​=t and

∥(Am⊗Bm)e−iτmH⋯(A1⊗B1)e−iτ1H(A0⊗B0)−zU∥op<ε;\left\|(A_m\otimes B_m)e^{-i\tau_mH}\cdots (A_1\otimes B_1)e^{-i\tau_1H}(A_0\otimes B_0)-zU\right\|_{\mathrm{op}}<\varepsilon;​(Am​⊗Bm​)e−iτm​H⋯(A1​⊗B1​)e−iτ1​H(A0​⊗B0​)−zU​op​<ε;

the empty list m=0m=0m=0 is allowed. Define CH(U)C_H(U)CH​(U) to be the infimum, in [0,∞][0,\infty][0,∞], of all nonnegative times at which this simulation condition holds, with infimum +∞+\infty+∞ if there are no such times. The conclusion is the conjunction of two implications: if a0>0a_0>0a0​>0, there exists a real ttt which is the least element of

{s∈R: s≥0,b⪯ssa or (b0−π/2,b1,b2)⪯ssa},\left\{s\in\mathbb R:\ s\ge0,\quad b\preceq_s sa\ \text{or}\ (b_0-\pi/2,b_1,b_2)\preceq_s sa\right\},{s∈R: s≥0,b⪯s​sa or (b0​−π/2,b1​,b2​)⪯s​sa},

such that HHH ideally simulates UUU at time ttt and CH(U)=tC_H(U)=tCH​(U)=t, viewed as an extended nonnegative real; and if a=(0,0,0)a=(0,0,0)a=(0,0,0), then CH(U)=0C_H(U)=0CH​(U)=0 whenever U=(E⊗F)(G⊗T)U=(E\otimes F)(G\otimes T)U=(E⊗F)(G⊗T) for some single-qubit unitaries E,F,G,TE,F,G,TE,F,G,T, whereas CH(U)=+∞C_H(U)=+\inftyCH​(U)=+∞ whenever no such four unitaries exist.

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