arXiv Machine Learning By Peter Halmos, Boris Hanin

The Score Hamiltonian: Mapping Diffusion Models to Adiabatic Transport

Read the original on arXiv Machine Learning →

arXiv:2606. 05217v1 Announce Type: cross Abstract: We exhibit an exact correspondence between sampling with score-based diffusion models and adiabatic transport of ground states for a family of Schr\"odinger operators we call Score Hamiltonians, built from the learned score's quantum potential.

Summary generated by The Flow from the publisher's feed. The full article lives at arXiv Machine Learning.

arXiv Machine Learning
Jun 2

Quantum Reservoir Computing and Risk Bounds

arXiv:2501. 08640v2 Announce Type: replace Abstract: We propose a way to bound the generalisation errors of several classes of quantum reservoirs using the Rademacher complexity.

By Naomi Mona Chmielewski (L2S), Nina Amini (L2S, CNRS), Joseph Mikael
arXiv Machine Learning
Jun 16

Stochastic Schr\"odinger Diffusion Models for Pure-State Ensemble Generation

arXiv:2605. 03573v3 Announce Type: replace-cross Abstract: Quantum machine learning increasingly relies on pure-state representations, motivating generative models that sample directly in quantum representation space rather than perturbing classical inputs and re-encoding.

By Jian Xu, Wei Chen, Shigui Li, Chao Li, Jingyuan Zheng, Delu Zeng, John Paisley, Qibin Zhao
arXiv Machine Learning
Jun 30

Learning the structure of open quantum systems

arXiv:2606. 30358v1 Announce Type: cross Abstract: We design an algorithm for learning the coefficients of an $n$-qubit constant-local Lindbladian to $\varepsilon$ error with $O(g d^2 \log(n) / \varepsilon^2)$ total evolution time, where $g$ is the single-site energy and $d$ is the (approximate) degree of the interaction graph.

By Laura Lewis, Ewin Tang, John Wright