Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Result 1: necessary and sufficient fast-control simulation

Open
QAlgorithms.Papers.Independent.Intakethird100.P99.simulation_iff_integerShift

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​. For every t≥0t\ge0t≥0,

U is ideally simulable using H for total time t⟺∃n∈Z3, β+(π/2)n≺stα.U\text{ is ideally simulable using }H\text{ for total time }t\quad\Longleftrightarrow\quad\exists n\in\mathbb Z^3,\ \beta+(\pi/2)n\prec_s t\alpha.U is ideally simulable using H for total time t⟺∃n∈Z3, β+(π/2)n≺s​tα.

The protocol is an operator protocol uniform over all input states. This is a two-way feasibility characterization, including t=0t=0t=0.

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.4–6, Result 1: exact ideal fast-control feasibility iff some integer shift is
s-majorized by the available canonical interaction-time vector, also at time zero. -/
theorem simulation_iff_integerShift (H U : TwoMatrix) (a b : Triple) (t : ℝ)
    (hH : HasCanonicalHamiltonian H a) (hU : HasContent U b) (ht : 0 ≤ t) :
    IdealSimulates H U t ↔ ∃ n : Fin 3 → ℤ, SMajorized (contentIntegerShift b n) (t • a) := by sorry

end

end QAlgorithms.Papers.Independent.Intakethird100.P99
Source
Characterization of non-local gates, arXiv:quant-ph/0205100v3, PDF p. 4, Result 1: necessary and sufficient gate simulation condition
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, real triples a,ba,ba,b, and real t≥0t\ge0t≥0, 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 such that (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 unitaries A′,B′,C′,D′A',B',C',D'A′,B′,C′,D′. For any real triple xxx, let σ(x)\sigma(x)σ(x) have first coordinate max⁡j∣xj∣\max_j|x_j|maxj​∣xj​∣, second coordinate ∑j∣xj∣−max⁡j∣xj∣−min⁡j∣xj∣\sum_j|x_j|-\max_j|x_j|-\min_j|x_j|∑j​∣xj​∣−maxj​∣xj​∣−minj​∣xj​∣, and third coordinate −min⁡j∣xj∣-\min_j|x_j|−minj​∣xj​∣ if x0x1x2<0x_0x_1x_2<0x0​x1​x2​<0, or +min⁡j∣xj∣+\min_j|x_j|+minj​∣xj​∣ otherwise; define x⪯syx\preceq_s yx⪯s​y by

σ(x)0≤σ(y)0,σ(x)0+σ(x)1−σ(x)2≤σ(y)0+σ(y)1−σ(y)2,σ(x)0+σ(x)1+σ(x)2≤σ(y)0+σ(y)1+σ(y)2.\sigma(x)_0\le\sigma(y)_0,\qquad \sigma(x)_0+\sigma(x)_1-\sigma(x)_2\le\sigma(y)_0+\sigma(y)_1-\sigma(y)_2,\qquad \sigma(x)_0+\sigma(x)_1+\sigma(x)_2\le\sigma(y)_0+\sigma(y)_1+\sigma(y)_2.σ(x)0​≤σ(y)0​,σ(x)0​+σ(x)1​−σ(x)2​≤σ(y)0​+σ(y)1​−σ(y)2​,σ(x)0​+σ(x)1​+σ(x)2​≤σ(y)0​+σ(y)1​+σ(y)2​.

Then the following are equivalent: 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 Ej,FjE_j,F_jEj​,Fj​ 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τj=t\sum_j\tau_j=t∑j​τj​=t and

∥(Em⊗Fm)e−iτmH⋯(E1⊗F1)e−iτ1H(E0⊗F0)−zU∥op<ε;\left\|(E_m\otimes F_m)e^{-i\tau_mH}\cdots (E_1\otimes F_1)e^{-i\tau_1H}(E_0\otimes F_0)-zU\right\|_{\mathrm{op}}<\varepsilon;​(Em​⊗Fm​)e−iτm​H⋯(E1​⊗F1​)e−iτ1​H(E0​⊗F0​)−zU​op​<ε;

and there exists an integer triple n=(n0,n1,n2)∈Z3n=(n_0,n_1,n_2)\in\mathbb Z^3n=(n0​,n1​,n2​)∈Z3 such that

(b0+πn02, b1+πn12, b2+πn22)⪯s(ta0,ta1,ta2).\left(b_0+\frac{\pi n_0}{2},\ b_1+\frac{\pi n_1}{2},\ b_2+\frac{\pi n_2}{2}\right)\preceq_s (ta_0,ta_1,ta_2).(b0​+2πn0​​, b1​+2πn1​​, b2​+2πn2​​)⪯s​(ta0​,ta1​,ta2​).

The finite list may be empty, the time t=0t=0t=0 is included, and there is no positivity assumption on a0a_0a0​ beyond the stated ordering conditions.

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