From the 2 of 11 linked papers with an AI index.
11 papers
Breaking the Quadratic Barrier for von Neumann Entropy Estimation
Minbo Gao, Qisheng Wang
We study the sample complexity of estimating the von Neumann entropy of an unknown -dimensional quantum state. All previously known estimators require samples, and plug…
No-Go Theorems for Quantum Transport Metrics from Fixed Cost Operators
Minbo Gao, Zhengfeng Ji, Tianshi Yu
The paper proves that for quantum optimal transport based on fixed-cost operators, neither the optimal cost nor its square root can define a metric on the full quantum state space…
A Correlation-Gap Bound for Nonlinear Gaussian PCA
Minbo Gao, Zhengfeng Ji, Chenghua Liu
The paper shows that for Gaussian data, the Karhunen–Loève (KL) basis is within a factor 1 + O(1/√d) of the optimal basis when a fixed number of coordinates are adaptively retained…
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…
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…
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…