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

18 papers

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…

quant-ph2025

Scalable Quantum Error Mitigation with Neighbor-Informed Learning

Zhenyu Chen, Bin Cheng, Minbo Gao +4

Noise in quantum hardware is the primary obstacle to realizing the transformative potential of quantum computing. Quantum error mitigation (QEM) offers a promising pathway to enhan…

quant-ph2025★ 1 cited

Lévy-Khintchine Structure Enables Fast-Forwardable Lindbladian Simulation

Minbo Gao, Zhengfeng Ji, Chenghua Liu

Simulation of open quantum systems is an area of active research in quantum algorithms. In this work, we revisit the connection between Markovian open-system dynamics and averages…

quant-ph2025

On Estimating the Quantum Tsallis Relative Entropy

Jinge Bao, Minbo Gao, Qisheng Wang

The relative entropy between quantum states quantifies their distinguishability. The estimation of certain relative entropies has been investigated in the literature, e.g., the von…

quant-ph2025

Quantum Hamiltonian Certification

Minbo Gao, Zhengfeng Ji, Qisheng Wang +2

We formalize and study the Hamiltonian certification problem. Given access to for an unknown Hamiltonian , the goal of the problem is to determine whether $…

quant-ph2025

Quantum Speedup for Hypergraph Sparsification

Chenghua Liu, Minbo Gao, Zhengfeng Ji +1

Graph sparsification serves as a foundation for many algorithms, such as approximation algorithms for graph cuts and Laplacian system solvers. As its natural generalization, hyperg…

quant-ph2025

Quantum Speedup for Sampling Random Spanning Trees

Simon Apers, Minbo Gao, Zhengfeng Ji +1

We present a quantum algorithm for sampling random spanning trees from a weighted graph in time, where and denote the number of vertices and edge…

quant-ph2024

Quantum Approximate -Minimum Finding

Minbo Gao, Zhengfeng Ji, Qisheng Wang

Quantum -minimum finding is a fundamental subroutine with numerous applications in combinatorial problems and machine learning. Previous approaches typically assume oracle acces…

cs.LG2024

Quantum Maximum Entropy Inference and Hamiltonian Learning

Minbo Gao, Zhengfeng Ji, Fuchao Wei

Maximum entropy inference and learning of graphical models are pivotal tasks in learning theory and optimization. This work extends algorithms for these problems, including general…

quant-ph2023★ 3 cited

Logarithmic-Regret Quantum Learning Algorithms for Zero-Sum Games

Minbo Gao, Zhengfeng Ji, Tongyang Li +1

We propose the first online quantum algorithm for solving zero-sum games with regret under the game setting. Moreover, our quantum algorithm computes an $\varepsi…

quant-ph2022★ 1 cited

Fault Models in Superconducting quantum circuits

Qifan Huang, Boxi Li, Minbo Gao +1

Fault models are indispensable for many EDA tasks, so as for design and implementation of quantum hardware. In this article, we propose a fault model for superconducting quantum sy…

cs.LG2021★ 7 cited

A Provably Efficient Algorithm for Linear Markov Decision Process with Low Switching Cost

Minbo Gao, Tianle Xie, Simon S. Du +1

Many real-world applications, such as those in medical domains, recommendation systems, etc, can be formulated as large state space reinforcement learning problems with only a smal…

quant-ph2020★ 3 cited

One-shot dynamical resource theory

Xiao Yuan, Pei Zeng, Minbo Gao +1

A fundamental problem in resource theory is to study the manipulation of the resource. Focusing on a general dynamical resource theory of quantum channels, here we consider tasks o…