The query-optimal algorithm of [CGWZ26] for general time-dependent Hamiltonian simulation uses $$ q = O\left( \alpha T + \frac{\log(1/\varepsilon)}{\log\left(e + \log(1/\varepsilon)/(\alpha T) \right)} \right) $$ queries to $\mathrm{HAM\mbox{-}T}$ within $\varepsilon$ error for a Lipschitz-continuous time-dependent Ham...
Bo-Yang Chen, Min-Bo Gao, Zheng-Feng Ji et al.· 7 citations
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
A one-query transducer that implements a product of rational approximations to short-time evolution when supplied with a catalyst, and bound the error from omitting the catalyst by exploiting orthogonality between different sequences of Kraus labels.
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.
