7 citations · 8 across the 9 of their papers we have counts for
10 papers
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…
Near-Optimal Quantum Algorithms for Computing (Coarse) Correlated Equilibria of General-Sum Games
Tongyang Li, Xinzhao Wang, Yexin Zhang
Computing Nash equilibria of zero-sum games in classical and quantum settings is extensively studied. For general-sum games, computing Nash equilibria is PPAD-hard and the computin…
Instance-Optimal Matrix Multiplicative Weight Update and Its Quantum Applications
Weiyuan Gong, Tongyang Li, Xinzhao Wang +1
The Matrix Multiplicative Weight Update (MMWU) is a seminal online learning algorithm with numerous applications. Applied to the matrix version of the Learning from Expert Advice (…
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…