Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

The exact restricted-chamber criterion and one-branch cost

Open
QAlgorithms.Papers.Independent.Intakethird100.P99.restrictedCost

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​. Write β−=β−(π/2,0,0)\beta^- =\beta-(\pi/2,0,0)β−=β−(π/2,0,0). For a nonzero interaction (α1>0\alpha_1>0α1​>0),

β≺sβ−⟺β1+∣β3∣≤π/4.\beta\prec_s\beta^-\quad\Longleftrightarrow\quad\beta_1+|\beta_3|\le\pi/4.β≺s​β−⟺β1​+∣β3​∣≤π/4.

Under this restriction, CH(U)=min⁡{t≥0:β≺stα}C_H(U)=\min\{t\ge0:\beta\prec_s t\alpha\}CH​(U)=min{t≥0:β≺s​tα}, with the minimum attained in the ideal control model. The shifted vector is s-ordered before comparison, giving (π/2−β1,β2,−β3)(\pi/2-\beta_1,\beta_2,-\beta_3)(π/2−β1​,β2​,−β3​).

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.6–7, III.C: the exact criterion for dropping the second branch, and the
resulting attained one-branch interaction-cost formula. -/
theorem restrictedCost (H U : TwoMatrix) (a b : Triple)
    (hH : HasCanonicalHamiltonian H a) (hU : HasContent U b) (ha : 0 < a 0) :
    (SMajorized b (secondShift b) ↔ b 0 + |b 2| ≤ Real.pi / 4) ∧
    (b 0 + |b 2| ≤ Real.pi / 4 → ∃ t : ℝ,
      IsLeast {s : ℝ | 0 ≤ s ∧ SMajorized b (s • a)} t ∧
      IdealSimulates H U t ∧ interactionCost H U = ENNReal.ofReal t) := by sorry

end

end QAlgorithms.Papers.Independent.Intakethird100.P99
Source
Characterization of non-local gates, arXiv:quant-ph/0205100v3, PDF p. 6, III.C: when the second shift can be omitted
Read-back

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

For all complex two-qubit matrices H,UH,UH,U and real triples a,ba,ba,b, 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 with

(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).

Also assume 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′)exp⁡(−i∑jbjσj⊗σj)(C′⊗D′)U=(A'\otimes B')\exp(-i\sum_jb_j\sigma_j\otimes\sigma_j)(C'\otimes D')U=(A′⊗B′)exp(−i∑j​bj​σj​⊗σj​)(C′⊗D′) for some four one-qubit unitaries. For any real triple xxx, let h=max⁡(∣x0∣,∣x1∣,∣x2∣)h=\max(|x_0|,|x_1|,|x_2|)h=max(∣x0​∣,∣x1​∣,∣x2​∣), ℓ=min⁡(∣x0∣,∣x1∣,∣x2∣)\ell=\min(|x_0|,|x_1|,|x_2|)ℓ=min(∣x0​∣,∣x1​∣,∣x2​∣), and

o(x)=(h, ∣x0∣+∣x1∣+∣x2∣−h−ℓ, η),η={−ℓx0x1x2<0,ℓx0x1x2≥0.o(x)=\bigl(h,\ |x_0|+|x_1|+|x_2|-h-\ell,\ \eta\bigr), \qquad \eta=\begin{cases}-\ell&x_0x_1x_2<0,\\ \ell&x_0x_1x_2\ge0.\end{cases}o(x)=(h, ∣x0​∣+∣x1​∣+∣x2​∣−h−ℓ, η),η={−ℓℓ​x0​x1​x2​<0,x0​x1​x2​≥0.​

Write x⪯syx\preceq_s yx⪯s​y when o(x)0≤o(y)0o(x)_0\le o(y)_0o(x)0​≤o(y)0​, o(x)0+o(x)1−o(x)2≤o(y)0+o(y)1−o(y)2o(x)_0+o(x)_1-o(x)_2\le o(y)_0+o(y)_1-o(y)_2o(x)0​+o(x)1​−o(x)2​≤o(y)0​+o(y)1​−o(y)2​, and o(x)0+o(x)1+o(x)2≤o(y)0+o(y)1+o(y)2o(x)_0+o(x)_1+o(x)_2\le o(y)_0+o(y)_1+o(y)_2o(x)0​+o(x)1​+o(x)2​≤o(y)0​+o(y)1​+o(y)2​. Then

b⪯s(b0−π/2,b1,b2)⟺b0+∣b2∣≤π/4.b\preceq_s(b_0-\pi/2,b_1,b_2) \quad\Longleftrightarrow\quad b_0+|b_2|\le\pi/4.b⪯s​(b0​−π/2,b1​,b2​)⟺b0​+∣b2​∣≤π/4.

Moreover, if b0+∣b2∣≤π/4b_0+|b_2|\le\pi/4b0​+∣b2​∣≤π/4, there exists a real ttt such that t≥0t\ge0t≥0, b⪯stab\preceq_s tab⪯s​ta, and t≤st\le st≤s for every real s≥0s\ge0s≥0 satisfying b⪯ssab\preceq_s sab⪯s​sa; at this same exact time ttt, UUU admits arbitrarily accurate pulse simulation under HHH, and its interaction cost is ttt. Here simulation at time ttt means that for every ε>0\varepsilon>0ε>0 there is a finite 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​), with one-qubit unitaries, nonnegative durations summing to ttt, and some ∣z∣=1|z|=1∣z∣=1, whose operator-norm distance from zUzUzU is strictly less than ε\varepsilonε; zero pulses are allowed. The interaction cost is the infimum of all such nonnegative times in [0,+∞][0,+\infty][0,+∞], with empty infimum +∞+\infty+∞.

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