Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1103.0480 · Physics Letters A

Quantum learning algorithms for quantum measurements

Alessandro Bisio, Giacomo Mauro D’Ariano, Paolo Perinotti, Michal Sedlák

Published Aug 15, 2011• 28 citations
arXivHTMLPDF
DOI
10.1016/j.physleta.2011.08.002

Related papers

Supervised Quantum Learning without Measurements

Unai Alvarez-Rodriguez, Lucas Lamata, Pablo Escandell-Montero +2 more

We propose a quantum machine learning algorithm for efficiently solving a class of problems encoded in quantum controlled unitary operations. The central physical mechanism of the protocol is the iteration of a quantum time-delayed equation that introduces feedback in the dynamics and eliminates the necessity of intermediate measurements. The performance of the quantum algorithm is analyzed by comparing the results obtained in numerical simulations with the outcome of classical machine learning methods for the same problem. The use of time-delayed equations enhances the toolbox of the field of quantum machine learning, which may enable unprecedented applications in quantum technologies.

arXiv:1612.05535•Scientific Reports•Oct 16, 2017•67 citations

Quantum machine learning algorithms

Alessandro Luongo

•Nov 23, 2020•3 citations

Improved Bounds on Quantum Learning Algorithms

Alp Atıcı, Rocco A. Servedio

arXiv:quant-ph/0411140•Quantum Information Processing•Oct 18, 2005•76 citations

Quantum Learning Machine

Jeongho Bang, James Lim, M. S. Kim +1 more

We propose a novel notion of a quantum learning machine for automatically controlling quantum coherence and for developing quantum algorithms. A quantum learning machine can be trained to learn a certain task with no a priori knowledge on its algorithm. As an example, it is demonstrated that the quantum learning machine learns Deutsch's task and finds itself a quantum algorithm, that is different from but equivalent to the original one.

arXiv:0803.2976•Mar 20, 2008•23 citations

Learning quantum Gibbs states locally and efficiently

Chi-Fang Chen, Anurag Anshu, Quynh T. Nguyen

Learning the Hamiltonian underlying a quantum many-body system in thermal equilibrium is a fundamental task in quantum learning theory and experimental sciences. To learn the Gibbs state of local Hamiltonians at any constant inverse temperature, the state-of-the-art provable algorithms fall short of the optimal sample and computational complexity, in sharp contrast with the locality and simplicity in the classical cases. In this work, we present a learning algorithm that learns each local term of a n-qubit Hamiltonian on any bounded-degree graph to a constant additive error with the optimal sample complexity $\mathcal{O}(\log n)$. The protocol uses parallelizable local quantum measurements that act within bounded neighborhoods of the graph and near-linear-time classical post-processing. We also give a learning algorithm for lattice Hamiltonians with near-optimal scaling on the learning precision and the inverse temperature. At the heart of our algorithm is the interplay between locality, the Kubo-MartinSchwinger condition, and the operator Fourier transform at arbitrary temperatures.

arXiv:2504.02706•Annual Symposium on Foundations of Computer Science•Dec 14, 2025•26 citations

The stationarity test: a framework for learning quantum many-body systems from their thermal states

Thiago Bergamaschi

The task of learning the Hamiltonian interactions governing a quantum system, given samples of its thermal (or 'Gibbs') states, is a foundational question at the intersection of quantum learning theory and many-body physics. In this paper, we draw connections to the quantum Gibbs sampling literature to introduce a natural learning algorithm we call the stationarity test: which simply "guesses" the Hamiltonian, and measures the rate-of-change of local observables, under the associated detailed-balanced quantum Markov chain [CKG23]. We leverage the stationarity test to address the following applications: 1. To give the first learning algorithm for the underlying interaction graph, i.e. structure learning, of lattice Hamiltonians at all temperatures, given copies of their Gibbs states. 2. To give the first learning algorithm for the coefficients of a lattice Hamiltonian, given only copies of its thermal metastable states, modeled as the "local minima" of the free energy. 3. In addition, we present a refinement to the recent area law for thermal metastable states [BCV25], which holds in the thermodynamic limit. Our learning algorithms are rigorous, time-efficient, and nearly sample-optimal in system size and accuracy. At a technical level, our arguments are based on new approximate locality and convexity properties for the quantum Fisher information of these Gibbs sampling algorithms.

quant-pharXiv:2610.01074•Oct 2, 2026•1 citation
We propose a quantum machine learning algorithm for efficiently solving a class of problems encoded in quantum controlled unitary operations. The central physical mechanism of the protocol is the iteration of a quantum time-delayed equation that introduces feedback in the dynamics and eliminates the necessity of intermediate measurements. The performance of the quantum algorithm is analyzed by comparing the results obtained in numerical simulations with the outcome of classical machine learning methods for the same problem. The use of time-delayed equations enhances the toolbox of the field of quantum machine learning, which may enable unprecedented applications in quantum technologies.
Learning the Hamiltonian underlying a quantum many-body system in thermal equilibrium is a fundamental task in quantum learning theory and experimental sciences. To learn the Gibbs state of local Hamiltonians at any constant inverse temperature, the state-of-the-art provable algorithms fall short of the optimal sample and computational complexity, in sharp contrast with the locality and simplicity in the classical cases. In this work, we present a learning algorithm that learns each local term of a n-qubit Hamiltonian on any bounded-degree graph to a constant additive error with the optimal sample complexity O(log⁡n)\mathcal{O}(\log n)O(logn). The protocol uses parallelizable local quantum measurements that act within bounded neighborhoods of the graph and near-linear-time classical post-processing. We also give a learning algorithm for lattice Hamiltonians with near-optimal scaling on the learning precision and the inverse temperature. At the heart of our algorithm is the interplay between locality, the Kubo-MartinSchwinger condition, and the operator Fourier transform at arbitrary temperatures.
The task of learning the Hamiltonian interactions governing a quantum system, given samples of its thermal (or 'Gibbs') states, is a foundational question at the intersection of quantum learning theory and many-body physics. In this paper, we draw connections to the quantum Gibbs sampling literature to introduce a natural learning algorithm we call the stationarity test: which simply "guesses" the Hamiltonian, and measures the rate-of-change of local observables, under the associated detailed-balanced quantum Markov chain [CKG23]. We leverage the stationarity test to address the following applications: 1. To give the first learning algorithm for the underlying interaction graph, i.e. structure learning, of lattice Hamiltonians at all temperatures, given copies of their Gibbs states. 2. To give the first learning algorithm for the coefficients of a lattice Hamiltonian, given only copies of its thermal metastable states, modeled as the "local minima" of the free energy. 3. In addition, we present a refinement to the recent area law for thermal metastable states [BCV25], which holds in the thermodynamic limit. Our learning algorithms are rigorous, time-efficient, and nearly sample-optimal in system size and accuracy. At a technical level, our arguments are based on new approximate locality and convexity properties for the quantum Fisher information of these Gibbs sampling algorithms.