Simultaneously Optimizing Symmetry Shifts and Tensor Factorizations for Cost-Efficient Fault-Tolerant Quantum Simulations of Electronic Hamiltonians
Open accessThe DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
Abstract
In fault-tolerant quantum computing, the cost of calculating Hamiltonian eigenvalues using the quantum phase estimation algorithm is proportional to the constant scaling the Hamiltonian matrix block-encoded in a unitary circuit. We present a method to reduce this scaling constant for the electronic Hamiltonians represented as a linear combination of unitaries. Our approach combines the double tensor-factorization method of Burg et al. with the block-invariant symmetry shift method of Loaiza and Izmaylov. By extending the electronic Hamiltonian with appropriately parametrized symmetry operators and optimizing the tensor factorization parameters, our method achieves a 25% reduction in the block-encoding scaling constant compared to previous best techniques for industrially and biologically relevant molecules, including the nitrogenase cofactor (FeMoCo) and cytochrome P450. Benchmark calculations comparing our method with the original double-factorization method show a 75% reduction in the block-encoding scaling constant. The resulting savings in the number of non-Clifford T-gates, which are an essential resource for fault-tolerant quantum computation, are expected to accelerate the journey to the feasibility of practical Hamiltonian simulations.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The text we found for this paper looks like another document, so the self-check wasn’t run.
Citations
Cites
Molecular Electronic‐Structure Theory
Helgaker, T., Jørgensen, P., & Olsen, J. (2000) · doi:10.1002/9781119019572 · Cited by 2,594
P450 Enzymes: Their Structure, Reactivity, and Selectivity—Modeled by QM/MM Calculations
Shaik, S., Cohen, S., Wang, Y., Chen, H., Kumar, D., & Thiel, W. (2010) · Chemical Reviews · doi:10.1021/cr900121s · Cited by 1,083
Hamiltonian Simulation by Qubitization
Low, G. H., & Chuang, I. L. (2019) · Quantum · doi:10.22331/q-2019-07-12-163 · Cited by 854
Quantum Algorithm Providing Exponential Speed Increase for Finding Eigenvalues and Eigenvectors
Abrams, D. S., & Lloyd, S. (1999) · Physical Review Letters · doi:10.1103/physrevlett.83.5162 · Cited by 817
Elucidating reaction mechanisms on quantum computers
Reiher, M., Wiebe, N., Svore, K. M., Wecker, D., & Troyer, M. (2017) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1619152114 · Cited by 745
Hamiltonian Simulation by Qubitization
Low, G. H., & Chuang, I. L. (2019) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 714
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
Even 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
Quantum computing enhanced computational catalysis
von Burg, V., Low, G. H., Häner, T., Steiger, D. S., Reiher, M., Roetteler, M., & Troyer, M. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.033055 · Cited by 252
Research works printed but not linked: 3
- Gidney, C.; Shutty, N.; Jones, C. Magic state cultivation: growing T states as cheap as CNOT gates. 2024. https://arxiv.org/abs/2409.17595. · arXiv
- Bellonzi, N. Feasibility of accelerating homogeneous catalyst discovery with fault-tolerant quantum computers. 2024. https://arxiv.org/abs/2406.06335. · arXiv
- Kingma, D. P.; Ba, J. Adam: A Method for Stochastic Optimization. 2017. https://arxiv.org/abs/1412.6980. · arXiv
Cited by
Still being checked.
Metadata
- Authors
- Deka, K., & Zak, E.
- Affiliations
- BEIT sp. z o.o., Mogilska 43, 31-545 Kraków, Poland
- Corresponding author
- Deka, Konrad
- Zak, Emil
- Venue
- Journal of Chemical Theory and Computation
- Publisher
- American Chemical Society (ACS)
- Published
- 2025-04-22
- Volume
- 21
- Issue
- 9
- Pages
- 4458-4465
- ISSN
- 1549-9618 (ISSN-L)
- 1549-9626
- OpenAlex
- W4409654607
- Cited by
- 4
- References
- 30
- Citations by year
- 2026: 2 · 2025: 2
- FWCI
- 1.61
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Licence
- Locations
- Journal of Chemical Theory and Computation (publishedVersion)
- PubMed (publishedVersion)
- arXiv (Cornell University) (submittedVersion, cc-by)
- Jagiellonian University Repository (Jagiellonian University) (submittedVersion, cc-by-nc-nd)
- arXiv (Cornell University) (cc-by)
- Funders
- HORIZON EUROPE European Innovation Council (190183782)
- 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
- electronic Hamiltonian, quantum phase estimation, block encoding, tensor decomposition, linear combination of unitaries, nitrogenase cofactors, cytochrome P450
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.