6 citations · 10 across the 14 of their papers we have counts for
5 papers · 1 filter
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…
Randomized Quantum Singular Value Transformation
Xinzhao Wang, Yuxin Zhang, Soumyabrata Hazra +3
We introduce the first randomized algorithms for Quantum Singular Value Transformation (QSVT), a unifying framework for many quantum algorithms. Standard implementations of QSVT re…
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…
Quantum singular value transformation without block encodings: Near-optimal complexity with minimal ancilla
Shantanav Chakraborty, Soumyabrata Hazra, Tongyang Li +3
We develop new algorithms for Quantum Singular Value Transformation (QSVT), a unifying framework that encapsulates most known quantum algorithms and serves as the foundation for ne…