Highly Efficient and Scalable Compound Decomposition of Two-Electron Integral Tensor and Its Application in Coupled Cluster Calculations
The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
The representation and storage of two-electron integral tensors are vital in large-scale applications of accurate electronic structure methods. Low-rank representation and efficient storage strategy of integral tensors can significantly reduce the numerical overhead and consequently time-to-solution of these methods. In this work, by combining pivoted incomplete Cholesky decomposition (CD) with a follow-up truncated singular vector decomposition (SVD), we develop a decomposition strategy to approximately represent the two-electron integral tensor in terms of low-rank vectors. A systematic benchmark test on a series of 1-D, 2-D, and 3-D carbon–hydrogen systems demonstrates high efficiency and scalability of the compound two-step decomposition of the two-electron integral tensor in our implementation. For the size of the atomic basis set, N b, ranging from ∼100 up to ∼2,000, the observed numerical scaling of our implementation shows versus cost of performing single CD on the two-electron integral tensor in most of the other implementations. More importantly, this decomposition strategy can significantly reduce the storage requirement of the atomic orbital (AO) two-electron integral tensor from to with moderate decomposition thresholds. The accuracy tests have been performed using ground- and excited-state formulations of coupled cluster formalism employing single and double excitations (CCSD) on several benchmark systems including the C 60 molecule described by nearly 1,400 basis functions. The results show that the decomposition thresholds can be generally set to 10 –4 to 10 –3 to give acceptable compromise between efficiency and accuracy.
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
Coupled-cluster theory in quantum chemistry
Bartlett, R. J., & Musiał, M. (2007) · Reviews of Modern Physics · doi:10.1103/revmodphys.79.291 · Cited by 3,343
Chan, G. K.-L., & Head-Gordon, M. (2002) · The Journal of Chemical Physics · doi:10.1063/1.1449459 · Cited by 554
Cited by
The Variational Quantum Eigensolver: A review of methods and best practices
Tilly, J., Chen, H., Cao, S., Picozzi, D., Setia, K., Li, Y., Grant, E., Wossnig, L., Rungger, I., Booth, G. H., et al. (2022) · Physics Reports · doi:10.1016/j.physrep.2022.08.003 · Cited by 1,031
Exploiting chemistry and molecular systems for quantum information science
Wasielewski, M. R., Forbes, M. D. E., Frank, N. L., Kowalski, K., Scholes, G. D., Yuen-Zhou, J., Baldo, M. A., Freedman, D. E., Goldsmith, R. H., Goodson, T., et al. (2020) · Nature Reviews Chemistry · doi:10.1038/s41570-020-0200-5 · Cited by 568
Self-citationEven More Efficient Quantum Computations of Chemistry Through Tensor Hypercontraction
Lee, J., Berry, D. W., Gidney, C., Huggins, W. J., McClean, J. R., Wiebe, N., & Babbush, R. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.030305 · Cited by 304
Quantum computing enhanced computational catalysis
von Burg, V., Low, G. H., Häner, T., Steiger, D. S., Reiher, M., Roetteler, M., & Troyer, M. (2020) · arXiv · doi:10.48550/arxiv.2007.14460 · Cited by 258
Efficient and noise resilient measurements for quantum chemistry on near-term quantum computers
Huggins, W. J., McClean, J. R., Rubin, N. C., Jiang, Z., Wiebe, N., Whaley, K. B., & Babbush, R. (2021) · npj Quantum Information · doi:10.1038/s41534-020-00341-7 · Cited by 256
Qubitization of Arbitrary Basis Quantum Chemistry Leveraging Sparsity and Low Rank Factorization
Berry, D. W., Gidney, C., Motta, M., McClean, J. R., & Babbush, R. (2019) · Quantum · doi:10.22331/q-2019-12-02-208 · Cited by 222
Low rank representations for quantum simulation of electronic structure
Motta, M., Ye, E., McClean, J. R., Li, Z., Minnich, A. J., Babbush, R., & Chan, G. K.-L. (2018) · arXiv · doi:10.48550/arxiv.1808.02625 · Cited by 173
Goings, J. J., White, A., Lee, J., Tautermann, C. S., Degroote, M., Gidney, C., Shiozaki, T., Babbush, R., & Rubin, N. C. (2022) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.2203533119 · Cited by 127
Singh, H., Majumder, S., & Mishra, S. (2025) · The Journal of Chemical Physics · doi:10.1063/5.0249447 · Cited by 7
“This method, based on a two-stage decomposition of the interaction tensor [77], has been employed to minimize the overall gate depth of the whole UCCSD Ansatz, as well as the Trotter steps [78].”
Method
Metadata
- Authors
- Peng, B., & Kowalski, K.
- Venue
- Journal of Chemical Theory and Computation
- Publisher
- American Chemical Society (ACS)
- Published
- 2017-09-05
- Volume
- 13
- Issue
- 9
- Pages
- 4179-4192
- ISSN
- 1549-9618 (ISSN-L)
- 1549-9626
- OpenAlex
- W2745599374
- Cited by
- 67
- References
- 2
- FWCI
- 2.16
- 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.