Problem of equilibration and the computation of correlation functions on a quantum computer
Open accessThe DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Abstract
We address the question of how a quantum computer can be used to simulate experiments on quantum systems in thermal equilibrium. We present two approaches for the preparation of the equilibrium state on a quantum computer. For both approaches, we show that the output state of the algorithm, after long enough time, is the desired equilibrium. We present a numerical analysis of one of these approaches for small systems. We show how equilibrium (time-)correlation functions can be efficiently estimated on a quantum computer, given a preparation of the equilibrium state. The quantum algorithms that we present are hard to simulate on a classical computer. This indicates that they could provide an exponential speedup over what can be achieved with a classical device.
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
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539795293172 · Cited by 8,472
On the generators of quantum dynamical semigroups
Lindblad, G. (1976) · Communications in Mathematical Physics · doi:10.1007/bf01608499 · Cited by 7,548
Quantum theory, the Church–Turing principle and the universal quantum computer
Deutsch, D. (1985) · Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences · doi:10.1098/rspa.1985.0070 · Cited by 4,597
Lloyd, S. (1996) · Science · doi:10.1126/science.273.5278.1073 · Cited by 3,088
Quantum Theory: Concepts and Methods
Peres, A., & Ballentine, L. E. (1995) · American Journal of Physics · doi:10.1119/1.17946 · Cited by 2,561
Dynamical Decoupling of Open Quantum Systems
Viola, L., Knill, E., & Lloyd, S. (1999) · Physical Review Letters · doi:10.1103/physrevlett.82.2417 · Cited by 1,808 · cited 1×
“In the regime in which the heat bath has a non-Markovian character it has been shown to be possible to alter the Hamiltonian of the system and the coupling to the bath dynamically (see [43], but also standard books on NMR [33]).”
BackgroundBulk Spin-Resonance Quantum Computation
Gershenfeld, N. A., & Chuang, I. L. (1997) · Science · doi:10.1126/science.275.5298.350 · Cited by 1,528
Quantum computations: algorithms and error correction
Kitaev, A. Y. (1997) · Russian Mathematical Surveys · doi:10.1070/rm1997v052n06abeh002155 · Cited by 1,424
Principles of Nuclear Magnetic Resonance in One and Two Dimensions
Ernst, R. R., Bodenhausen, G., & Wokaun, A. (1990) · doi:10.1093/oso/9780198556473.001.0001 · Cited by 1,418
Quantum Dynamical Semigroups and Applications
(2007) · Lecture Notes in Physics · doi:10.1007/3-540-70861-8 · Cited by 1,182 · cited 4×
“Note also the similarity with the Fermi Golden Rule [22,36] that describes the transition probability from eigenlevel n to m in a unitary evolution that is perturbed by a time-dependent Hamiltonian.”
BackgroundMethodInfluential
Cited by
Georgescu, I. M., Ashhab, S., & Nori, F. (2014) · Reviews of Modern Physics · doi:10.1103/revmodphys.86.153 · Cited by 2,932
“General methods for simulating the markovian dynamics of open quantum systems have been investigated in (Bacon et al., 2001; Terhal and DiVincenzo, 2000; Wang et al., 2011).”
BackgroundMethodQuantum Algorithms for Quantum Chemistry and Quantum Materials Science
Bauer, B., Bravyi, S., Motta, M., & Chan, G. K.-L. (2020) · Chemical Reviews · doi:10.1021/acs.chemrev.9b00829 · Cited by 848
Motta, M., Sun, C., Tan, A. T. K., O’Rourke, M. J., Ye, E., Minnich, A. J., Brandão, F. G. S. L., & Chan, G. K.-L. (2020) · Nature Physics · doi:10.1038/s41567-019-0704-4 · Cited by 709
Simulating physical phenomena by quantum networks
Somma, R., Ortiz, G., Gubernatis, J. E., Knill, E., & Laflamme, R. (2002) · Physical Review A · doi:10.1103/physreva.65.042323 · Cited by 365
Simulating Chemistry Using Quantum Computers
Kassal, I., Whitfield, J. D., Perdomo-Ortiz, A., Yung, M.-H., & Aspuru-Guzik, A. (2011) · Annual Review of Physical Chemistry · doi:10.1146/annurev-physchem-032210-103512 · Cited by 352
Quantum channels and memory effects
Caruso, F., Giovannetti, V., Lupo, C., & Mancini, S. (2012) · arXiv · doi:10.48550/arxiv.1207.5435 · Cited by 331
Quantum channels and memory effects
Caruso, F., Giovannetti, V., Lupo, C., & Mancini, S. (2014) · Reviews of Modern Physics · doi:10.1103/revmodphys.86.1203 · Cited by 330
Thermalizing Quantum Machines: Dissipation and Entanglement
Scarani, V., Ziman, M., Štelmachovič, P., Gisin, N., & Bužek, V. (2002) · Physical Review Letters · doi:10.1103/physrevlett.88.097905 · Cited by 313
Temme, K., Osborne, T. J., Vollbrecht, K. G., Poulin, D., & Verstraete, F. (2011) · Nature · doi:10.1038/nature09770 · Cited by 305
Detecting quantum entanglement
Terhal, B. M. (2002) · Theoretical Computer Science · doi:10.1016/s0304-3975(02)00139-1 · Cited by 273
Self-citationEntanglement in the steady state of a collective-angular-momentum (Dicke) model
Schneider, S., & Milburn, G. J. (2002) · Physical Review A · doi:10.1103/physreva.65.042107 · Cited by 265
Using Quantum Computers for Quantum Simulation
Brown, K. L., Munro, W. J., & Kendon, V. M. (2010) · Entropy · doi:10.3390/e12112268 · Cited by 129
“Terhal and DiVincenzo don’t give explicit bounds on the running time of their method, though they do discus reasons why they don’t expect it to be efficient in the general case.”
BackgroundInfluentialQuantum algorithm for simulating the dynamics of an open quantum system
Wang, H., Ashhab, S., & Nori, F. (2011) · Physical Review A · doi:10.1103/physreva.83.062317 · Cited by 106
Wiebe, N., Kapoor, A., & Svore, K. M. (2016) · Quantum Information and Computation · doi:10.26421/qic16.7-8-1 · Cited by 85
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
“[12] Barbara M Terhal and David P DiVincenzo.”
BackgroundSolving quantum statistical mechanics with variational autoregressive networks and quantum circuits
Liu, J.-G., Mao, L., Zhang, P., & Wang, L. (2021) · Machine Learning: Science and Technology · doi:10.1088/2632-2153/aba19d · Cited by 57
Preparation of many-body states for quantum simulation
Ward, N. J., Kassal, I., & Aspuru-Guzik, A. (2009) · The Journal of Chemical Physics · doi:10.1063/1.3115177 · Cited by 54
Lidar, D. A. (2004) · New Journal of Physics · doi:10.1088/1367-2630/6/1/167 · Cited by 33
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
- Terhal, B. M., & DiVincenzo, D. P.
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 2000-01-04
- Volume
- 61
- Issue
- 2
- ISSN
- 0556-2791 (ISSN-L)
- 1050-2947
- 1094-1622
- OpenAlex
- W2044885737
- Cited by
- 189
- References
- 16
- FWCI
- 7.08
- 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
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.