Fetching the paper…
Reading the bibliography…
We study the problem of learning a Hamiltonian $H$ to precision $\varepsilon$, supposing we are given copies of its Gibbs state $\rho=\exp(-\beta H)/\operatorname{Tr}(\exp(-\beta H))$ at a known inverse temperature $\beta$.
Scalable Bayesian Hamiltonian learning, 2019
Tim J. Evans, Robin Harper, and Steven T. Flammia · 1912
Earlier work this paper cites.
Approximating discrete probability distributions with dependence trees
C. Chow and C. Liu · 1968
Earlier work this paper cites.
Markov field on finite graphs and lattices
J.M. Hammersley and P. Clifford · 1971
Earlier work this paper cites.
Markov random fields and their applications
Ross Kindermann and J. Laurie Snell · 1980
Earlier work this paper cites.
Real and Complex Analysis
Walter Rudin · 1987
Earlier work this paper cites.
Markov random fields in statistics
Peter Clifford · 1990
Earlier work this paper cites.
Concrete Mathematics: A Foundation for Computer Science
Ronald Graham, Donald Knuth, and Oren Patashnik · 1994
Earlier work this paper cites.
The critical point
Cyril Domb · 1996
Earlier work this paper cites.
Graphical models
Steffen Lauritzen · 1996
Earlier work this paper cites.
Learning markov networks: Maximum bounded tree-width graphs
David Karger and Nathan Srebro · 2001
Earlier work this paper cites.
Sample-efficient learning of interacting quantum systems
Anurag Anshu, Srinivasan Arunachalam, Tomotaka Kuwahara, and Mehdi Soleimanifar · 2004
Earlier work this paper cites.
Improved simulation of stabilizer circuits
Scott Aaronson and Daniel Gottesman · 2004
Cited alongside, same era.
Learning factor graphs in polynomial time and sample complexity
Pieter Abbeel, Daphne Koller, and Andrew Y. Ng · 2006
Cited alongside, same era.
Towards an integrated protein–protein interaction network: A relational markov network approach
Ariel Jaimovich, Gal Elidan, Hanah Margalit, and Nir Friedman · 2006
Cited alongside, same era.
Analytic Combinatorics
Philippe Flajolet and Robert Sedgewick · 2009
Cited alongside, same era.
Probabilistic graphical models :Principles and techniques
Daphne Koller and Nir Friedman · 2009
Cited alongside, same era.
Markov Random Field Modeling in Image Analysis
Stan Z. Li · 2009
Cited alongside, same era.
Interaction screening: Efficient and sample-optimal learning of Ising models
Marc Vuffray, Sidhant Misra, Andrey Lokhov, and Michael Chertkov · 2016
Later among the works it cites.
Learning graphical models using multiplicative weights
Adam Klivans and Raghu Meka · 2017
Later among the works it cites.
Learning a local Hamiltonian from local measurements
Eyal Bairey, Itai Arad, and Netanel H. Lindner · 2019
Later among the works it cites.
Determining a local Hamiltonian from a single eigenstate
Xiao-Liang Qi and Daniel Ranard · 2019
Later among the works it cites.
Learning the dynamics of open quantum systems from their steady states
Eyal Bairey, Chu Guo, Dario Poletti, Netanel H Lindner, and Itai Arad · 2020
Later among the works it cites.
Clustering of conditional mutual information for quantum Gibbs states above a threshold temperature
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Introduction to Nonparametric Estimation
Alexandre B. Tsybakov · 2009
Cited alongside, same era.
Quantum Markov networks and commuting Hamiltonians, 2012
Winton Brown and David Poulin · 2012
Cited alongside, same era.
Information-theoretic limits of selecting binary graphical models in high dimensions
Narayana P. Santhanam and Martin J. Wainwright · 2012
Cited alongside, same era.
Reconstruction of Markov random fields from samples: Some observations and algorithms
Guy Bresler, Elchanan Mossel, and Allan Sly · 2013
Cited alongside, same era.
Efficiently learning Ising models on arbitrary graphs
Guy Bresler · 2015
Cited alongside, same era.
Tomotaka Kuwahara, Kohtaro Kato, and Fernando G. S. L. Brandão · 2020
Later among the works it cites.
Tomotaka Kuwahara and Keiji Saito · 2020
Later among the works it cites.
Integer multiplication in time O ( n log n ) {O}(n\log n)
David Harvey and Joris van der Hoeven · 2021
Closest in time.
Optimal short-time measurements for hamiltonian learning, 2021
Assaf Zubida, Elad Yitzhaki, Netanel H. Lindner, and Eyal Bairey · 2021
Closest in time.
Classical simulation of short-time quantum dynamics, 2022
Dominik S. Wild and Álvaro M. Alhambra · 2022
Closest in time.