1 citations · 1 across the 12 of their papers we have counts for
15 papers · 1 filter
Near-Optimal Quantum Algorithm and Complexity Analysis for Riccati Problems
Jingyao Wang, Yanqiao Wang, Bowen Li +2
We develop quantum algorithms that construct block-encodings of solution matrices for continuous- and discrete-time algebraic Riccati equations (CAREs and DAREs), differential Ricc…
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…
A Generalized Stein Lemma for Quantum Channels
Minbo Gao, Zhengfeng Ji, Chenghua Liu
We prove a generalized quantum Stein lemma for parallel discrimination of an arbitrary finite-dimensional channel against families of alternative channels. The alternatives are com…
Quantum Query Advantage Requires Space
Minbo Gao, Zhengfeng Ji, Ziyi Xie
Hao, Huang, and Liu (STOC'26) recently showed that optimal quantum query complexity may require large workspace even for short-output problems, and asked whether a quantum query ad…
Gate-Efficient Implementation of the Query-Optimal Time-Dependent Hamiltonian Simulation
Boyang Chen, Minbo Gao, Zhengfeng Ji +3
The query-optimal algorithm of [CGWZ26] for general time-dependent Hamiltonian simulation uses $$ q = O\left( αT + \frac{\log(1/\varepsilon)}{\log\left(e + \log(1/\varepsilon)/(αT)…
Quantum Speedups for Log-Concave Sampling from Local Structure
Chenghua Liu, Qisheng Wang, Zhengfeng Ji
For a convex function , the problem of sampling from a distribution proportional to is called log-concave sampling. In many practi…
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…
DQC1-completeness of normalized trace estimation for functions of log-local Hamiltonians
Zhengfeng Ji, Tongyang Li, Changpeng Shao +2
We study the computational complexity of estimating the normalized trace for a log-local Hamiltonian acting on qubits. This problem arises natural…
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…
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…
Accelerating Regression Tasks with Quantum Algorithms
Chenghua Liu, Zhengfeng Ji
Regression is a cornerstone of statistics and machine learning, with applications spanning science, engineering, and economics. While quantum algorithms for regression have attract…
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 $…
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…
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…
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…