activity
20202026
most citedA Provably Efficient Algorithm for Linear Markov Decision Process with Low Switching Cost

7 citations · 15 across the 16 of their papers we have counts for

collaborators
Showing 2026Show all

6 papers · 1 filter

quant-ph2026

Simultaneously Query-Optimal Quantum Linear-System Algorithm

Minbo Gao, Zhengfeng Ji, Chenghua Liu

Quantum linear-system algorithms access the coefficient matrix through a block-encoding oracle and the right-hand side through a state-preparation oracle . The optimal q…

math.PR2026

Optimal Covariance Inflation under Gaussian Tilts

Minbo Gao, Zhengfeng Ji, Chenghua Liu

Covariance-sensitive analyses of Gaussian annealing for sampling from a convex body require controlling how much covariance can grow under a radial Gaussian tilt. For an isotropic…

quant-ph2026

Optimal von Neumann Entropy Estimation

Minbo Gao, Ziyun Chen, Qisheng Wang

We show that the von Neumann entropy of an unknown -dimensional quantum state can be estimated to within additive error using \[ Θ\!\left(\frac{d^2}{\varepsilo…

quant-ph2026

No-Go Theorems for Quantum Transport Metrics from Fixed Cost Operators

Minbo Gao, Zhengfeng Ji, Tianshi Yu

Coupling-based quantum optimal transport generalizes classical optimal transport by representing transport plans as bipartite states with prescribed marginals and evaluating their…

cs.DS2026

A Correlation-Gap Bound for Nonlinear Gaussian PCA

Minbo Gao, Zhengfeng Ji, Chenghua Liu

Principal component analysis (PCA) is optimal for the linear reconstruction of Gaussian data, a foundational property underlying its central role in algorithms and signal processin…

quant-ph2026

Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy

Minbo Gao, Chenghua Liu, Guangxu Yang +1

We study one-way quantum communication lower bounds for search problems. Unlike decision problems, search problems can have many valid outputs, which pose a fundamental barrier to…