From the 1 of 6 linked papers with an AI index.
6 papers
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…
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…
Trotter error compensation with polylogarithmic precision and nested-commutator scaling without ancillas
Xinzhao Wang, Shuo Zhou, Ziruo Wang +5
The paper introduces a high‑order nested‑commutator compensation (HNCC) algorithm that reduces the circuit size needed for Hamiltonian simulation to polylogarithmic dependence on p…
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…