8 papers · 1 filter
Joint Mitigation of Algorithmic and Physical Errors in Noisy Hamiltonian Simulation
Shuo Zhou, Xinzhao Wang, Ruiqi Zhang +4
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 h…
Gate-Efficient Implementation of the Query-Optimal Time-Dependent Hamiltonian Simulation
Boyang Chen, Minbo Gao, Zhengfeng Ji +3
The query-optimal algorithm of [CGWZ26] for general time-dependent Hamiltonian simulation uses $$ q = O\left( αT + \frac{\log(1/\varepsilon)}{\log\left(e + \log(1/\varepsilon)/(αT)…
Time-Dependent Hamiltonian Simulation with Optimal Query Complexity
Boyang Chen, Minbo Gao, Xinzhao Wang +1
We give a query-optimal algorithm for simulating a general -qubit time-dependent Hamiltonian on , assuming that is Lipschitz continuous and . In…
Trotter error compensation with polylogarithmic precision and nested-commutator scaling without ancillas
Xinzhao Wang, Shuo Zhou, Ziruo Wang +5
Product formulas are among the most practical approaches to Hamiltonian simulation, requiring no ancillary qubits and exhibiting error bounds governed by nested commutators rather…
Quantum-classical crossover in fault-tolerant quantum dynamics simulation
Jinzhao Sun, Bozhen Zhou, Jue Xu +28
While quantum computers promise to solve classically intractable problems, identifying the point at which fault-tolerant quantum computation outperforms the best classical algorith…
Lindbladian Simulation with Commutator Bounds
Xinzhao Wang, Shuo Zhou, Xiaoyang Wang +3
Trotter decomposition provides a simple approach to simulating open quantum systems by decomposing the Lindbladian into a sum of individual terms. While it is established that Trot…