The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Finding Exponential Product Formulas of Higher Orders
Open accessAbstract
This article is based on a talk presented at a conference “Quantum Annealing and Other Optimization Methods” held at Kolkata, India on March 2–5, 2005. It will be published in the proceedings “Quantum Annealing and Other Optimization Methods” (Springer, Heidelberg) pp. 39–70. In the present article, we review the progress in the last two decades of the work on the Suzuki-Trotter decomposition, or the exponential product formula. The simplest Suzuki-Trotter decomposition, or the well-known Trotter decomposition [1–4] is given by e x(A+B) = e xA e xB + O(x 2 ), (1) where x is a parameter and A and B are arbitrary operators with some commutation relation [A, B] 6 0. Here the product of the exponential operators on the right-hand side is regarded as an approximate decomposition of the exponential operator on the left-hand side with correction terms of the second order of x. Mathematicians put Eq. (1) in the form e xA e xB = e x(A+B)+O(x 2 ) (2)
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
Quantum annealing in the transverse Ising model
Kadowaki, T., & Nishimori, H. (1998) · Physical Review E · doi:10.1103/physreve.58.5355 · Cited by 2,339
Suzuki, M. (1976) · Communications in Mathematical Physics · doi:10.1007/bf01609348 · Cited by 895
Self-citation
Cited by
An adaptive variational algorithm for exact molecular simulations on a quantum computer
Grimsley, H. R., Economou, S. E., Barnes, E., & Mayhall, N. J. (2019) · Nature Communications · doi:10.1038/s41467-019-10988-2 · Cited by 1,033
Practical quantum advantage in quantum simulation
Daley, A. J., Bloch, I., Kokail, C., Flannigan, S., Pearson, N., Troyer, M., & Zoller, P. (2022) · Nature · doi:10.1038/s41586-022-04940-6 · Cited by 669
Hand-waving and interpretive dance: an introductory course on tensor networks
Bridgeman, J. C., & Chubb, C. T. (2017) · Journal of Physics A: Mathematical and Theoretical · doi:10.1088/1751-8121/aa6dc3 · Cited by 407
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
Simulating quantum many-body dynamics on a current digital quantum computer
Smith, A., Kim, M. S., Pollmann, F., & Knolle, J. (2019) · npj Quantum Information · doi:10.1038/s41534-019-0217-0 · Cited by 278
Veis, L., Višňák, J., Nishizawa, H., Nakai, H., & Pittner, J. (2016) · International Journal of Quantum Chemistry · doi:10.1002/qua.25176 · Cited by 55
Parallel time-dependent variational principle algorithm for matrix product states
Secular, P., Gourianov, N., Lubasch, M., Dolgov, S., Clark, S. R., & Jaksch, D. (2020) · Physical Review B · doi:10.1103/physrevb.101.235123 · Cited by 40
Minimum Trotterization Formulas for a Time-Dependent Hamiltonian
Ikeda, T. N., Abrar, A., Chuang, I. L., & Sugiura, S. (2023) · Quantum · doi:10.22331/q-2023-11-06-1168 · Cited by 14
Metadata
- Authors
- Hatano, N., & Suzuki, M.
- Venue
- Lecture Notes in Physics
- Publisher
- Springer Berlin Heidelberg
- Published
- 2005-11-16
- Pages
- 37-68
- ISSN
- 0075-8450 (ISSN-L)
- 1616-6361
- OpenAlex
- W1622946479
- Cited by
- 236
- References
- 2
- FWCI
- 4.14
- Type
- book chapter
- 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.