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

Global minimizers in quantum-chemistry

Janani Chandrasekhar

Published Aug 10, 1994• 0 citations
OpenAlex

Related papers

Direct minimization methods in quantum chemistry

R. N. Dixon, D. Garton, Brian T. Sutcliffe

Royal Society of Chemistry eBooks•Jan 1, 1974•7 citations

Deterministic global optimization in ab-initio quantum chemistry

Pete P. Janes, Alistair P. L. Rendell

Journal of Global Optimization•Feb 13, 2012•3 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

Models for Quantum Chemistry

Hinne Hettema

European studies in philosophy of science•Jan 1, 2017•0 citations

The Quantum Chemistry of Reactivity. The Quantum Chemistry of Reactivity. The Photonic Hypothesis

Eduardo Medina de la Rosa, Ramiro García

In this paper we introduce several ideas on the quantum chemical aspects of the reactivity as the new definition of reaction coordinate, microchemical reaction system, microchemical equilibrium, “excluding” global Hamiltonian, global wavefunction for a microchemical reaction system, and develop many of them . Also we pretend introduce the time dependent Schrodinger equation and use the programmable computational program Maple 9.5 for solving it.

•Dec 1, 2003•0 citations

Horizons of Quantum Chemistry

Ken–ichi Fukui, Bernard Pullman

Springer eBooks•Jan 1, 1980•306 citations
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.