The DOI matches its Crossref record; 115 of the 115 references it cites were found in a registry or an index.
Calculating the thermal rate constant with exponential speedup on a quantum computer
Open accessAbstract
It is shown how to formulate the ubiquitous quantum chemistry problem of calculating the thermal rate constant on a quantum computer. The resulting exact algorithm scales exponentially faster with the dimensionality of the system than all known ``classical'' algorithms for this problem.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“The first quantum algorithms suited particularly for quantum chemistry appeared as early as the late 1990s. These include, for instance, simulating fermionic Hamiltonians 43 and the quantum algorithm for calculating thermal rate constant efficiently 44 .”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [43]
In the citing paper
“It has been shown that quantum computers avoid the dynamical sign problem 43 providing a more effective alternative to classical methods for quantum simulation.”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [43]
In the citing paper
“Quantum computation circumvents the main issues encountered in classical methods by maintaining a highly entangled quantum state which may not admit efficient classical description, enabling a fundamentally different approach to realizing the unitary evolution and in doing so avoids the dynamical sign problem 43 .”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [43]
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
GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
Saad, Y., & Schultz, M. H. (1986) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0907058 · Cited by 11,280
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
Simulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691
Mathematical Foundations of Quantum Mechanics
von Neumann, J. (2018) · Princeton University Press eBooks · doi:10.1515/9781400889921 · Cited by 5,072
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
Lanczos, C. (1950) · Journal of research of the National Bureau of Standards · doi:10.6028/jres.045.026 · Cited by 4,356
Quantum Mechanics Helps in Searching for a Needle in a Haystack
Grover, L. K. (1997) · Physical Review Letters · doi:10.1103/physrevlett.79.325 · Cited by 4,306
Quantum Computations with Cold Trapped Ions
Cirac, J. I., & Zoller, P. (1995) · Physical Review Letters · doi:10.1103/physrevlett.74.4091 · Cited by 3,733
Solution of the Schrödinger equation by a spectral method
Feit, M. D., Fleck, J. A., & Steiger, A. (1982) · Journal of Computational Physics · doi:10.1016/0021-9991(82)90091-2 · Cited by 3,375
Mathematical foundations of quantum mechanics
Offenbacher, E. L. (1955) · Journal of the Franklin Institute · doi:10.1016/0016-0032(55)90752-3 · Cited by 3,129
Flagged first, then by citations
Research works printed but not linked: 5
- W. H. Miller, 1998, J. Phys. Chem., 102, 793, 10.1021/jp973208o · DOI
- F. Matzkies, 1997, J. Chem. Phys., 2647
- C. Scheurer, 1995, J. Chem. Phys., 2869
- R. Kosloff, 1988, J. Phys. C, 92, 2087
- A. Ekert, 1998, Philos. Trans. R. Soc. London Ser. A, 356, 1765
Cited by
Sorted by citations
Items 101–116 of 116
Quantum Transition Rates in Arbitrary Physical Processes
del Campo, A., Grabarits, A., Makarov, D. E., & Shinn, S.-H. (2026) · Physical Review Letters · doi:10.1103/l7dq-n61h · Cited by 1
QuaSiMo: A composable library to program hybrid workflows for quantum simulation
Nguyen, T., Oftelie, L. B., Lotshaw, P. C., Lyakh, D. I., McCaskey, A., Leyton‐Ortega, V., Pooser, R. C., Elwasif, W. R., Humble, T. S., & de Jong, W. A. (2021) · IET Quantum Communication · doi:10.1049/qtc2.12024 · Cited by 2
Spin-Boson Model to Demonstrate Quantum Tunneling in Biomolecules using IBM Quantum ComputerPreprint
Mohanta, Y., Dhurjati, S. A., Pruthvi, K., Kumar, V., Behera, B. K., & Panigrahi, P. K. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1807.00323 · Cited by 2
Multiple Network Alignment on Quantum ComputersPreprint
Daskin, A., Grama, A. Y., & Kais, S. (2016) · Cited by 2
Algorithms Bridging Quantum Computation and Chemistry
McClean, J. R. (2015) · Digital Access to Scholarship at Harvard (DASH) (Harvard University) · Cited by 1
Open quantum system dynamics for describing state transfer
Zuniga-Hansen, N. (2014) · OpenSIUC (Southern Illinois University Carbondale)
At the intersection of quantum computing and quantum chemistry
Whitfield, J. D. (2011)
Quantum Chemistry on a Quantum Computer: First Steps and Prospects
Lanyon, B. P., Whitfield, J. D., Gillett, G., Goggin, M. E., de Almeida, M. P., Kassal, I., Biamonte, J., Mohseni, M., Powell, B. J., Barbieri, M., et al. (2009) · Frontiers in Optics · doi:10.1364/fio.2009.jwd3
Simulating Quantum Systems in Biology, Chemistry, and Physics
White, A. G. (2011) · International Conference on Quantum Information · doi:10.1364/icqi.2011.qwa1
Whiteld, J. D. (2011)
Quantum Simulation of Dzyaloshinsky-Moriya InteractionPreprint
Manu, V. S., & Kumar, A. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1301.2753
Reif, J. H. (2009) · Wiley eBooks · doi:10.1002/9780470429983.ch3
Jansen, N. D., & Hunt, K. L. C. (2025) · Entropy · doi:10.3390/e27090891 · Cited by 1
Reducing T-count and T-depth in approximate quantum Fourier transform circuits
Park, B., & Ahn, D. (2025) · Scientific Reports · doi:10.1038/s41598-025-21087-2
Randomization accelerating series-truncated quantum algorithms
Wang, Y., & Zhao, Q. (2026) · Physical Review A · doi:10.1103/5bbv-wr5n · Cited by 7
Calculations of Ground-State Energy Eigenvalues in Hadron Physics with Quantum Simulation
Zhu, C., 李, G. 刚. L., Song, M., & Luo, X. (2026) · International Journal of Theoretical Physics · doi:10.1007/s10773-026-06359-5
Metadata
- Authors
- Lidar, D. A., & Wang, H.
- Affiliations
- University of California, Berkeley (US)
- Venue
- Physical Review E
- Publisher
- American Physical Society (APS)
- Published
- 1999-02-01
- Volume
- 59
- Issue
- 2
- Pages
- 2429-2438
- ISSN
- 1063-651X (ISSN-L)
- 1095-3787
- OpenAlex
- W1997740743
- Cited by
- 115
- References
- 115
- Citations by year
- 2026: 5 · 2025: 7 · 2024: 1 · 2023: 3 · 2022: 6 · 2021: 9 · 2020: 4 · 2019: 5 · 2018: 7 · 2017: 3 · 2016: 2 · 2015: 3 · 2014: 15 · 2013: 4 · 2012: 6
- FWCI
- 0.83
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Advanced Chemical Physics Studies
- Keywords
- thermal rate constants, quantum computing, quantum algorithms, exponential speedup, reaction rate, quantum chemistry, algorithmic complexity
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
