arXiv Machine Learning
Tight Lower Bounds for State Tomography with Limited Entanglement
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
Hugging Face Trending Papers
Sep 9
Optimal Low-Rank Quantum State Tomography with Bounded-Sample Joint Measurements
We determine the optimal sample complexity of low-rank quantum state tomography when each measurement may act jointly on at most $t$ samples. For sufficiently small $\varepsilon$, estimating an unknow...
arXiv Statistics ML
2d ago
Information-Theoretic Bounds for Sparse Covariance Estimation in the Vertical-Split Distributed Model
arXiv:2606.07124v2 Announce Type: replace-cross Abstract: We study the minimax estimation error for distributed covariance matrix estimation in the vertical-split (feature-split) setting, where two a...
arXiv Machine Learning
3d ago
What resources are needed for optimal learning of bosonic Gaussian states?
arXiv:2603.18136v2 Announce Type: replace-cross Abstract: Continuous-variable systems enable key quantum technologies in computation, communication, and sensing. Bosonic Gaussian states emerge natura...
arXiv Machine Learning
Aug 5
Tight Worst-Case Bounds for the Smallest Eigenvalue of ReLU NTK Gram Matrices
arXiv:2608. 03368v1 Announce Type: new Abstract: For $n$ unit vectors $x_1,\ldots,x_n \in \mathbb{R}^d$, we study the continuous ReLU derivative Gram matrix $H$, whose entries are obtained by averaging pairwise gated inner products over a standard Gaussian direction.
arXiv Machine Learning
Jun 2
Global Convergence of Adaptive Sensing for Principal Eigenvector Estimation
arXiv:2505. 10882v2 Announce Type: replace Abstract: Principal component analysis classically requires full $d$-dimensional samples, yet in various applications hardware limits acquisition to a few scalar measurements per sample.
arXiv Machine Learning
Jul 21
Tight Sample Bounds for Renyi and Min-Entropy Estimation
arXiv:2607. 16966v1 Announce Type: cross Abstract: Estimating entropy from samples is fundamental in information theory and property testing.