This work establishes a general quantum score-matching framework with end-to-end theoretical guarantees for quantum states and achieves information-theoretically optimal sample complexity in the high-temperature regime for Hamiltonians with bounded locality and interaction degree.
Abstract
Score matching has driven major advances in classical generative learning by enabling models to learn from data without evaluating intractable normalization constants, or partition functions. Yet, extending this principle to quantum learning requires rethinking its foundations, as quantum states are described by noncommuting density operators rather than scalar probabilities. The noncommutativity creates fundamental challenges not only in defining quantum scores, but also in developing a training framework with efficient circuit implementations and rigorous theoretical guarantees. In this work, we bridge this gap by establishing a general quantum score-matching framework with end-to-end theoretical guarantees. Applied to Gibbs-state learning, our approach avoids additional thermal-state preparation and achieves information-theoretically optimal sample complexity in the high-temperature regime for Hamiltonians with bounded locality and interaction degree. This positions score matching as a new route to state-of-the-art performance in learning quantum Gibbs states. Beyond these theoretical results, numerical simulations show that our method remains effective even when gradients are estimated inaccurately under limited measurement budgets. Experiments on IBM quantum hardware further demonstrate that quantum score matching is NISQ-friendly: without any error mitigation or correction, it reduces the relative Hamiltonian-parameter error from 64% to approximately 10%. Together, these results extend score matching into an experimentally realizable paradigm for quantum-state learning.
This work develops a quantum analog of classical score matching method that exploits generalized notions of derivatives and integration by parts in operator algebras and establishes Operator Score Matching as a practical, partition-function-free framework for quantum Hamiltonian learning.
Shreya Shukla, Abhijith Jayakumar, A. Lokhov· 0 citations
The results show that the factorization underlying a quantum block encoding can itself provide sufficient classical structure even when sampling-and-query access to the composite matrix is unavailable, suggesting a classical sampler with prescribed accuracy and polynomially related runtime.
Natsuto Isogai, M. Murao, Hayata Yamasaki· 0 citations
We introduce Coherent Quantum Learning (CQL), a training framework for quantum learning models in which the model parameters are quantum degrees of freedom evolved under a Hamiltonian that encodes the loss function. Current quantum machine learning retains classical optimization: parameters are updated by a classical o...
Ignacio B. Acedo, Javier Gonzalez-Conde, Pablo Rodriguez-Grasa et al.· 0 citations
A protocol for approximating the measurement distributions of quantum states, extending beyond standard observable estimation is introduced, and tightened gate complexity bounds for practically relevant systems, including those with k-local interactions, long-tailed matrix ensembles, and conserved quantities are provid...
Arul Rhik Mazumder, James D. Watson, Samson Wang· 0 citations
Learning quantum interactions from finite-temperature many-body systems is a central task in emerging quantum platforms. Recently, the problem of learning from lattice quantum Gibbs states has found rigorous, efficient protocols. Nevertheless, exact Gibbs states, as the input premise, are in fact computationally intrac...
An end-to-end expected learning guarantee is proved where the approximation term is determined by the omitted Fourier mass, while a normalized unbiased estimator yields an explicit statistical bound for empirical truncations.
Taha Hoseinpour Asli, Sajjad Hashemian, Ebrahim Ardeshir-Larijani· 0 citations
Related blog posts
MIT News · Artificial Intelligence· news.mit.eduOct 28, 2026
Professor Paris Smaragdis develops computers with superhuman hearing for applications like speech recognition, music understanding, and environmental monitoring.
MIT News · Artificial Intelligence· news.mit.eduOct 2, 2026
A weeklong summer workshop brought higher education faculty to campus to explore how AI and machine learning materials can be adapted for their classrooms.
MIT News · Artificial Intelligence· news.mit.eduAug 27, 2026
A new machine-learning framework aims to improve the success rate of computational protein design while moving away from results that reproduce sequences found in nature.
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.