arXiv Machine Learning
When are bosonic Gaussian states classical to learn?
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
arXiv Machine Learning
Sep 15
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
Jun 2
Efficient Hamiltonian, structure and trace distance learning of Gaussian states
arXiv:2411. 03163v4 Announce Type: replace-cross Abstract: In this work, we initiate the study of Hamiltonian learning for positive temperature bosonic Gaussian states, the quantum generalization of the widely studied problem of learning Gaussian graphical models.
arXiv Machine Learning
Jun 11
Quantum Occam Learning: Sample-Supported Expressibility for Circuit-Based Quantum Learning
arXiv:2606. 12211v1 Announce Type: cross Abstract: A central principle in quantum machine learning is that an ansatz should be expressive enough to represent the quantum data of interest.
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.
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
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.