7 citations · 8 across the 9 of their papers we have counts for
6 papers · 2 filters
Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding
Tongyang Li, Fengning Ou, Xinzhao Wang +3
Many quantum algorithms require coherent access to classical data, often modeled by quantum read-only memory (QROM). We initiate the study of the count of sparse QROM,…
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…
Quantum Multi-Level Estimation of Functionals of Discrete Distributions
Kean Chen, Minbo Gao, Tongyang Li +2
We propose a quantum multi-level estimation framework for a functional of a discrete distribution . We partition the values into logarith…
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…