Quantum Gibbs Samplers: The Commuting Case
Open accessThe DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Abstract
We analyze the problem of preparing quantum Gibbs states of lattice spin Hamiltonians with local and commuting terms on a quantum computer and in nature. Our central result is an equivalence between the behavior of correlations in the Gibbs state and the mixing time of the semigroup which drives the system to thermal equilibrium (the Gibbs sampler). We introduce a framework for analyzing the correlation and mixing properties of quantum Gibbs states and quantum Gibbs samplers, which is rooted in the theory of non-commutative Lp\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbb{L}_p}$$\end{document} spaces. We consider two distinct classes of Gibbs samplers, one of them being the well-studied Davies generator modelling the dynamics of a system due to weak-coupling with a large Markovian environment. We show that their spectral gap is independent of system size if, and only if, a certain strong form of clustering of correlations holds in the Gibbs state. Therefore every Gibbs state of a commuting Hamiltonian that satisfies clustering of correlations in this strong sense can be prepared efficiently on a quantum computer. As concrete applications of our formalism, we show that for every one-dimensional lattice system, or for systems in lattices of any dimension at temperatures above a certain threshold, the Gibbs samplers of commuting Hamiltonians are always gapped, giving an efficient way of preparing the associated Gibbs states on a quantum computer.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Markov Chains and Mixing Times
Levin, D., Peres, Y., & Wilmer, E. (2008) · doi:10.1090/mbk/058 · Cited by 2,241
Efficient Simulation of One-Dimensional Quantum Many-Body Systems
Vidal, G. (2004) · Physical Review Letters · doi:10.1103/physrevlett.93.040502 · Cited by 1,779 · cited 1×
“[48] it is a MPS of bond dimension 2r .”
BackgroundDennis, E., Kitaev, A., Landahl, A., & Preskill, J. (2002) · Journal of Mathematical Physics · doi:10.1063/1.1499754 · Cited by 1,768
Finitely correlated states on quantum spin chains
Fannes, M., Nachtergaele, B., & Werner, R. F. (1992) · Communications in Mathematical Physics · doi:10.1007/bf02099178 · Cited by 1,422 · cited 1×
“has decay of correlations for observables of constant size) if, and only if, the transfer operator is gapped [49,52].”
BackgroundQuantum Dynamical Semigroups and Applications
(2007) · Lecture Notes in Physics · doi:10.1007/3-540-70861-8 · Cited by 1,182 · cited 2×
“Local primitivity was shown to hold [16] if for each k ∈ Λ , { S α ( k ) } generates the full matrix algebra of site k .”
BackgroundTemme, K., Osborne, T. J., Vollbrecht, K. G., Poulin, D., & Verstraete, F. (2011) · Nature · doi:10.1038/nature09770 · Cited by 305 · cited 1×
“…quantum Gibbs samplers have typically fallen into two categories: ones that have a certified runtime, that is typically exponential in the system size [9, 10, 12], and ones that can be implemented on a quantum computer, but where no bounds on their efficiency are currently known [11, 29, 30].”
BackgroundThermalization in Nature and on a Quantum Computer
Riera, A., Gogolin, C., & Eisert, J. (2012) · Physical Review Letters · doi:10.1103/physrevlett.108.080402 · Cited by 189 · cited 1×
“Indeed the problem of thermalization in quantum systems has recently generated a lot of interest, in part because of the new set of tools available from the field of quantum information theory [4–6].”
BackgroundDissipative Quantum Church-Turing Theorem
Kliesch, M., Barthel, T., Gogolin, C., Kastoryano, M., & Eisert, J. (2011) · Physical Review Letters · doi:10.1103/physrevlett.107.120501 · Cited by 154
Self-citationQuantum Hamiltonian Complexity
Gharibian, S., Huang, Y., Landau, Z., & Shin, S. W. (2015) · Foundations and Trends® in Theoretical Computer Science · doi:10.1561/0400000066 · Cited by 144
Cited by
Limitations of optimization algorithms on noisy quantum devices
Franca, D. S., & Garcia-Patron, R. (2020) · arXiv · doi:10.48550/arxiv.2009.05532 · Cited by 234
Quantum Speed-Ups for Solving Semidefinite Programs
Brandao, F. G. S. L., & Svore, K. M. (2017) · 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS) · doi:10.1109/focs.2017.45 · Cited by 142
“in the literature [11], [12], [13], [14], [15], [16], and any of them could be used in the main quantum algorithm.”
BackgroundVariational Quantum Boltzmann Machines
Zoufal, C., Lucchi, A., & Woerner, S. (2020) · arXiv · doi:10.48550/arxiv.2006.06004 · Cited by 99
Product spectrum ansatz and the simplicity of thermal states
Martyn, J., & Swingle, B. (2019) · Physical Review A · doi:10.1103/physreva.100.032107 · Cited by 66
Artificial neural network encoding of molecular wavefunctions for quantum computing
Hagai, M., Sugiyama, M., Tsuda, K., & Yanai, T. (2023) · Digital Discovery · doi:10.1039/d2dd00093h · Cited by 5
Metadata
- Authors
- Kastoryano, M. J., & Brandão, F. G. S. L.
- Venue
- Communications in Mathematical Physics
- Published
- 2016-05-14
- Volume
- 344
- Issue
- 3
- Pages
- 915-957
- ISSN
- 0010-3616 (ISSN-L)
- 1432-0916
- OpenAlex
- W1892476723
- Cited by
- 111
- References
- 9
- FWCI
- 3.81
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Quantum Gibbs Samplers: The Commuting Case. https://app.cochat.ai/papers/10.1007/s00220-016-2641-8
- The paper
- Kastoryano, M. J., & Brandão, F. G. S. L. (2016). Quantum Gibbs Samplers: The Commuting Case. Communications in Mathematical Physics. https://doi.org/10.1007/s00220-016-2641-8
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.