Pith.

Numerical Analysis · arXiv:2611.17055 v1 · submitted 12 Nov 2026 · 52 references

Semiclassical Scaling Laws of Magnus Quantum Algorithms under Harmonic Confinement

Di Fang, Samuel Orellana Mateo

The paper says

“The simulation of semiclassical Schrödinger dynamics is often hindered by rapid oscillations, where classical numerical methods and quantum simulation algorithms can suffer severe precision loss as the semiclassical parameter ε → 0.”

more of the abstract

In this work, we uncover a surprising robustness of high-order Magnus quantum algorithms in the semiclassical regime. We establish two important results. First, we extend the theory of Magnus superconvergence from free-particle reference dynamics to a general class of Schrödinger operators whose reference Hamiltonian includes harmonic confinement. Second, and more importantly, we reveal a nontrivial semiclassical scaling law: while the expansion remainder term bound suggests an error prefactor of O(ε−(p + 1)) for a pth-order method, we prove that the loss is in fact order-independent and collapses to O(ε−1) for all p. The key analytical mechanism is the exact Egorov transport associated with quadratic flows in semiclassical Weyl quantization, which enables a symbol-level analysis of the interaction-picture Hamiltonian and its Magnus commutators. Our results show that high-order Magnus quantum algorithms remain far more robust in the semiclassical regime than naive series remainder term counting would suggest.

from the abstract

Pith says

Machine review · deepseek-v4-flash · 13 Nov 2026 · what was read was not recorded · not checked by a person

It can be wrong. Challenge this review or reply to it.

The passes disagreed. Reader: holds up. Skeptic: agrees with the reader. Referee: major revision.

5 major objections · 10 minor

How often objections from reviews like this one are right: not yet measured

Are you an author? What you can do.

Not checked: figures, code, what the 52 references say.

The paper says, at §3.3, Theorem 3.3

The review did not quote this passage.

Pith says: Objection 1 of 5 · major

The rescaling argument (lines 183–185) defines v_{s,h}(x,ξ) = V(cos(Ωs)x + h^{-1}Ω^{-1} sin(Ωs)ξ). The claim that all S(1) seminorms of v_{s,h} are bounded uniformly in s, h, and ε relies on the fact that the coefficients cos(Ωs) and h^{-1}Ω^{-1} sin(Ωs) are bounded by 1 for 0 ≤ s ≤ h ≤ 1.

more of objection 1

However, the symbol class S(1) requires boundedness of all derivatives. The derivative ∂_ξ v_{s,h} introduces a factor h^{-1} from the chain rule: ∂_ξ v_{s,h} = (∇V)(...) · (h^{-1}Ω^{-1} sin(Ωs)). Since sin(Ωs) ∼ Ωs for small s, the product h^{-1} sin(Ωs) is bounded by 1, but the derivative with respect to ξ of the argument is h^{-1}Ω^{-1} sin(Ωs), which is O(1) uniformly. However, higher derivatives in ξ will bring additional powers of h^{-1}Ω^{-1} sin(Ωs), which are still O(1) because each factor is bounded by 1. Similarly, derivatives in x bring factors cos(Ωs) which are O(1). So the uniform boundedness in S(1) seems plausible. But the argument should be made more explicit: the authors should state that the S(1) seminorms of v_{s,h} are bounded by constants depending only on V and the matrix A, independent of s, h, ε. The current text says 'It follows that all S(1) seminorms of v_{s,h} are bounded uniformly in s, h, and ε.' This is a claim, not a proof. A short justification would strengthen the paper.

The paper says, at §3.3, Theorem 3.3

The review did not quote this passage.

Pith says: Objection 2 of 5 · major

The proof of Theorem 3.3 uses the Moyal bracket identity with semiclassical parameter εh. The nested commutator of grade q is expressed as ε^{-q} (εh)^{q-1} op_{εh}(c_q), where c_q is uniformly bounded in S(1). The factor ε^{-q} comes from the ε^{-1} scaling of each H_I(τ) in the commutator.

more of objection 2

The factor (εh)^{q-1} comes from the q-1 commutator brackets, each contributing a factor εh from the Moyal bracket. The product is ε^{-q} (εh)^{q-1} = ε^{-1} h^{q-1}. This is correct. However, the claim that c_q is uniformly bounded in S(1) requires justification. The Moyal bracket of two S(1) symbols is in S(1) with seminorms controlled by the seminorms of the factors, uniformly in the semiclassical parameter when the parameter is ≤ 1. Since the symbols v_{s,h} are uniformly bounded in S(1), repeated Moyal brackets produce symbols in S(1) with seminorms bounded by constants depending only on q and the S(1) seminorms of V. The authors should mention this standard property of the Moyal bracket (or cite a reference). Without it, the step is incomplete.

The paper says, at §3.4, Lemma 3.4

The review did not quote this passage.

Pith says: Objection 3 of 5 · major

Lemma 3.4 is quoted from [33] but the statement here is slightly different: it gives a bound with a sum from q=p+1 to p^2+2p, with coefficients α_{comm,q} h^q. In [33], the local error bound for the p-th order Magnus method is given in terms of the maximal norms of nested commutators of grade q, with a factor h^q.

more of objection 3

The sum range p+1 to p^2+2p comes from the fact that the Magnus expansion truncated at order p has remainder terms of grade at least p+1, and the number of terms in the Magnus series up to order p is finite. The authors should verify that the range p^2+2p is correct and matches the reference. Also, the constant C_p in front of the sum should be defined. The paper says 'C_p' but does not specify its dependence. This is a minor issue but should be clarified.

This objection may describe the copy Pith gave the reviewer, not the paper.

The paper says, at §5, Numerical Experiments

The review did not quote this passage.

Pith says: Objection 4 of 5 · major

The numerical experiments are performed in one spatial dimension with a specific choice of potentials (U(x)=x^2/ε? Actually the paper says A_ε = -ε^2 Δ + (1/ε) x^2, which is not the same as the harmonic oscillator with matrix A. The potential is (1/ε)x^2, which is ε-dependent.

more of objection 4

This is a different scaling than the one analyzed in the theory (where U(x) = (1/2) x^T A x with A independent of ε). The authors should explain why this scaling is used and whether it is consistent with the assumptions of Theorem 2.1. The theory assumes U(x) = (1/2) x^T A x with A independent of ε. The numerical test uses a potential that scales as 1/ε, which would change the semiclassical scaling. This discrepancy should be addressed. If the numerical results still confirm the ε^{-1} prefactor, that is interesting but the setup should be justified.

The paper says, at §5.1, Figure 4

The review did not quote this passage.

Pith says: Objection 5 of 5 · major

Figure 4 shows the ε-scaling of nested commutator norms for grades 2-5. The plots show a clear ε^{-1} scaling. However, the caption says 'grade 2' through 'grade 5', but Theorem 3.3 is for q ≥ 2. Grade 2 corresponds to a single commutator [H_I(τ1), H_I(τ2)], which should scale as ε^{-1} h^{1} (since q-1=1).

more of objection 5

The ε-scaling should be ε^{-1} independent of grade. The numerical results confirm this. This is good. However, the paper should also verify the h-scaling for these grades, which is done in Figures 2 and 3. The combination supports the theorem.

10 minor objections

The paper says, at §1, Introduction

Pith says: minor objection 1 of 10

Line 27: 'the exactly reference Hamiltonian' should be 'the exact reference Hamiltonian'.

The paper says, at §2, Equation (2.2)

Pith says: minor objection 2 of 10

The definition of U(x) = (1/2) x^T A x uses a matrix A. Later in the numerical section, the potential is (1/ε) x^2, which is not of this form unless A = (2/ε) I. This inconsistency should be clarified.

show 8 more

The paper says, at §3.2, Lemma 3.1

Pith says: minor objection 3 of 10

The proof of Lemma 3.1 is given for Schwartz symbols a ∈ S(R^{2d}). The extension to S(1) is done in Theorem 3.2 via a cutoff argument. However, Lemma 3.1 itself is stated for a ∈ S(R^{2d}) but the proof uses integration by parts and Schwartz decay. The authors should note that the identity extends to S(1) by density or by the same cutoff argument. This is a minor point.

The paper says, at §3.3, Theorem 3.3

Pith says: minor objection 4 of 10

The constant C_{q,T} in (3.10) depends on T, but the bound is uniform over the interval [t_j, t_{j+1}] of length h. The dependence on T likely comes from the fact that the classical flow Φ_t has coefficients that are periodic in t with period 2π/Ω, so the bound is actually independent of T for large T? The authors should comment on whether the constant grows with T or is bounded due to the oscillatory nature of the flow.

The paper says, at §4, Circuit Description

Pith says: minor objection 5 of 10

The circuit description is sketchy and refers to prior work for details. This is acceptable since the focus is on error analysis. However, the authors should clarify that the circuit implementation does not affect the error bounds derived in the semi-discrete setting. The sentence 'The circuit construction itself is unchanged, and its efficiency is inherited in this case.' (lines 82-83) is sufficient.

The paper says, at §5, Numerical Experiments

Pith says: minor objection 6 of 10

The paper uses a finite-difference discretization of the Laplacian and periodic boundary conditions. The theory assumes the continuous Schrödinger equation on R^d. The discretization error is not analyzed. The authors acknowledge this in line 249: 'This estimate concerns circuit implementation; spatial discretization error is separate.'

more of objection 6

However, the numerical experiments should also discuss the effect of spatial discretization on the observed scalings. The fact that the curves overlap for different N suggests that the discretization error is negligible for the chosen parameters.

The paper says, at §5.2, Figure 5

Pith says: minor objection 7 of 10

The figure shows error vs. h for first- and second-order Magnus algorithms. The slopes are approximately 2 and 4, confirming superconvergence. The plot uses ε=1/4. It would be helpful to also show results for smaller ε to confirm that the ε^{-1} prefactor does not affect the h-scaling.

The paper says, at §5.3, Figure 6

Pith says: minor objection 8 of 10

The figure shows error vs. ε for fixed h=1/4. The error scales as ε^{-1} for both first- and second-order methods. This confirms the order-independent prefactor. However, the error for ε=1 is computed on a larger domain, which may affect the comparison. The authors should explain why the domain is enlarged and whether this could introduce additional errors.

The paper says, at General

Pith says: minor objection 9 of 10

The paper uses the notation H_I(t) for the interaction-picture Hamiltonian and H^ε_I for the scaled version (H^ε_I = ε^{-1} H_I). In the main theorem and proofs, the commutators involve ε^{-1} H_I. The notation is consistent but could be confusing. A brief reminder after equation (2.5) would help.

The paper says, at References

Pith says: minor objection 10 of 10

Reference [31] is 'Apel, Cubitt, Onorati, arXiv:2509.18312 (2025)'. This is a very recent preprint. The authors should verify that it is relevant and correctly cited.

What would settle it

Independently recompute the operator norm of a grade-4 nested commutator (e.g., [H_I(t1), [H_I(t2), [H_I(t3), H_I(t4)]]]) for a 2D harmonic oscillator with A = diag(1,2) and V(x) = sin(x1)cos(x2), using spectral discretization with N=256 per dimension, ε=0.1, h=0.05, and verify that the norm scales as ε^{-1} h^3 within a factor of 2 of the bound constant C_{4,T} from Theorem 3.3.

from the skeptic's reading

How the review went

3 readings by deepseek-v4-flash · 13 Nov 2026

  1. Reader holds up confidence high
  2. Skeptic agrees 9 s · 22,103 tokens read, 683 written
  3. Referee major revision: 5 major objections, 10 minor 24 s · 22,502 tokens read, 2,763 written

Not run on this paper: the editor, the simulated authors' defence.

Pith did not check this review's objections against the paper.

The review in full

The strongest objection

The paper's central claim—that the semiclassical error prefactor for p-th order Magnus quantum algorithms collapses to ε^{-1} independent of p—is well-supported by the analysis. The key analytical step is Theorem 3.3, which uses exact Egorov transport for quadratic Hamiltonians to bound nested commutators. The proof of Theorem 3.3 relies on the rescaling argument (lines 183–185) that treats εh as the effective semiclassical parameter, and the claim that the rescaled symbols v_{s,h} remain uniformly bounded in S(1). This step is valid because the classical flow Φ_t is linear with bounded coefficients, and the rescaling ξ → ξ/h is a linear change of momentum variable that preserves the S(1) class when h ≤ 1. The Calderón–Vaillancourt theorem then gives uniform operator bounds. The derivation is internally consistent and the assumptions (smooth bounded potential V ∈ S(1), quadratic H0) are clearly stated. The numerical experiments in Section 5 confirm both the h^{q-1} scaling and the ε^{-1} prefactor for grades q=3–6. The paper acknowledges that the result is limited to harmonic confinement (quadratic reference Hamiltonian) and bounded potentials, which is an honest scope condition rather than a hidden flaw. The circuit description in Section 4 is a sketch but is not central to the mathematical claim; the error analysis is semi-discrete and independent of the circuit implementation details. No internal inconsistency or unsupported leap was found.

The reader identified the weakest assumption as the restriction to quadratic reference Hamiltonians and bounded potentials. This is indeed the scope condition, but the paper states it clearly (Assumption 1, Theorem 3.2) and does not claim generality beyond it. The reader's verdict of ACCEPT with high confidence is appropriate. The stress-test found no hidden flaw: the Egorov transport argument is rigorous for quadratic H0, the symbol class S(1) is preserved under the linear flow, the rescaling trick in Theorem 3.3 is valid, and the Calderón–Vaillancourt theorem applies uniformly. The numerical experiments support the theory. The paper's own limitations (spatial discretization error separate, circuit description restricted to 1D) are honestly stated. No load-bearing concern was identified that would warrant changing the verdict.

The referee's report

If the results hold, they are significant for quantum simulation in the semiclassical regime. The order-independent ε^{-1} prefactor is a surprising and practically important finding, showing that high-order Magnus methods are far more robust than naive analysis suggests. The extension of superconvergence to harmonic confinement broadens the applicability of these methods. The analytical technique (exact Egorov transport for quadratic flows) is elegant and may be useful for other problems. The paper is well-written and the proofs appear rigorous.

Pith's reading of the paper (a machine's summary, not the authors')

This paper proves that high-order Magnus quantum algorithms applied to the semiclassical Schrödinger equation with harmonic confinement suffer only an $ε^{{-1}}$ prefactor in the global L2 error, not the $ε^{{-(p+1)}}$ factor that naive commutator counting would predict. The result holds for all Magnus orders p and yields doubled-order (2p) convergence in the time step h. The key insight is that exact Egorov transport for quadratic Hamiltonians lets the authors track the interaction-picture Hamiltonian at the symbol level, revealing that nested commutators gain an extra power of h per layer while contributing only one factor of $ε^{{-1}}$ regardless of depth. If correct, the paper shows that high-order Magnus methods are far more efficient in the semiclassical regime than previously believed, making them practical for simulating confined quantum systems with rapid oscillations.

What carries the argument. The central object is the exact Egorov transport for quadratic Hamiltonians (Theorem 3.2), which states that the Heisenberg evolution of a Weyl-quantized observable under the harmonic oscillator reference Hamiltonian is exactly the quantization of the classically transported symbol: $e^{{itH_0/ε}}$ op_ε(a) $e^{{-itH_0/ε}}$ = op_ε(a∘Φ_t). This identity, combined with the Moyal bracket formula for commutators of Weyl operators, lets the authors work entirely at the symbol level. Because the classical flow Φ_t is linear with bounded coefficients, the transported symbol V∘Φ_t stays in the bounded symbol class S(1). The Calderón–Vaillancourt theorem then converts uniform symbol bounds into operator norm bounds that are independent of ε. When analyzing nested Magnus commutators, each additional bracket introduces an εh factor (from the Moyal bracket with effective semiclassical parameter εh) and an h factor from time integration, so a grade-q commutator scales as $ε^{{-1}}$ $h^{{q-1}}$ rather than $ε^{{-(q)}}$.

Core claim. The authors establish that for a p-th order Magnus quantum algorithm applied to the semiclassical Schrödinger equation with a harmonic reference potential and a smooth bounded interaction, the global L2 error is bounded by C $ε^{{-1}}$ $h^{{2p}}$ ||ψ_0||. This simultaneously demonstrates two surprising features: the convergence order is doubled from p to 2p (superconvergence), and the semiclassical prefactor is $ε^{{-1}}$ independent of p, in stark contrast to the $ε^{{-(p+1)}}$ scaling suggested by counting commutators in the Magnus expansion. The mechanism is the exact Egorov transport for quadratic flows, which keeps the transported symbol in the class S(1) and allows the semiclassical commutator structure to collapse all orders to the same $ε^{{-1}}$ scale.

The premise it rests on. The reference Hamiltonian must be exactly quadratic (harmonic oscillator) so that the classical flow is linear and the Egorov transport is exact; the interaction potential must be smooth and bounded with all derivatives bounded (S(1) symbol class).

If the paper is right (Pith's inferences, not the authors')

High-order Magnus quantum algorithms become practical for semiclassical simulations with harmonic confinement, since the ε^{-1} prefactor does not worsen with increasing order p.

The superconvergence phenomenon (doubled order) extends beyond free-particle reference dynamics to any system whose reference Hamiltonian is exactly quadratic, greatly broadening the applicability of these methods.

The error bound C ε^{-1} h^{2p} implies that to achieve a given accuracy, the number of time steps scales as O(ε^{-1/(2p)}), which for moderate p is much milder than the O(ε^{-(p+1)/(p)}) scaling that naive counting would suggest.

The symbolic analysis technique—exact Egorov transport plus Moyal bracket—provides a template for analyzing other quantum algorithms in the semiclassical regime where the reference Hamiltonian is quadratic or more generally exactly solvable via classical flow.

The ε^{-1} prefactor is likely optimal for this problem class, because the interaction-picture generator carries an explicit 1/ε factor and the potential V is bounded; any weaker dependence would require additional smoothing or structure.

The restriction to bounded potentials (S(1) symbol class) excludes Coulomb potentials and other singular interactions. Extending the analysis to singular potentials would require a different symbol class and possibly a refined Egorov theorem, and would be a natural next step.

The symbolic collapse of the ε scaling suggests that similar order-independent prefactors may hold for other interaction-picture methods (e.g., truncated Dyson series) when the reference Hamiltonian is quadratic, though the paper notes that Dyson series do not exhibit this collapse.

The circuit implementation described for the 1D harmonic oscillator can be generalized to higher-dimensional quadratic Hamiltonians using the same exact factorization, potentially enabling efficient quantum simulation of a wide class of confined semiclassical systems.

Check this review

Pith stored no record of this review's passes and took no fingerprint of it. Reviews made by code from 13 Nov 2026 on carry both.

How often reviews like this one are right

Reviews like this one: written by deepseek-v4-flash, where what was read was not recorded.

How often objections from reviews like this one are right: not yet measured

Every value above, in the review's public record (JSON)

Reviews by people

This review was written by a machine. No person has reviewed this paper on Pith yet. A scientist listed on Pith can review it for a fee, and their review is published here whatever it concludes.

Request a human review

How Pith checks papers · The full audit of this paper

The paper

Abstract

The simulation of semiclassical Schrödinger dynamics is often hindered by rapid oscillations, where classical numerical methods and quantum simulation algorithms can suffer severe precision loss as the semiclassical parameter ε → 0. In this work, we uncover a surprising robustness of high-order Magnus quantum algorithms in the semiclassical regime. We establish two important results. First, we extend the theory of Magnus superconvergence from free-particle reference dynamics to a general class of Schrödinger operators whose reference Hamiltonian includes harmonic confinement. Second, and more importantly, we reveal a nontrivial semiclassical scaling law: while the expansion remainder term bound suggests an error prefactor of O(ε−(p + 1)) for a pth-order method, we prove that the loss is in fact order-independent and collapses to O(ε−1) for all p. The key analytical mechanism is the exact Egorov transport associated with quadratic flows in semiclassical Weyl quantization, which enables a symbol-level analysis of the interaction-picture Hamiltonian and its Magnus commutators. Our results show that high-order Magnus quantum algorithms remain far more robust in the semiclassical regime than naive series remainder term counting would suggest.

The paper's own sentences, arranged, kept beside the review and separate from it. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. No sentence in this record was written by a model.

abstract compiled · 2026-11-14

The authors' main claim, as the classifier picked it out 0.61

“Our results show that high-order Magnus quantum algorithms remain far more robust in the semiclassical regime than naive series remainder term counting would suggest.”

How the main claim is stated: asserted 1.00

What the abstract itself states, as probabilities: claims first 0.08 · states limitation 0.17 · human participants 0.01 · controlled comparison 0.12 · randomized assignment 0.01 · states quantitative result 0.96 · compares with prior results 0.78 · mentions code or data availability 0.02

The abstract, sentence by sentence

This table labels the abstract only (arXiv listing abstract v1). The number is the probability the classifier gave the label.

SentenceRoleThe authors' own workStates the main conclusionStrength
The simulation of semiclassical Schr\"odinger dynamics is often hindered by rapid oscillations, where classical numerical methods and quantum simulation algorithms can suffer severe precision loss as the semiclassical parameter $\varepsilon \to 0$. background 1.00 0.05 0.02 asserted 0.91
In this work, we uncover a surprising robustness of high-order Magnus quantum algorithms in the semiclassical regime. result 0.68 0.95 0.54 asserted 1.00
We establish two important results. contribution 0.89 0.60 0.02 asserted 0.68
First, we extend the theory of Magnus superconvergence from free-particle reference dynamics to a general class of Schr\"odinger operators whose reference Hamiltonian includes harmonic confinement. contribution 0.71 0.95 0.08 asserted 1.00
Second, and more importantly, we reveal a nontrivial semiclassical scaling law: while the expansion remainder term bound suggests an error prefactor of $O(\varepsilon^{-(p+1)})$ for a $p$th-order method, we prove that the loss is in fact order-independent and collapses to $O(\varepsilon^{-1})$ for all $p$. result 1.00 0.95 0.85 asserted 1.00
The key analytical mechanism is the exact Egorov transport associated with quadratic flows in semiclassical Weyl quantization, which enables a symbol-level analysis of the interaction-picture Hamiltonian and its Magnus commutators. method 0.95 0.67 0.05 asserted 1.00
Our results show that high-order Magnus quantum algorithms remain far more robust in the semiclassical regime than naive series remainder term counting would suggest. interpretation 0.95 0.94 0.74 asserted 1.00

What kind of paper the classifier reports this is: theoretical result 1.00 · evidence from proof or derivation 1.00

What was examined, and what was not

Sources read

  • arXiv listing abstract v1

Not examined

  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers

Levels run

  • P abstract

Not run

  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

How the labels were made

Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-11-14: 1 request, 5,776 input tokens.

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. This record as JSON

Figures (6)
Figure 1 of the paper
Figure 1. Quantum circuits for the harmonic-oscillator interaction picture. Top: the circuit for the
Figure 2 of the paper
Figure 2. Scaling in the step size h for the grade-p nested commutators with ε = 1. The observed slopes agree with the superconvergent scaling predicted by Theorem 3.3. The p-th grade commuta￾tor has an operator norm upper bounded by the s p−1 scaling with an error prefactor independent of the spatial grid number N. 5.3. Algorithmic Error for Semiclassical scaling. We then study the dependence of the algorithmic error on the semiclassical parameter ε. In this experiment we fix T = 1, the step size h = 1/4, and use the first- and second-order Magnus algorithms with nsteps = 4 and nquad = 8192.…
Figure 3 of the paper
Figure 3. Scaling in the step size h for the grade-p nested commutators with ε = 0.25. The observed slopes agree with the superconvergent scaling predicted by Theorem 3.3. The p-th grade commutator has an operator norm upper bounded by the s p−1 scaling with an error prefactor insensitive to the spatial grid number N for N large enough resolving the oscillatory dynamics. where Cε is the normalization constant ensuring that the L 2 norm of the wave function is 1, so that it is a valid quantum state. For ε = 1, however, the wave packet is less localized and propagates farther, so we enlarge the…
Figure 4 of the paper
Figure 4. Scaling in the semiclassical parameter ε for the nested commutators under harmonic confinement, shown for two different time-step sizes. The observed ε-dependence remains of order ε −1 and is insensitive to the commutator grade. 6. Conclusion and Discussion. Conceptually, our results show that superconvergence of Magnus quantum algorithms is not a peculiarity of free Schr¨odinger propagation. It persists under a fundamental class of confined semiclassical dynamics, and its true semiclassical scaling is governed by geometric and symbolic structure rather than by formal commutator…
Figure 5 of the paper
Figure 5. Solution error versus the time-step size
Figure 6 of the paper
Figure 6. Solution error versus the semiclassical parameter

Figures are the authors', reproduced from the paper.

References (52)
  1. [33] Di Fang, Diyi Liu, and Shuchen Zhu. High-order magnus expansion for hamiltonian simulation, on Pith
  2. [1] Caroline Lasser and Christian Lubich. Computing quantum dynamics in the semiclassical SEMICLASSICAL SCALING LA WS OF MAGNUS QUANTUM ALGORITHMS21 10 1 100 time step size h 10 8 10 7 10 6 10 5 10 4 10 3 10 2 10 1 100 error q-Magnus 2 q-Magnus 1 ref scaling h2 ref scaling h4 Figu... on Pith
  3. [2] Shi Jin, Peter Markowich, and Christof Sparber. Mathematical and computational methods for semiclassical Schr¨ odinger equations.Acta Numer., 20:121–209, 2011 on Pith
  4. [3] Weizhu Bao and Yongyong Cai. Mathematical theory and numerical methods for Bose-Einstein condensation.Kinetic & Related Models, 6(1):1–135, 2013 on Pith
  5. [4] C. Lubich.From quantum to classical molecular dynamics: reduced models and numerical analysis. European Mathematical Society, 2008 on Pith
  6. [5] Sergio Blanes and Fernando Casas.A concise introduction to geometric numerical integration. CRC Press, 2017 on Pith
  7. [6] R´ emi Carles.Semi-Classical Analysis for Nonlinear Schr¨ odinger Equations: WKB Analysis, Focal Points, Coherent States. World Scientific Publishing, Singapore, 2 edition, 2020 on Pith
  8. [7] Shi Jin, Xiantao Li, and Nana Liu. Quantum simulation in the semi-classical regime.Quantum, 6:739, June 2022 on Pith
  9. [8] Yonah Borns-Weil and Di Fang. Uniform observable error bounds of trotter formulae for the semiclassical schr¨ odinger equation.Multiscale Modeling & Simulation, 23(1):255–277, 2025 on Pith
  10. [9] Di Fang and Albert Tres Vilanova. Observable error bounds of the time-splitting scheme for quantum-classical molecular dynamics.SIAM J. Numer. Anal., 61(1):26–44, 2023 on Pith
  11. [10] Di Fang and Conrad Qu. Uniform semiclassical observable error bound of trotter–suzuki splitting: A simple algebraic proof.SIAM Journal on Numerical Analysis, 64(3):876–899, 2026 on Pith
  12. [11] Di Fang, Shi Jin, and Christof Sparber. An efficient time-splitting method for the ehrenfest dynamics.Multiscale Modeling & Simulation, 16(2):900–921, 2018 on Pith
  13. [12] Philipp Bader, Arieh Iserles, Karolina Kropielnicka, and Pranav Singh. Effective approxima- tion for the semiclassical Schr¨ odinger equation.Foundations of Computational Mathematics, 14(4):689–720, 2014 on Pith
  14. [13] Philipp Bader, Arieh Iserles, Karolina Kropielnicka, and Pranav Singh. Efficient methods for linear Schr¨ odinger equation in the semiclassical regime with time-dependent potential. Proceedings of the Royal Society A, 472(2193):20150733, 2016 on Pith
  15. [14] Arieh Iserles, Karolina Kropielnicka, and Pranav Singh. Solving Schr¨ odinger equation in semi- classical regime with highly oscillatory time-dependent potentials.Journal of Computational Physics, 376:564–584, 2019 on Pith
  16. [15] Pranav Singh. Algebraic theory for higher-order methods in computational quantum mechan- ics, 2015 on Pith
  17. [16] Weizhu Bao, Shi Jin, and Peter A. Markowich. Numerical study of time-splitting spectral discretizations of nonlinear Schr¨ odinger equations in the semiclassical regimes.SIAM Journal on Scientific Computing, 25(1):27–64, 2003 on Pith
  18. [17] Weizhu Bao, Dieter Jaksch, and Peter A. Markowich. Numerical solution of the Gross– Pitaevskii equation for Bose–Einstein condensation.Journal of Computational Physics, 187(1):318–342, 2003 on Pith
  19. [18] R´ emi Carles. On Fourier time-splitting methods for nonlinear Schr¨ odinger equations in the semiclassical limit.SIAM Journal on Numerical Analysis, 51(6):3232–3258, 2013 on Pith
  20. [19] R´ emi Carles and Cl´ ement Gallo. On Fourier time-splitting methods for nonlinear Schr¨ odinger equations in the semi-classical limit II. Analytic regularity.Numerische Mathematik, 136(1):315–342, 2017 on Pith
show 32 more
  1. [20] Erwan Faou and Christian Lubich. A Poisson integrator for Gaussian wavepacket dynamics. Computing and Visualization in Science, 9(2):45–55, 2006. SEMICLASSICAL SCALING LA WS OF MAGNUS QUANTUM ALGORITHMS23 on Pith
  2. [21] Shi Jin, Hao Wu, and Xu Yang. Gaussian beam methods for the Schr¨ odinger equation in the semi-classical regime: Lagrangian and Eulerian formulations.Communications in Mathemati- cal Sciences, 6(4):995–1020, 2008 on Pith
  3. [22] Erwan Faou, Vasile Gradinaru, and Christian Lubich. Computing semiclassical quantum dy- namics with Hagedorn wavepackets.SIAM Journal on Scientific Computing, 31(4):3027–3041, 2009 on Pith
  4. [23] W. Bao, S. Jin, and P. A. Markowich. On time-splitting spectral approximations for the Schr¨ odinger equation in the semiclassical regime.J. Comput. Phys., 175(2):487–524, 2002 on Pith
  5. [24] Fran¸ cois Golse, Shi Jin, and Thierry Paul. On the convergence of time splitting methods for quantum dynamics in the semiclassical regime.Foundations of Computational Mathematics, 21(3):613–647, 2021 on Pith
  6. [25] Weizhu Bao, Ying Ma, and Chushan Wang. Optimal error bounds on time-splitting methods for the nonlinear schr¨ odinger equation with low regularity potential and nonlinearity.Mathematical Models and Methods in Applied Sciences, 34(05):803–844, 2024 on Pith
  7. [26] Marlis Hochbruck and Christian Lubich. On Magnus integrators for time-dependent Schr¨ odinger equations.SIAM J. Numer. Anal., 41(3):945–963, 2003 on Pith
  8. [27] Mechthild Thalhammer. A fourth-order commutator-free exponential integrator for nonau- tonomous differential equations.SIAM Journal on Numerical Analysis, 44(2):851–864, 2006 on Pith
  9. [28] Sergio Blanes, Fernando Casas, and Mechthild Thalhammer. High-order commutator-free quasi-magnus exponential integrators for non-autonomous linear evolution equations.Com- puter Physics Communications, 220:243–262, 2017 on Pith
  10. [29] Sergio Blanes, Fernando Casas, Jose-Angel Oteo, and Jos´ e Ros. The magnus expansion and some of its applications.Physics reports, 470(5-6):151–238, 2009 on Pith
  11. [30] Ernst Hairer, Marlis Hochbruck, Arieh Iserles, and Christian Lubich. Geometric numerical integration.Oberwolfach Reports, 3(1):805–882, 2006 on Pith
  12. [31] Harriet Apel, Toby Cubitt, and Emilio Onorati. A sharper magnus expansion bound woven in binary branches, 2025. arXiv:2509.18312 on PithPith's reviewarXiv
  13. [32] Di Fang, Diyi Liu, and Rahul Sarkar. Time-dependent hamiltonian simulation via magnus ex- pansion: Algorithm and superconvergence.Communications in Mathematical Physics, 406(6), May 2025 on Pith
  14. [34] Yonah Borns-Weil, Di Fang, and Jiaqi Zhang. Discrete superconvergence analysis for quantum magnus algorithms of unbounded hamiltonian simulation.Communications in Mathematical Physics, 407(2), January 2026 on Pith
  15. [35] Di Fang and Jiaqi Zhang. Superconvergence of high-order magnus quantum algorithms, 2025. arXiv:2509.22897 on PitharXiv
  16. [36] Dong An, Di Fang, and Lin Lin. Time-dependent hamiltonian simulation of highly oscillatory dynamics and superconvergence for schr¨ odinger equation.Quantum, 6:690, 2022 on Pith
  17. [37] Diyi Liu, Hanyu Wang, Shuchen Zhu, Jason Cong, Wibe A. de Jong, Di Fang, Zhen Huang, Costin Iancu, and Chao Yang. Logical resource estimation for quantum state preparation with compilation, 2026. arXiv:2605.18877 on PithPith's reviewarXiv
  18. [38] Pablo Antonio Moreno Casares, Modjtaba Shokrian Zini, and Juan Miguel Arrazola. Quantum simulation of time-dependent hamiltonians via commutator-free quasi-magnus operators, 2024. arXiv:2403.13889 on PithPith's reviewarXiv
  19. [39] Kunal Sharma and Minh C. Tran. Hamiltonian simulation in the interaction picture using the 24DI F ANG AND SAMUEL ORELLANA MATEO magnus expansion, 2024. arXiv:2404.02966 on PithPith's reviewarXiv
  20. [40] Jan Lukas Bosse, Andrew M Childs, Charles Derby, Filippo Maria Gambetta, Ashley Monta- naro, and Raul A Santos. Efficient and practical hamiltonian simulation from time-dependent product formulas.Nature Communications, 16(1):2673, 2025 on Pith
  21. [41] G. H. Low and N. Wiebe. Hamiltonian simulation in the interaction picture. 2019. arXiv:1805.00675 on PithPith's reviewarXiv
  22. [42] D. W. Berry, A. M. Childs, R. Cleve, R. Kothari, and R. D. Somma. Simulating Hamiltonian dynamics with a truncated Taylor series.Phys. Rev. Lett., 114:090502, 2015 on Pith
  23. [43] M´ aria Kieferov´ a, Artur Scherer, and Dominic W. Berry. Simulating the dynamics of time- dependent hamiltonians with a truncated dyson series.Physical Review A, 99(4), Apr 2019 on Pith
  24. [44] D. W. Berry, A. M. Childs, Y. Su, X. Wang, and N. Wiebe. Time-dependent Hamiltonian simulation withl 1-norm scaling.Quantum, 4:254, 2020 on Pith
  25. [45] Jacob Watkins, Nathan Wiebe, Alessandro Roggero, and Dean Lee. Time-dependent hamil- tonian simulation using discrete-clock constructions.PRX Quantum, 5(4):040316, 2024 on Pith
  26. [46] Zecheng Li and Chunhao Wang. Time-dependent hamiltonian simulation via time-independent dynamics in a larger space, 2025. arXiv:2507.19345 on PithPith's reviewarXiv
  27. [47] Boyang Chen, Minbo Gao, Zhengfeng Ji, Tongyang Li, Xinzhao Wang, and Shuo Zhou. Gate- efficient implementation of the query-optimal time-dependent hamiltonian simulation, 2026. arXiv:2608.30629 on PithPith's reviewarXiv
  28. [48] Rolando D. Somma. Quantum simulations of one dimensional quantum systems, 2015. arXiv:1503.06319 on PithPith's reviewarXiv
  29. [49] Siddhartha Jain, Vishnu Iyer, Rolando D. Somma, Ning Bao, and Stephen P. Jordan. Efficient quantum hermite transform, 2025. arXiv:2510.04929 on PitharXiv
  30. [50] Maciej Zworski.Semiclassical Analysis. American Mathematical Society, 2012 on Pith
  31. [51] Andr´ e Martinez.An introduction to semiclassical and microlocal analysis. Springer, 2002 on Pith
  32. [2025] arXiv:2509.06054, npj Quantum information, to appear on PithPith's reviewarXiv

Challenges and discussion

Disagree with the review, or know something it missed? Leave a comment, or challenge this review formally: a challenge becomes a permanent entry in this paper's record, and its decision is published here.

No comments yet.

Sign in to comment