Trotter error and gate complexity of the SYK and sparse SYK models

TL;DR

This paper analyzes the Trotter error and gate complexity for simulating the SYK and sparse SYK models, providing near-optimal bounds and improvements for fixed input state evolution.

Contribution

It derives near-optimal gate complexity bounds for simulating SYK models using Lie--Trotter--Suzuki formulas, including sparse variants, and improves simulation efficiency for fixed input states.

Findings

Gate complexity scales as (n^{k+rac{5}{2}}t^2) for even k, (n^{k+3}t^2) for odd k (first-order)

Higher-order formulas reduce complexity to (n^{k+rac{1}{2}}t) for even k, (n^{k+1}t) for odd k

Sparse SYK model has lower complexity, (n^{1+rac{1}{2}} t) for even k, (n^{2} t) for odd k

Abstract

The Sachdev--Ye--Kitaev (SYK) model is a prominent model of strongly interacting fermions that serves as a toy model of quantum gravity and black hole physics. In this work, we study the Trotter error and gate complexity of the quantum simulation of the SYK model using Lie--Trotter--Suzuki formulas. Building on recent results by Chen and Brand\~{a}o (arXiv:2111.05324), we derive bounds on the first- and higher-order Trotter error of the SYK model, and subsequently find near-optimal gate complexities for simulating these models. For the $k$-local SYK model on $n$ Majorana fermions, at time $t$, our gate complexity estimates for the first-order Lie--Trotter--Suzuki formula scales with $\tilde{\mathcal{O}}(n^{k+\frac{5}{2}}t^2)$ for even $k$ and $\tilde{\mathcal{O}}(n^{k+3}t^2)$ for odd $k$, and the gate complexity of simulations using higher-order formulas scales with $\tilde{\mathcal{O}}(n^{k+\frac{1}{2}}t)$ for even $k$ and $\tilde{\mathcal{O}}(n^{k+1}t)$ for odd $k$. Given that the SYK model has $\Theta(n^k)$ terms, these estimates are close to optimal. These gate complexities can be further improved upon in the context of simulating the time evolution of an arbitrary fixed input state $|\psi\rangle$, leading to a $\mathcal{O}(n^2)$-reduction in gate complexity for first-order and $\mathcal{O}(\sqrt{n})$-reduction for higher-order formulas. Regarding the sparse SYK model, which is a simplified variant of the SYK model obtained by deleting all but a $\Theta(n)$ fraction of the terms in a uniformly i.i.d. manner, our average gate complexity estimates for higher-order formulas scale as $\tilde{\mathcal{O}}(n^{1+\frac{1}{2}} t)$ for even $k$ and $\tilde{\mathcal{O}}(n^{2} t)$ for odd $k$. Similar to the full SYK model, we obtain a $\mathcal{O}(\sqrt{n})$-reduction simulating the time evolution of an arbitrary fixed input state $|\psi\rangle$.