We give a query-optimal algorithm for simulating a general $n$-qubit time-dependent Hamiltonian $H(t)$ on $[0,T]$, assuming that $H$ is Lipschitz continuous and $\|H(t)\|\leq\alpha$. In the standard $\mathrm{HAM\mbox{-}T}$ access model, the algorithm approximates the time-ordered propagator $U_H(T)$ to error $\varepsil...
Bo-Yang Chen, Min-Bo Gao, Xin-Zhao Wang et al.· 8 citations· ⚡2
Product-formula Hamiltonian simulation is naturally suited to near-term quantum processors, but its accuracy is set by two competing errors: finite-step Trotter bias and physical hardware noise. We introduce a joint extrapolation strategy that ties the tunable per-layer noise strength to the Trotter step size, $\lambda...
Shuo Zhou, Xin-Zhao Wang, Rui-Qi Zhang et al.· 0 citations
We give a quantum algorithm for Lindbladian simulation given a block encoding of the Hamiltonian $H$ and a projected unitary encoding of the stacked jump operator $B=\sum_{k=1}^m \lvert k\rangle\otimes L_k$, with normalization factors $\alpha_H$ and $\alpha_B$, respectively. For evolution time $t$, set $\tau=(\alpha_H+...
Bo-Yang Chen, Min-Bo Gao, Xin-Zhao Wang et al.· 5 citations
A scalable fault-tolerant framework that combines coherent observable estimation with a space-time-efficient implementation of non-Clifford rotations is introduced, suppressing the residual logical errors that limit existing partially fault-tolerant approaches.
Jinzhao Sun, Bozhen Zhou, Jue Xu et al.· 4 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
