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 2025Show all

6 papers · 1 filter

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…