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
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
Shell-based cohesive elements tend to overestimate the compression ahead of the crack tip because of approximations in the penalty stiffness. In this study, the higher-order structural cohesive element previously developed by the authors is enhanced with a resin-rich layer-dependent penalty stiffness to improve both co...
Xiaopeng Ai, C. Kassapoglou, Bo-Yang Chen· 0 citations
MosaiQC demonstrates a superior trade-off for run speed and solution quality, while adding fundamental features excluded by most competitors, and demonstrates that scalable heuristic optimization can substantially reduce the computational overhead of circuit-cut placement for increasingly large quantum circuits.
Koen J. Mesman, Yinglu Tang, Matthias Moller et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
