4 citations · 10 across the 12 of their papers we have counts for
5 papers · 1 filter
Polynomial-Time Preparation of Low-Temperature Gibbs States for 2D Toric Code
Zhiyan Ding, Zeph Landau, Bowen Li +2
We propose a polynomial-time algorithm for preparing the Gibbs state of the two-dimensional toric code Hamiltonian at any temperature, starting from any initial condition, signific…
Revisiting Quantum Algorithms for Linear Regressions: Quadratic Speedups without Data-Dependent Parameters
Zhao Song, Junze Yin, Ruizhe Zhang
Linear regression is one of the most fundamental linear algebra problems. Given a dense matrix and a vector , the goal is to find such that…
Quantum Speedups of Optimizing Approximately Convex Functions with Applications to Logarithmic Regret Stochastic Convex Bandits
Tongyang Li, Ruizhe Zhang
We initiate the study of quantum algorithms for optimizing approximately convex functions. Given a convex set and a function $F\colon\mathbb{R}^{n…
Quantum Meets the Minimum Circuit Size Problem
Nai-Hui Chia, Chi-Ning Chou, Jiayu Zhang +1
In this work, we initiate the study of the Minimum Circuit Size Problem (MCSP) in the quantum setting. MCSP is a problem to compute the circuit complexity of Boolean functions. It…
On the Quantum Complexity of Closest Pair and Related Problems
Scott Aaronson, Nai-Hui Chia, Han-Hsuan Lin +2
The closest pair problem is a fundamental problem of computational geometry: given a set of points in a -dimensional space, find a pair with the smallest distance. A classic…