works on

From the 2 of 9 linked papers with an AI index.

collaborators

9 papers

quant-ph2026

Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding

Tongyang Li, Fengning Ou, Xinzhao Wang +3

The paper analyzes the T‑gate cost of sparse quantum read‑only memory (QROM) and derives asymptotically optimal bounds, applying the results to sparse state preparation and block e…

quant-ph2026

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…

quant-ph2026

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…

quant-ph2026

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…

quant-ph2026

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…

quant-ph2026

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…