{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T17:21:04Z","timestamp":1730222464069,"version":"3.28.0"},"reference-count":26,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,10,1]],"date-time":"2022-10-01T00:00:00Z","timestamp":1664582400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,10,1]],"date-time":"2022-10-01T00:00:00Z","timestamp":1664582400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,10]]},"DOI":"10.1109\/focs54457.2022.00020","type":"proceedings-article","created":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T18:48:42Z","timestamp":1672253322000},"page":"135-146","source":"Crossref","is-referenced-by-count":16,"title":["Optimal learning of quantum Hamiltonians from high-temperature Gibbs states"],"prefix":"10.1109","author":[{"given":"Jeongwan","family":"Haah","sequence":"first","affiliation":[{"name":"Microsoft Quantum,Redmond,WA,USA"}]},{"given":"Robin","family":"Kothari","sequence":"additional","affiliation":[{"name":"Microsoft Quantum,Redmond,WA,USA"}]},{"given":"Ewin","family":"Tang","sequence":"additional","affiliation":[{"name":"University of Washington,Seattle,WA,USA"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1038\/s41567-021-01232-0"},{"issue":"64","key":"ref2","first-page":"1743","article-title":"Learning factor graphs in polynomial time and sample complexity","volume":"7","author":"Abbeel","year":"2006","journal-title":"Journal of Machine Learning Research"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1103\/physrevlett.122.020504"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/ab73cd"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/100796029"},{"key":"ref6","article-title":"Quantum Markov networks and commuting Hamiltonians","author":"Brown","year":"2012","journal-title":"arXiv:1206.0755v1"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746631"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/tit.1968.1054142"},{"key":"ref9","article-title":"Markov random fields in statistics","author":"Clifford","year":"1990","journal-title":"Disorder in Physical Systems. A Volume in Honour of John M. Hammersley"},{"key":"ref10","article-title":"Scalable Bayesian Hamiltonian learning","author":"Evans","year":"2019","journal-title":"arXiv:1912.07636v1"},{"article-title":"Markov field on finite graphs and lattices","year":"1971","author":"Hammersley","key":"ref11"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/focs54457.2022.00020"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2006.13.145"},{"volume-title":"Probabilistic graphical models:Principles and techniques","year":"2009","author":"Koller","key":"ref14"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1103\/physrevlett.124.220601"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/focs.2017.39"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/001"},{"key":"ref18","first-page":"392","article-title":"Learning markov networks: Maximum bounded tree-width graphs","volume-title":"Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Karger"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.aop.2020.168278"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1093\/oso\/9780198522195.001.0001"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84800-279-1"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.22331\/q-2019-07-08-159"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.29172\/766cdcd9-f515-4656-afc1-7eae7766ec6c"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2012.2191659"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/b13794"},{"key":"ref26","first-page":"1","article-title":"Interaction screening: Efficient and sample-optimal learning of Ising models","volume":"29","author":"Vuffray","year":"2016","journal-title":"Advances in Neural Information Processing Systems"}],"event":{"name":"2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)","start":{"date-parts":[[2022,10,31]]},"location":"Denver, CO, USA","end":{"date-parts":[[2022,11,3]]}},"container-title":["2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9996589\/9996592\/09996607.pdf?arnumber=9996607","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,14]],"date-time":"2024-03-14T04:42:58Z","timestamp":1710391378000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9996607\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/focs54457.2022.00020","relation":{},"subject":[],"published":{"date-parts":[[2022,10]]}}}