1 citations · 1 across the 8 of their papers we have counts for
8 papers
Robust quantum state certification and uncertainty principles for total influence
Andrea Coladangelo, Jerry Li, Joseph Slote
We show that nonadaptive single-qubit Pauli measurements suffice to test whether an unknown -qubit state is -close to or -far from an ideal targ…
Density estimation for Hellinger via minimum-distance estimators: mixtures of Gaussians, log-concave, and more
Spencer Compton, Jerry Li
We study the task of density estimation, where we hope to accurately estimate a probability density from samples. A textbook method for density estimation in total variation di…
The Power of Two Bases: Robust and copy-optimal certification of nearly all quantum states with few-qubit measurements
Andrea Coladangelo, Jerry Li, Joseph Slote +1
A central task in quantum information science is state certification: testing whether an unknown state is -close to a fixed target state, or -far. Recent work has shown t…
Separating Oblivious and Adaptive Models of Variable Selection
Ziyun Chen, Jerry Li, Kevin Tian +1
Sparse recovery is among the most well-studied problems in learning theory and high-dimensional statistics. In this work, we investigate the statistical and computational landscape…
Rigorous Implications of the Low-Degree Heuristic
Jun-Ting Hsieh, Daniel M. Kane, Pravesh K. Kothari +3
Over the past decade, the low-degree heuristic has been used to estimate the algorithmic thresholds for a wide range of average-case planted vs null distinguishing problems. Such r…
High-Accuracy List-Decodable Mean Estimation
Ziyun Chen, Spencer Compton, Daniel Kane +1
In list-decodable learning, we are given a set of data points such that an -fraction of these points come from a nice distribution , for some small , and the goal is…
Lower Bounds for Learning Hamiltonians from Time Evolution
Ziyun Chen, Jerry Li, Joseph Slote
Learning about a Hamiltonian from its time evolution is a fundamental task in quantum science. A flurry of recent work has developed powerful new algorithms with pro…
Quantum Algorithms for Graph Coloring and other Partitioning, Covering, and Packing Problems
Serge Gaspers, Jerry Zirui Li
Let U be a universe on n elements, let k be a positive integer, and let F be a family of (implicitly defined) subsets of U. We consider the problems of partitioning U into k sets f…