Fast convergence of Majorana Propagation for weakly interacting fermions
Giorgio Facelli, Hamza Fawzi, Omar Fawzi
TL;DR
This work addresses the classical simulability of real-time dynamics for local observables under quartic fermionic Hamiltonians by introducing Majorana Propagation (MP), a truncation-enabled Trotter method that maintains a low-degree representation of the time-evolved operator. The authors prove a rigorous Frobenius-norm error bound linking MP to the best degree-$\ell$ approximant and show efficient simulation for $\Delta$-sparse Hamiltonians; in the weakly interacting regime $H=H_0+uV$ with $u\le1$, a time horizon $t_{\max}(u)$ exists beyond which low-degree approximations persist, enabling overall runtime $N^{O(\log((1+t)/\varepsilon))}$ for prescribed accuracy $\varepsilon$. The key technical advances include degree-dependent Frobenius bounds for commutators and a system-size-independent Trotter error bound achieved via a $G\le4\Delta$ color partition of Hamiltonian terms, together with a constructive, efficient truncation framework. These results illuminate when classical simulation via MP is feasible and lay groundwork for benchmarking quantum dynamics against controlled classical approximations in fermionic systems.
Abstract
Simulating the time dynamics of an observable under Hamiltonian evolution is one of the most promising candidates for quantum advantage as we do not expect efficient classical algorithms for this problem except in restricted settings. Here, we introduce such a setting by showing that Majorana Propagation, a simple algorithm combining Trotter steps and truncations, efficiently finds a low-degree approximation of the time-evolved observable as soon as such an approximation exists. This provides the first provable guarantee about Majorana Propagation for Hamiltonian evolution. As an application of this result, we prove that Majorana Propagation can efficiently simulate the time dynamics of any sparse quartic Hamiltonian up to time $t_{\text{max}}(u)$ depending on the interaction strength $u$. For a time horizon $t \leq t_{\text{max}}(u)$, the runtime of the algorithm is $N^{O(\log(t/\varepsilon))}$ where $N$ is the number of Majorana modes and $\varepsilon$ is the error measured in the normalized Frobenius norm. Importantly, in the limit of small $u$, $t_{\text{max}}(u)$ goes to $+\infty$, formalizing the intuition that the algorithm is accurate at all times when the Hamiltonian is quadratic.
