Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Springer eBooks

Problem Limitations and Cost Effectiveness Considerations in Computational Quantum Chemistry

John Stephen Binkley

Published Jan 1, 1984• 0 citations
Publisher
DOI
10.1007/978-94-009-6451-8_12

Related papers

Computational Imperatives in Quantum Chemistry

BuhmSoon Park

•Jul 2, 2007•1 citation

Quantum Computing Beyond Ground-State Electronic Structure: A Review of Progress Toward Quantum Chemistry Out of the Ground State

Alan Bidart, Prateek Vaish, Tilas Kabengele +3 more

Quantum computing offers the promise of revolutionizing quantum chemistry by enabling the solution of chemical problems for substantially less computational cost. While most demonstrations of quantum computation to date have focused on resolving the energies of the electronic ground states of small molecules, the field of quantum chemistry is far broader than ground-state chemistry; equally important to practicing chemists are chemical reaction dynamics and reaction mechanism prediction. Here, we review progress toward and the potential of quantum computation for understanding quantum chemistry beyond the ground state, including for reaction mechanisms, reaction dynamics, and finite-temperature quantum chemistry. We discuss algorithmic and other considerations these applications share, as well as differences that make them unique. We also highlight the potential speedups these applications may realize and challenges they may face. We hope that this discussion stimulates further research into how quantum computation may better inform experimental chemistry in the future.

arXiv:2509.19709•Annual Review of Physical Chemistry•Feb 27, 2026•7 citations

Semiempirical Quantum Chemistry in the Age of ab initio Data and Differentiable Programming: I. Differentiable Molecular Orbital Theory

Martin Stöhr, Todd J. Martínez

Semiempirical quantum chemistry (SQC) methods offer fast quantum chemical insights by constructing and solving a parametric effective minimal basis Fock matrix. Establishing suitable parametrizations has long been a challenging and time-consuming task involving tedious grid searches or costly finite-difference gradients of carefully crafted loss functions based on select experimental data. The growing availability of differentiable programming environments that leverage algorithmic differentiation to obtain complicated derivatives together with access to a wealth of reliable reference data from ab initio calculations offers a new and more efficient approach. In this work, we extend a previous, basic implementation of SQC methods in PyTorch [ Zhou, G. J. Chem. Theory Comput. 2020, 16, 4951–4962] by including global algorithmic considerations in the code design. This allows for improved general applicability and establishes a robust back-end for rapid SQC parametrizations. In particular, we address the general differentiability of the eigensolver and the iterative SCF procedure. The new implementation offers dramatic improvements in both computing cost and memory footprint, while simultaneously increasing numeric stability in gradient evaluation. We highlight the importance of these advances and their improvements over existing formulations and illustrate their role in the context of SQC parametrization.

Journal of Chemical Theory and Computation•Jan 8, 2026•3 citations

Conceptual and computational advances in quantum chemistry

Piotr Piecuch B

Springer eBooks•Jan 1, 2009•0 citations

Looking elsewhere: improving variational Monte Carlo gradients by importance sampling

Antoine Misery, Luca Gravina, Alessandro Santini +1 more

Abstract Neural-network quantum states (NQSs) offer a powerful and expressive ansatz for representing quantum many-body wave functions. However, their training via Variational Monte Carlo (VMC) methods remains challenging. It is well known that some scenarios—such as sharply peaked wave functions emerging in quantum chemistry—lead to high-variance gradient estimators hindering the effectiveness of variational optimizations. In this work we investigate a systematic strategy to tackle those sampling issues by means of adaptively tuned importance sampling. Our approach is explicitly designed to target the gradient estimator instead of the loss function, and be computationally inexpensive. We benchmarked our approach across the ground-state search of a wide variety of hamiltonians, including frustrated spin systems and ab-initio quantum chemistry. Overall, our approach can reduce the computational cost of vanilla VMC considerably, up to a factor of 100× when targeting highly peaked quantum chemistry wavefunctions.

arXiv:2507.05352•Machine Learning Science and Technology•Jan 14, 2026•15 citations

Computational quantum chemistry

George Maroulis

AIP conference proceedings•Jan 1, 2012•15 citations
Quantum computing offers the promise of revolutionizing quantum chemistry by enabling the solution of chemical problems for substantially less computational cost. While most demonstrations of quantum computation to date have focused on resolving the energies of the electronic ground states of small molecules, the field of quantum chemistry is far broader than ground-state chemistry; equally important to practicing chemists are chemical reaction dynamics and reaction mechanism prediction. Here, we review progress toward and the potential of quantum computation for understanding quantum chemistry beyond the ground state, including for reaction mechanisms, reaction dynamics, and finite-temperature quantum chemistry. We discuss algorithmic and other considerations these applications share, as well as differences that make them unique. We also highlight the potential speedups these applications may realize and challenges they may face. We hope that this discussion stimulates further research into how quantum computation may better inform experimental chemistry in the future.
Semiempirical quantum chemistry (SQC) methods offer fast quantum chemical insights by constructing and solving a parametric effective minimal basis Fock matrix. Establishing suitable parametrizations has long been a challenging and time-consuming task involving tedious grid searches or costly finite-difference gradients of carefully crafted loss functions based on select experimental data. The growing availability of differentiable programming environments that leverage algorithmic differentiation to obtain complicated derivatives together with access to a wealth of reliable reference data from ab initio calculations offers a new and more efficient approach. In this work, we extend a previous, basic implementation of SQC methods in PyTorch [ Zhou, G. J. Chem. Theory Comput. 2020, 16, 4951–4962] by including global algorithmic considerations in the code design. This allows for improved general applicability and establishes a robust back-end for rapid SQC parametrizations. In particular, we address the general differentiability of the eigensolver and the iterative SCF procedure. The new implementation offers dramatic improvements in both computing cost and memory footprint, while simultaneously increasing numeric stability in gradient evaluation. We highlight the importance of these advances and their improvements over existing formulations and illustrate their role in the context of SQC parametrization.
Abstract Neural-network quantum states (NQSs) offer a powerful and expressive ansatz for representing quantum many-body wave functions. However, their training via Variational Monte Carlo (VMC) methods remains challenging. It is well known that some scenarios—such as sharply peaked wave functions emerging in quantum chemistry—lead to high-variance gradient estimators hindering the effectiveness of variational optimizations. In this work we investigate a systematic strategy to tackle those sampling issues by means of adaptively tuned importance sampling. Our approach is explicitly designed to target the gradient estimator instead of the loss function, and be computationally inexpensive. We benchmarked our approach across the ground-state search of a wide variety of hamiltonians, including frustrated spin systems and ab-initio quantum chemistry. Overall, our approach can reduce the computational cost of vanilla VMC considerably, up to a factor of 100× when targeting highly peaked quantum chemistry wavefunctions.