arXiv Machine Learning

When are bosonic Gaussian states classical to learn?

arXiv Machine Learning
Jun 26

Efficient learning of bosonic Gaussian unitaries

arXiv:2510. 05531v2 Announce Type: replace-cross Abstract: Bosonic Gaussian unitaries are fundamental building blocks of central continuous-variable quantum technologies such as quantum-optic interferometry and bosonic error-correction schemes.

By Marco Fanizza, Vishnu Iyer, Junseo Lee, Antonio A. Mele, Francesco A. Mele
arXiv Statistics ML
3d ago

Advantage of Sample Complexity in Quantum PAC Learning Requires Inverse Access to State-Preparation Unitaries

The paper investigates whether having only forward access to a state-preparation unitary—without its inverse—can reduce the number of queries needed for quantum PAC learning. By analyzing worst-case scenarios over all compatible unitaries and finite dimensions, the authors prove that the optimal forward-only query complexities for realizable and agnostic learning are θ((d+log(1/δ))/ε) and θ((d+log(1/δ))/ε²), respectively, matching classical and quantum-copy bounds. These results demonstrate that forward-only access offers no asymptotic advantage over classical data or quantum copies, highlighting the essential role of inverse access for any improvement in the realizable setting.

By Natsuto Isogai, Satoshi Yoshida, Mio Murao
arXiv Machine Learning
Jul 13

A Fourier analytique approach to Gaussian mixture learning

arXiv:2004. 05813v3 Announce Type: replace-cross Abstract: Suppose that we are given independent, identically distributed random samples $x_1,\cdots,x_n$ from a mixture at most $k$ many $d$-dimensional spherical Gaussian distributions $\mu_1,\cdots,\mu_{k_0}$ of identical and known variance $\sigma^2$ in each coordinate, such that the minimum $\ell^2$ distance between two distinct centers $y_l$ and $y_j$ is greater than $2\Delta\sigma \min\{\sqrt{d},\sqrt k\}$, where $\Delta>C_0$, and $C_0$ is a sufficiently large universal constant.

By Somnath Chakraborty, Hariharan Narayanan
Hugging Face Trending Papers
Jul 7

Provable learning separation for predicting time-evolution of quantum many-body systems

Given that quantum computers are naturally suited to simulate the behavior of quantum many-body systems, an immediate question arises: can one formulate physically motivated quantum machine learning (QML) tasks that exhibit learning separations? We address this problem by studying the learnability of quantum many-body dynamics from the perspective of probably approximately correct (PAC)-learning.

arXiv Machine Learning
4d ago

Optimal Quantum-Classical Separations for Exact Learning

arXiv:2609.38073v1 Announce Type: cross Abstract: We study exact learning with membership queries for concept classes $\mathcal C\subseteq\{0,1\}^N$, focusing on the relationships among their determi...

By Srinivasan Arunachalam, Amin Shiraz Gilani, Nikhil S. Mande