Quantum linear-system algorithms access the coefficient matrix through a block-encoding oracle $U_A$ and the right-hand side through a state-preparation oracle $U_b$. The optimal query complexities of these two oracles are known separately: $O(\kappa\log(1/\varepsilon))$ queries to $U_A$ and $O(\kappa/s)$ queries to $U...
Minbo Gao, Zheng-Feng Ji, Cheng-Hua Liu· 0 citations
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 convex body $K\subseteq\mathbb{R}^n$, let $\mu_{K,t} (\mathrm{d} x) \propto e^{-t\| x \| ^2} \mathbb{1}_K(x)\,\mathrm{d} x$, and let $Q_n$ b...
Minbo Gao, Zheng-Feng Ji, Cheng-Hua Liu· 0 citations
The query-optimal algorithm of [CGWZ26] for general time-dependent Hamiltonian simulation uses $$ q = O\left( \alpha T + \frac{\log(1/\varepsilon)}{\log\left(e + \log(1/\varepsilon)/(\alpha T) \right)} \right) $$ queries to $\mathrm{HAM\mbox{-}T}$ within $\varepsilon$ error for a Lipschitz-continuous time-dependent Ham...
Bo-Yang Chen, Min-Bo Gao, Zheng-Feng Ji et al.· 7 citations
We prove a generalized quantum Stein lemma for parallel discrimination of an arbitrary finite-dimensional channel against families of alternative channels. The alternatives are compact and convex, closed under tensor products, and contain a faithful replacer. At every fixed type-I error tolerance, the optimal type-II e...
Minbo Gao, Zheng-Feng Ji, Cheng-Hua Liu· 1 citation
We develop quantum algorithms that construct block-encodings of solution matrices for continuous- and discrete-time algebraic Riccati equations (CAREs and DAREs), differential Riccati equations (DREs), and finite Riccati recursions. The Quantum Weighted Riesz Method, unifying four kinds of Riccati problems, constructs...
Jing-Yao Wang, Yan-Qiao Wang, Bo-Wen Li et al.· 0 citations
If each coordinate appears in only a small number of clauses, there is a quantum algorithm for strongly log-concave sampling using local queries using $\widetilde{O}(\sqrt{\kappa}d)$ local queries, where $\kappa$ is the condition number.
The separation is obtained through a one-bit filtered-parity construction and a space-sensitive quantum lower bound based on compressed-oracle capacity and a new parity-to-capacity inequality, which may be of independent interest.
A dimension-free version of the retained-energy form of the Mallat--Zeitouni conjecture is established, showing that the KL basis is within this factor of the optimal basis, and shows that the possible advantage of optimizing over all orthonormal bases vanishes as $d$ grows.
Minbo Gao, Zheng-Feng Ji, Cheng-Hua Liu· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
