7 citations · 8 across the 9 of their papers we have counts for
10 papers
Optimal Query Complexity for Ground-State Preparation
Boyang Chen, Minbo Gao, Xinzhao Wang +1
We determine the optimal query complexity of ground-state preparation to trace-distance error when an energy threshold in the spectral gap is known. Let be an $…
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…
Time-Dependent Low-Energy Simulation Accelerates Adiabatic State Preparation
Shuo Zhou, Zhaokai Pan, Weiyuan Gong +1
Hamiltonian simulations are key subroutines in adiabatic quantum computation and quantum many-body physics, where quantum dynamics often happen in the low-energy sector. Previous s…
Efficient Classical Sampling from Gaussian Boson Sampling Distributions on Unweighted Graphs
Yexin Zhang, Shuo Zhou, Xinzhao Wang +5
Gaussian Boson Sampling (GBS) is a promising candidate for demonstrating quantum computational advantage and can be applied to solving graph-related problems. In this work, we prop…
Complexity of Digital Quantum Simulation in the Low-Energy Subspace: Applications and a Lower Bound
Weiyuan Gong, Shuo Zhou, Tongyang Li
Digital quantum simulation has broad applications in approximating unitary evolution of Hamiltonians. In practice, many simulation tasks for quantum systems focus on quantum states…