Quantum algorithms for Gibbs sampling and hitting-time estimation
The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Abstract
We present quantum algorithms for solving two problems regarding stochastic processes. The first algorithm prepares the thermal Gibbs state of a quantum system and runs in time almost linear in p Nβ/Z and polynomial in log(1/epsilon), where N is the Hilbert space dimension, β is the inverse temperature, Z is the partition function, and epsilon is the desired precision of the output state. Our quantum algorithm exponentially improves the complexity dependence on 1/epsilon and polynomially improves the dependence on β of known quantum algorithms for this problem. The second algorithm estimates the hitting time of a Markov chain. For a sparse stochastic matrix P, it runs in time almost linear in 1/(epsilon ∆3/2 ), where epsilon is the absolute precision in the estimation and ∆ is a parameter determined by P, and whose inverse is an upper bound of the hitting time. Our quantum algorithm quadratically improves the complexity dependence on 1/epsilon and 1/∆ of the analog classical algorithm for hitting-time estimation. Both algorithms use tools recently developed in the context of Hamiltonian simulation, spectral gap amplification, and solving linear systems of equations.
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
Childs, A. M., Kothari, R., & Somma, R. D. (2017) · SIAM Journal on Computing · doi:10.1137/16m1087072 · Cited by 646
Self-citation(2004) · doi:10.1109/focs.2004.53 · Cited by 599
Hamiltonian Simulation with Nearly Optimal Dependence on all Parameters
Berry, D. W., Childs, A. M., & Kothari, R. (2015) · 2015 IEEE 56th Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2015.54 · Cited by 372
Quantum algorithms for fermionic simulations
Ortiz, G., Gubernatis, J. E., Knill, E., & Laflamme, R. (2001) · Physical Review A · doi:10.1103/physreva.64.022319 · Cited by 347
Exponential improvement in precision for simulating sparse Hamiltonians
Berry, D. W., Childs, A. M., Cleve, R., Kothari, R., & Somma, R. D. (2014) · Proceedings of the forty-sixth annual ACM symposium on Theory of computing · doi:10.1145/2591796.2591854 · Cited by 324 · cited 7×
“We can use the same coloring as that described in [22], which uses a bipartite graph coloring and was used for Hamiltonian simulation.”
MethodInfluentialSelf-citationTemme, K., Osborne, T. J., Vollbrecht, K. G., Poulin, D., & Verstraete, F. (2011) · Nature · doi:10.1038/nature09770 · Cited by 305
Quantum Approach to Classical Statistical Mechanics
Somma, R. D., Batista, C. D., & Ortiz, G. (2007) · Physical Review Letters · doi:10.1103/physrevlett.99.030603 · Cited by 87
Self-citation
Cited by
Biamonte, J., Wittek, P., Pancotti, N., Rebentrost, P., Wiebe, N., & Lloyd, S. (2017) · Nature · doi:10.1038/nature23474 · Cited by 4,779
Hamiltonian Simulation by Qubitization
Low, G. H., & Chuang, I. L. (2019) · Quantum · doi:10.22331/q-2019-07-12-163 · Cited by 854
A Survey on quantum computing technology
Gyongyosi, L., & Imre, S. (2019) · Computer Science Review · doi:10.1016/j.cosrev.2018.11.002 · Cited by 646
Childs, A. M., Kothari, R., & Somma, R. D. (2017) · SIAM Journal on Computing · doi:10.1137/16m1087072 · Cited by 646
“Another recent algorithm to estimate hitting times of Markov chains [CS16] uses the framework laid out in this paper (in Section 2) and closely follows our first approach, which we call the Fourier approach (Section 3).”
MethodSelf-citationGilyén, A., Su, Y., Low, G. H., & Wiebe, N. (2019) · Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing · doi:10.1145/3313276.3316366 · Cited by 542
Quantum machine learning: a classical perspective
Ciliberto, C., Herbster, M., Ialongo, A. D., Pontil, M., Rocchetto, A., Severini, S., & Wossnig, L. (2018) · Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.2017.0551 · Cited by 518
Opportunities and challenges for quantum-assisted machine learning in near-term quantum computers
Perdomo-Ortiz, A., Benedetti, M., Realpe-Gómez, J., & Biswas, R. (2018) · Quantum Science and Technology · doi:10.1088/2058-9565/aab859 · Cited by 274
“In this work, we focus on the use of quantum devices to sample classical [56] or quantum [19, 57] Gibbs distributions as an alternative to MCMC methods.”
MethodTomography and generative training with quantum Boltzmann machines
Kieferová, M., & Wiebe, N. (2017) · Physical Review A · doi:10.1103/physreva.96.062327 · Cited by 170
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
“Here we can apply known results [13], [14] on using amplitude amplification to prepare Gibbs states on a quantum computer in time given roughly by the square root of the dimension of the system.”
BackgroundMethod
Metadata
- Authors
- Chowdhury and, A. N., & Somma, R. D.
- Venue
- Quantum Information and Computation
- Publisher
- Rinton Press
- Published
- 2017-01
- Volume
- 17
- Issue
- 1&2
- Pages
- 41-64
- ISSN
- 1533-7146 (ISSN-L)
- OpenAlex
- W2397157153
- Cited by
- 76
- References
- 7
- FWCI
- 3.44
- Type
- journal article
- Language
- en
- Open access
- closed
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
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.