1 citations · 2 across the 12 of their papers we have counts for
13 papers · 1 filter
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…
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, in which…
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…