Skip to content

Magnus Expansion Error

A truncated Magnus series can be exactly unitary and still be a poor approximation. This notebook makes that distinction quantitative for a two-step qubit drive whose time-ordered propagator is known without numerical integration. It tests the expected weak-drive orders through fourth homogeneous degree, reverses the pulse order, compares with a nonunitary Dyson truncation, follows the error for 200 periods, and reconstructs the same Floquet operator from several logarithm branches.

For small pulse scale η\eta, the one-period errors of the four cumulative Magnus approximations scale as η2\eta^2, η3\eta^3, η4\eta^4, and η5\eta^5, with fitted powers 1.99941.9994, 3.00163.0016, 3.99963.9996, and 5.00095.0009. Every exponentiated truncation remains unitary to about 10−1510^{-15} over the one-period sweep. At η=1.5\eta=1.5, however, the fourth-degree error is 0.5190.519, larger than the third-degree error 0.3770.377, even though the standard sufficient norm condition for convergence is satisfied. Convergence of the infinite series is not monotone improvement of its first few truncations.

The long-time test adds a second warning. At η=0.16\eta=0.16, fourth degree is more accurate than third degree after one period, but less accurate after 200 periods. Unitarity prevents norm drift; it does not prevent coherent phase error from accumulating.

Run the investigation. The program and retained results below support the stated experiment. Follow Running an Experiment for environment and output-directory guidance. The recorded evidence applies to its stated parameters and environment.

This page owns the numerical stress test and retained artifacts. It does not replace the general derivations.

ObjectCanonical homeRole here
time-ordered evolutionTime Orderingfixes the product order
Magnus integrals and commutatorsMagnus Expansionsupplies the general method
one-period effective generatorFloquet–Magnus Expansionexplains the stroboscopic construction
quasienergy equivalence and Floquet modesFloquet Operatorsowns the physical branch interpretation
continuous branch tracking through resonancesFloquet Quasienergy Notebookowns spectral unwrapping
truncation error, structure checks, and downloadable datathis pagesupplies reproducible evidence

The Baker–Campbell–Hausdorff formulas below are included only to define the program. Follow the canonical Magnus pages for their derivation and wider range of applications.

Set ℏ=1\hbar=1 and the period T=1T=1. During the first half-period, apply a pulse about the xx axis; during the second, apply a pulse about the bisector of the xx and zz axes. The corresponding integrated generators are

X=−iησx,Y=−i(0.8η)σx+σz2.\begin{aligned} X &= -i\eta\sigma_x, \\ Y &= -i(0.8\eta) \frac{\sigma_x+\sigma_z}{\sqrt2}. \end{aligned}

Equivalently, the piecewise-constant Hamiltonian is

H(t)={2ησx,0≤t<12,1.6ησx+σz2,12≤t<1.H(t) = \begin{cases} 2\eta\sigma_x, &0\le t<\tfrac12, \\ 1.6\eta \dfrac{\sigma_x+\sigma_z}{\sqrt2}, &\tfrac12\le t<1. \end{cases}

The first pulse acts on the state first, so time ordering places its matrix on the right:

Uex(η)=eYeX.U_{\mathrm{ex}}(\eta) = e^Y e^X.

For a Pauli direction n\boldsymbol n with ∣n∣=1|\boldsymbol n|=1,

e−iαn⋅σ=cos⁡α I−isin⁡α n⋅σ.e^{-i\alpha\boldsymbol n\cdot\boldsymbol\sigma} = \cos\alpha\,I - i\sin\alpha\, \boldsymbol n\cdot\boldsymbol\sigma.

The exact benchmark therefore requires only products of analytic 2×22\times2 matrices. There is no time-step, quadrature, or ODE-solver error to hide the truncation error being measured.

The axes are neither parallel nor orthogonal, and the pulse areas are unequal. Consequently:

  • [Y,X]≠0[Y,X]\ne0, so time ordering matters;
  • reversing the pulses changes the leading commutator term;
  • the propagator is exactly unitary and exactly reproducible;
  • one parameter η\eta controls every homogeneous Magnus degree;
  • repeated periods create a clean test of coherent error accumulation;
  • the exact logarithm has the usual Floquet branch ambiguity.

If both pulses are instead placed along σx\sigma_x, every commutator vanishes and the first Magnus term is exact. The program retains that commuting case as a control.

For Uex=eYeXU_{\mathrm{ex}}=e^Ye^X, the homogeneous Baker–Campbell–Hausdorff terms through degree four are

Ω1=X+Y,Ω2=12[Y,X],Ω3=112([Y,[Y,X]]+[X,[X,Y]]),Ω4=−124[X,[Y,[Y,X]]].\begin{aligned} \Omega_1 &= X+Y, \\ \Omega_2 &= \frac12[Y,X], \\ \Omega_3 &= \frac1{12} \left( [Y,[Y,X]] + [X,[X,Y]] \right), \\ \Omega_4 &= -\frac1{24} [X,[Y,[Y,X]]]. \end{aligned}

The cumulative approximation through homogeneous degree rr is

UM[r]=exp⁡(∑j=1rΩj),r=1,2,3,4.U_M^{[r]} = \exp \left( \sum_{j=1}^{r}\Omega_j \right), \qquad r=1,2,3,4.

Because XX and YY are anti-Hermitian, every Ωj\Omega_j and every finite sum ∑j=1rΩj\sum_{j=1}^{r}\Omega_j is anti-Hermitian. Exponentiating the sum therefore preserves unitarity exactly in exact arithmetic.

This notation matters: Ω4\Omega_4 is the fourth homogeneous contribution, whereas UM[4]U_M^{[4]} contains all terms Ω1\Omega_1 through Ω4\Omega_4. Omitting lower-degree terms would not define a fourth-order approximation.

To separate structural preservation from local accuracy, the benchmark also retains the degree-two polynomial expansion of the exact product:

UD[2]=I+X+Y+12X2+YX+12Y2.\begin{aligned} U_D^{[2]} &= I+X+Y +\frac12X^2 \\ &\quad +YX +\frac12Y^2. \end{aligned}

This agrees with eYeXe^Ye^X through degree two in η\eta, but it is not the exponential of an anti-Hermitian matrix. Its operator error is O(η3)O(\eta^3) and its unitarity defect begins at higher order; neither quantity vanishes at finite η\eta.

For a 2×22\times2 matrix, the notebook uses the normalized Frobenius norm

∥A∥F,2≡∥A∥F2.\|A\|_{F,2} \equiv \frac{\|A\|_F}{\sqrt2}.

The one-period operator error and unitarity defect are

ϵr(η)=∥UM[r]−Uex∥F,2,δr(η)=∥(UM[r])†UM[r]−I∥F,2.\begin{aligned} \epsilon_r(\eta) &= \left\| U_M^{[r]}-U_{\mathrm{ex}} \right\|_{F,2}, \\ \delta_r(\eta) &= \left\| \left(U_M^{[r]}\right)^\dagger U_M^{[r]}-I \right\|_{F,2}. \end{aligned}

For nn periods, the comparison is made between powers of the one-period matrices:

ϵr(n)=∥(UM[r])n−Uexn∥F,2.\epsilon_r^{(n)} = \left\| \left(U_M^{[r]}\right)^n - U_{\mathrm{ex}}^n \right\|_{F,2}.

Starting from ∣0⟩|0\rangle, the observable-level check is

P(n)=∣⟨1∣Un∣0⟩∣2.P(n) = \left| \langle1|U^n|0\rangle \right|^2.

Operator error is phase-sensitive and state-independent. A single transition probability can be much less sensitive because different generator errors may project weakly onto the chosen state and observable.

If the cumulative generator is correct through degree rr, its first omitted term is O(ηr+1)O(\eta^{r+1}). Away from a logarithm singularity, the exponential map preserves that local order, so

ϵr(η)=O ⁣(ηr+1).\epsilon_r(\eta) = O\!\left(\eta^{r+1}\right).

The program fits log⁡ϵr\log\epsilon_r against log⁡η\log\eta over 0.010≤η≤0.0750.010\le\eta\le0.075. The observed powers reproduce the expected sequence.

Cumulative generatorExpected powerFitted powerError at η=0.32\eta=0.32
Ω1\Omega_121.9993885.6488×10−25.6488\times10^{-2}
Ω1+Ω2\Omega_1+\Omega_233.0016244.6804×10−34.6804\times10^{-3}
Ω1+Ω2+Ω3\Omega_1+\Omega_2+\Omega_343.9995991.1002×10−31.1002\times10^{-3}
Ω1+⋯+Ω4\Omega_1+\cdots+\Omega_455.0009171.7893×10−41.7893\times10^{-4}

Recovering the expected slope is stronger evidence than agreement at one coupling. A sign error in a nested commutator can still produce a small number at one point, but it generally destroys the fitted hierarchy.

One-period Magnus errors and unitarity defects across pulse scale

One-period benchmark for eYeXe^Ye^X. The upper panel shows the four cumulative Magnus errors. The lower panel contrasts the binary64 unitarity floor of the exponentiated fourth-degree truncation with the growing defect of the degree-two Dyson polynomial. The vertical line is the sufficient-bound threshold η=π/1.8\eta=\pi/1.8; it is not an accuracy contour.

All four Magnus approximations have maximum one-period unitarity defect 1.12×10−151.12\times10^{-15} over the full sweep 0.01≤η≤20.01\le\eta\le2. Their operator errors range from below 10−1110^{-11} to order unity. Exact structural preservation says that a computation stays on the unitary group; it does not say that it reaches the correct point on that group.

The Dyson control makes the distinction visible.

η\etaFourth-degree Magnus errorMagnus unitarity defectDyson errorDyson unitarity defect
0.051.61×10−81.61\times10^{-8}9.20×10−169.20\times10^{-16}1.12×10−41.12\times10^{-4}1.40×10−51.40\times10^{-5}
0.165.45×10−65.45\times10^{-6}2.81×10−162.81\times10^{-16}3.67×10−33.67\times10^{-3}1.47×10−31.47\times10^{-3}
0.321.79×10−41.79\times10^{-4}4.26×10−164.26\times10^{-16}2.92×10−22.92\times10^{-2}2.35×10−22.35\times10^{-2}
0.646.24×10−36.24\times10^{-3}5.69×10−175.69\times10^{-17}2.30×10−12.30\times10^{-1}3.76×10−13.76\times10^{-1}
1.505.19×10−15.19\times10^{-1}4.67×10−164.67\times10^{-16}2.642.6411.3411.34

The lesson is asymmetric. A large unitarity defect certifies a structural failure, but a tiny defect does not certify dynamical accuracy.

Reversing the pulses changes the exact propagator from eYeXe^Ye^X to eXeYe^Xe^Y. The leading average X+YX+Y is unchanged, while

12[Y,X]⟶12[X,Y]=−12[Y,X].\frac12[Y,X] \longrightarrow \frac12[X,Y] = -\frac12[Y,X].

The program verifies the sign reversal with Frobenius residual zero in binary64 for every sampled η\eta. The exact forward and reverse propagators differ by 0.028760.02876 at η=0.16\eta=0.16 and 0.413770.41377 at η=0.64\eta=0.64. Thus pulse order is not a cosmetic convention once the generators fail to commute.

As an independent control, replacing the second axis by σx\sigma_x gives [Y,X]=0[Y,X]=0. At η=0.9\eta=0.9, the first Magnus exponential then agrees with the exact product to 2.22×10−162.22\times10^{-16}, and the computed commutator norm is exactly zero.

These checks probe algebra rather than convergence. They can catch a mistaken matrix multiplication order even when a log-log slope happens to look plausible.

For a bounded matrix generator A(t)A(t), a standard sufficient condition for convergence of the Magnus series on an interval is

∫0T∥A(t)∥2 dt<π.\int_0^T \|A(t)\|_2\,dt \lt \pi.

Here the two pulse areas give

∫01∥A(t)∥2 dt=η+0.8η=1.8η,\int_0^1 \|A(t)\|_2\,dt = \eta+0.8\eta = 1.8\eta,

so the condition holds for

η<π1.8≈1.74533.\eta \lt \frac{\pi}{1.8} \approx 1.74533.

Three distinctions are essential.

  1. The condition is sufficient, not necessary. Its failure at η=2\eta=2 does not by itself prove divergence.
  2. It concerns convergence of the infinite Magnus series, not the accuracy of a fixed low-degree truncation.
  3. It does not imply that successive low-degree propagators improve monotonically.

At η=1.5\eta=1.5, where 1.8η=2.7<π1.8\eta=2.7<\pi, the third-degree operator error is 0.37750.3775 and the fourth-degree error is 0.51940.5194. The infinite series may converge while a particular early partial sum overshoots. A practical calculation still needs a truncation-error study.

The repeated-period test fixes η=0.16\eta=0.16 and computes

Uexn,(UM[r])n,1≤n≤200.U_{\mathrm{ex}}^n, \qquad \left(U_M^{[r]}\right)^n, \qquad 1\le n\le200.

Every matrix power remains unitary to floating-point precision. Nevertheless, a small error in the effective rotation angle or axis accumulates coherently.

Periods nnExact P(n)P(n)Third-degree operator errorFourth-degree operator errorFourth-degree probability error
10.0612776.96×10−56.96\times10^{-5}5.45×10−65.45\times10^{-6}2.15×10−62.15\times10^{-6}
100.1882881.23×10−41.23\times10^{-4}5.27×10−55.27\times10^{-5}3.88×10−53.88\times10^{-5}
250.1172521.03×10−41.03\times10^{-4}1.32×10−41.32\times10^{-4}7.85×10−57.85\times10^{-5}
500.4068901.93×10−41.93\times10^{-4}2.63×10−42.63\times10^{-4}2.31×10−42.31\times10^{-4}
1000.8795073.01×10−43.01\times10^{-4}5.26×10−45.26\times10^{-4}7.17×10−57.17\times10^{-5}
2000.0229492.93×10−42.93\times10^{-4}1.05×10−31.05\times10^{-3}2.95×10−42.95\times10^{-4}

The fourth-degree approximation wins clearly at one period, but its operator error exceeds the third-degree error by n=25n=25. Different truncations perturb the exact rotation angle and axis in different directions, so finite-time cancellation can reverse their ranking. The errors also oscillate rather than growing monotonically because all propagators remain on the compact group SU(2)SU(2).

Stroboscopic operator and transition-probability errors over 200 periods

Repeated-period errors at η=0.16\eta=0.16. The upper panel uses a state-independent operator norm; the lower panel uses the single transition probability P(n)=∣⟨1∣Un∣0⟩∣2P(n)=|\langle1|U^n|0\rangle|^2. Oscillations and crossings show why one-period order, long-time operator error, and one chosen observable are distinct diagnostics.

Writing the exact one-period unitary as

Uex=e−iHFTU_{\mathrm{ex}} = e^{-iH_FT}

does not determine a unique Hermitian HFH_F. If

Uex∣ϕa⟩=e−iϵaT∣ϕa⟩,U_{\mathrm{ex}}|\phi_a\rangle = e^{-i\epsilon_aT}|\phi_a\rangle,

then every replacement

ϵa⟶ϵa+2πkaT,ka∈Z,\epsilon_a \longrightarrow \epsilon_a + \frac{2\pi k_a}{T}, \qquad k_a\in\mathbb Z,

reconstructs the same one-period unitary.

At η=0.64\eta=0.64 and T=1T=1, the principal generator has quasienergies ϵ−=−1.0560023774\epsilon_-= -1.0560023774 and ϵ+=1.0560023774\epsilon_+=1.0560023774. Representative branches are

Lower shiftUpper shiftϵ−\epsilon_-ϵ+\epsilon_+Reconstruction error
00−1.056002-1.0560021.0560021.0560022.67×10−162.67\times10^{-16}
01−1.056002-1.0560027.3391887.3391887.36×10−167.36\times10^{-16}
115.2271835.2271837.3391887.3391881.76×10−151.76\times10^{-15}

The full nine-branch table, with independent shifts k−,k+∈{−1,0,1}k_-,k_+\in\{-1,0,1\}, has maximum reconstruction error 2.12×10−152.12\times10^{-15}. A matrix logarithm routine returning the principal branch has made a convention choice, not discovered a unique physical spectrum.

The Magnus series expanded continuously from η=0\eta=0 selects the logarithm branch analytic near the identity. Tracking a physically continuous branch through a quasienergy-zone boundary is a separate spectral problem; the Floquet Quasienergy Notebook treats that task directly.

The retained program aborts if any required check fails.

CheckResultInterpretation
fitted Magnus powers1.9994, 3.0016, 3.9996, 5.0009correct first omitted degrees
largest one-period Magnus unitarity defect1.12×10−151.12\times10^{-15}exponentiation preserves structure
largest exact-unitary defect4.44×10−164.44\times10^{-16}analytic product is numerically stable
largest exact determinant defect4.44×10−164.44\times10^{-16}propagators remain in SU(2)SU(2)
largest second-term reversal residual00pulse order gives the correct sign
commuting-control error2.22×10−162.22\times10^{-16}first term becomes exact when it should
Dyson defect at η=0.64\eta=0.640.375830.37583nonunitary control is visibly diagnostic
largest branch reconstruction error2.12×10−152.12\times10^{-15}shifted logarithms reproduce the same UFU_F
largest 200-period Magnus unitarity defect1.57×10−131.57\times10^{-13}repeated products show only roundoff-level drift

These checks are deliberately heterogeneous. Weak-drive slopes test truncation degree; pulse reversal tests algebra; commuting pulses test an exact limit; unitarity tests group structure; branches test logarithm conventions; stroboscopic powers test accumulated dynamical error.

Run the downloaded program from the folder where you saved it:

Terminal window
python magnus-expansion-error.py --output-dir results

The deterministic program uses NumPy only. Adding --plot generates optional Matplotlib quick-look plots, but the published SVG figures are rendered from the retained CSV tables with PGFPlots and TikZ.

ItemRetained setting
Python3.12.13 in the recorded production run
NumPy2.3.5
arithmeticIEEE 754 binary64 complex matrices
matrix size2×22\times2
sweep18 fixed η\eta values from 0.0100.010 to 2.0002.000
slope fitordinary least squares in log space for η≤0.075\eta\le0.075
stroboscopic runη=0.16\eta=0.16, n=1,…,200n=1,\ldots,200
branch runη=0.64\eta=0.64, shifts k−,k+∈{−1,0,1}k_-,k_+\in\{-1,0,1\}
randomnessnone
production runtime0.034 s on the recorded machine
program licenseMIT, identified by an SPDX header

The exact propagator, Pauli exponentials, and truncated generators are evaluated directly. No adaptive tolerance, hidden optimizer, numerical time step, or random seed influences the quoted values.

  • Wrong product order: if pulse AA acts first, its propagator belongs on the right of UBUAU_B U_A.
  • Term versus truncation confusion: Ω4\Omega_4 alone is not the generator through fourth degree.
  • Unitarity as certification: exponentiating any anti-Hermitian approximation gives a unitary matrix, including an inaccurate one.
  • Bound overinterpretation: ∫∥A∥dt<π\int\|A\|dt<\pi is a sufficient series-convergence condition, not a fixed-order error estimate.
  • Branch-blind generator comparison: two effective Hamiltonians can differ by spectral shifts of 2π/T2\pi/T and generate the same stroboscopic unitary.
  • One observable only: a transition probability can hide operator error through projection or cancellation.
  • One period only: a tiny local error may accumulate coherently over many cycles.
  • Near-cut ambiguity: the principal matrix logarithm changes discontinuously when an eigenphase crosses its branch cut.
  • Floating-point floor: unitarity defects near 10−1510^{-15} measure binary64 roundoff, not a physical approximation error.
  1. Replace the two-step cycle by a time-symmetric A/2A/2–BB–A/2A/2 sequence and verify the cancellation of the appropriate even Magnus contributions.
  2. Smooth the pulse discontinuity while preserving the integrated areas, then compare numerical time integration with the exact step-drive benchmark.
  3. Fit effective rotation-axis and rotation-angle errors separately to identify which component controls the long-time crossings.
  4. Track a continuous quasienergy branch as η\eta passes a principal-logarithm cut.
  5. Repeat the calculation in higher precision to separate matrix-exponential roundoff from asymptotic truncation error below 10−1410^{-14}.
  6. Extend the drive to a larger Hilbert space, where spectral crowding and operator-norm bounds become substantially more restrictive.

Evaluate Ω2=12[Y,X]\Omega_2=\tfrac12[Y,X] for the two pulse generators and identify its Pauli direction.

Solution

Using [σi,σj]=2iϵijkσk[\sigma_i,\sigma_j]=2i\epsilon_{ijk}\sigma_k,

[Y,X]=(−i)20.8η22[σx+σz,σx]=−0.8η22[σz,σx]=−i1.6η22σy.\begin{aligned} [Y,X] &= (-i)^2 \frac{0.8\eta^2}{\sqrt2} [\sigma_x+\sigma_z,\sigma_x] \\ &= -\frac{0.8\eta^2}{\sqrt2} [\sigma_z,\sigma_x] \\ &= -i\frac{1.6\eta^2}{\sqrt2} \sigma_y. \end{aligned}

Therefore

Ω2=−i0.8η22σy.\Omega_2 = -i\frac{0.8\eta^2}{\sqrt2} \sigma_y.

The leading time-ordering correction points along yy, perpendicular to the plane spanned by the two pulse axes. Reversing the pulses changes its sign.

Show that UM[r]U_M^{[r]} is unitary whenever the Hamiltonian is Hermitian, even before the Magnus series has converged to the exact propagator.

Solution

For Hermitian H(t)H(t), the differential generator A(t)=−iH(t)/ℏA(t)=-iH(t)/\hbar is anti-Hermitian. Integrals, real linear combinations, and commutators of anti-Hermitian matrices are anti-Hermitian in the combinations appearing in each Magnus term. Hence

(∑j=1rΩj)†=−∑j=1rΩj.\left( \sum_{j=1}^{r}\Omega_j \right)^\dagger = - \sum_{j=1}^{r}\Omega_j.

Writing the sum as KrK_r gives

(eKr)†eKr=eKr†eKr=e−KreKr=I.\begin{aligned} \left(e^{K_r}\right)^\dagger e^{K_r} &= e^{K_r^\dagger}e^{K_r} \\ &= e^{-K_r}e^{K_r} =I. \end{aligned}

No claim about eKr=Uexe^{K_r}=U_{\mathrm{ex}} was used. Structure preservation and approximation accuracy are logically separate.

Suppose the fourth-degree errors at η=0.16\eta=0.16 and η=0.32\eta=0.32 are 5.4470×10−65.4470\times10^{-6} and 1.7893×10−41.7893\times10^{-4}. Estimate the two-point convergence power.

Solution

For ϵ(η)∝ηp\epsilon(\eta)\propto\eta^p,

p=log⁡[ϵ(0.32)/ϵ(0.16)]log⁡(0.32/0.16).p = \frac{ \log \left[ \epsilon(0.32)/\epsilon(0.16) \right] }{ \log(0.32/0.16) }.

Substitution gives

p≈log⁡(32.85)log⁡2≈5.04.p \approx \frac{\log(32.85)}{\log2} \approx 5.04.

This is consistent with the expected O(η5)O(\eta^5) error. The production fit uses six points with η≤0.075\eta\le0.075 to reduce finite-coupling contamination.

The integrated norm is 1.8η1.8\eta. Classify η=1.5\eta=1.5 and η=2.0\eta=2.0 under the sufficient convergence condition, and state what can be concluded about the fourth-degree approximation.

Solution

At η=1.5\eta=1.5,

1.8η=2.7<π,1.8\eta=2.7<\pi,

so the standard sufficient condition guarantees convergence of the full Magnus series. It does not guarantee that fourth degree is accurate or better than third degree; the measured errors show that it is worse here.

At η=2.0\eta=2.0,

1.8η=3.6>π.1.8\eta=3.6>\pi.

The sufficient condition no longer applies. One cannot infer divergence from that failure, and one still must measure the truncation error directly.

At T=1T=1, shift only the upper principal quasienergy 1.05600237741.0560023774 by one Floquet zone. Find the new quasienergy and show why the one-period eigenvalue is unchanged.

Solution

One zone has width 2π/T=2π2\pi/T=2\pi, so

ϵ+′=1.0560023774+2π≈7.3391876846.\begin{aligned} \epsilon_+' &= 1.0560023774+2\pi \\ &\approx 7.3391876846. \end{aligned}

Its eigenvalue is

e−iϵ+′T=e−i(ϵ++2π)T=e−iϵ+Te−i2π=e−iϵ+T.\begin{aligned} e^{-i\epsilon_+'T} &= e^{-i(\epsilon_++2\pi)T} \\ &= e^{-i\epsilon_+T}e^{-i2\pi} \\ &= e^{-i\epsilon_+T}. \end{aligned}

The effective Hamiltonian changes, but the sampled one-period propagator does not.

For unitary matrices UU and VV, derive the bound ∥Un−Vn∥≤n∥U−V∥\|U^n-V^n\|\le n\|U-V\| for any unitarily invariant norm. Why can the measured error be much smaller or oscillatory?

Solution

Use the telescoping identity

Un−Vn=∑j=0n−1Un−1−j(U−V)Vj.U^n-V^n = \sum_{j=0}^{n-1} U^{n-1-j}(U-V)V^j.

Unitary invariance and the triangle inequality give

∥Un−Vn∥≤∑j=0n−1∥Un−1−j(U−V)Vj∥=n∥U−V∥.\begin{aligned} \|U^n-V^n\| &\le \sum_{j=0}^{n-1} \left\| U^{n-1-j}(U-V)V^j \right\| \\ &= n\|U-V\|. \end{aligned}

This is a worst-case upper bound. The matrix terms in the sum can point in different operator directions and partially cancel. On SU(2)SU(2), both evolutions are bounded rotations, so their separation can grow, shrink, and recur rather than increasing monotonically.

  1. W. Magnus, “On the exponential solution of differential equations for a linear operator,” Communications on Pure and Applied Mathematics 7, 649–673 (1954), doi:10.1002/cpa.3160070404.
  2. S. Blanes, F. Casas, J. A. Oteo, and J. Ros, “The Magnus expansion and some of its applications,” Physics Reports 470, 151–238 (2009), doi:10.1016/j.physrep.2008.11.001.
  3. P. C. Moan and J. Niesen, “Convergence of the Magnus series,” Foundations of Computational Mathematics 8, 291–301 (2008), doi:10.1007/s10208-007-9010-0.
  4. F. Casas, “Sufficient conditions for the convergence of the Magnus expansion,” Journal of Physics A: Mathematical and Theoretical 40, 15001–15017 (2007), doi:10.1088/1751-8113/40/50/006.
  5. N. J. Higham, Functions of Matrices: Theory and Computation, SIAM (2008), doi:10.1137/1.9780898717778.
  6. E. Hairer, C. Lubich, and G. Wanner, Geometric Numerical Integration, 2nd ed., Springer (2006), doi:10.1007/3-540-30666-8.
  7. M. Bukov, L. D’Alessio, and A. Polkovnikov, “Universal high-frequency behavior of periodically driven systems: from dynamical stabilization to Floquet engineering,” Advances in Physics 64, 139–226 (2015), doi:10.1080/00018732.2015.1055918.