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

arXiv:2011.01544 · The European Physical Journal Special Topics

Post-Hartree–Fock method in quantum chemistry for quantum computer

Yutaka Shikano, Hiroshi C. Watanabe, Ken M. Nakanishi, Yu‐ya Ohnishi

Published Apr 26, 2021• 20 citations
arXivHTMLPDF
DOI
10.1140/epjs/s11734-021-00087-z

Related papers

Computational Nuclear Physics and Post Hartree-Fock Methods

Justin G. Lietz, Samuel J. Novario, G. R. Jansen +2 more

arXiv:1611.06765•Lecture notes in physics•Jan 1, 2017•10 citations

Quantum computation for quantum chemistry

Alán Aspuru‐Guzik

Bulletin of the American Physical Society•May 29, 2010•0 citations

Limitations of Hartree–Fock with quantum resources

Sahil Gulania, James Daniel Whitfield

The Hartree-Fock problem provides the conceptual and mathematical underpinning of a large portion of quantum chemistry. As efforts in quantum technology aim to enhance computational chemistry algorithms, the Hartree-Fock method, central to many other numerical approaches, is a natural target for quantum enhanced algorithms. While quantum computers and quantum simulation offer many prospects for the future of modern chemistry, the non-deterministic polynomial-complete Hartree-Fock problem is not a likely candidate. We highlight this fact from a number of perspectives including computational complexity, practical examples, and the full characterization of energy landscapes for simple systems.

arXiv:2007.09806•The Journal of Chemical Physics•Jan 28, 2021•8 citations

Quantum chemical calculations by the real quantum computer

Takumi Kato, Koji Okuwaki, Yuji Mochizuki +2 more

The Japan Society of Applied Physics•Jul 6, 2021•0 citations

Quantum Chemistry on Quantum Computers: A Method for Preparation of Multiconfigurational Wave Functions on Quantum Computers without Performing Post-Hartree–Fock Calculations

Kenji Sugisaki, Shigeaki Nakazawa, Kazuo Toyota +3 more

The full configuration interaction (full-CI) method is capable of providing the numerically best wave functions and energies of atoms and molecules within basis sets being used, although it is intractable for classical computers. Quantum computers can perform full-CI calculations in polynomial time against the system size by adopting a quantum phase estimation algorithm (QPEA). In the QPEA, the preparation of initial guess wave functions having sufficiently large overlap with the exact wave function is recommended. The Hartree-Fock (HF) wave function is a good initial guess only for closed shell singlet molecules and high-spin molecules carrying no spin-β unpaired electrons, around their equilibrium geometry, and thus, the construction of multiconfigurational wave functions without performing post-HF calculations on classical computers is highly desired for applying the method to a wide variety of chemistries and physics. In this work, we propose a method to construct multiconfigurational initial guess wave functions suitable for QPEA-based full-CI calculations on quantum computers, by utilizing diradical characters computed from spin-projected UHF wave functions. The proposed approach drastically improves the wave function overlap, particularly in molecules with intermediate diradical characters.

ACS Central Science•Dec 31, 2018•90 citations

GANSU: A GPU-Native Quantum Chemistry Framework for Efficient Hartree–Fock and Post-HF Calculations

Yasuaki Ito, Satoki Tsuji, Koji Nakano +1 more

GPU-accelerated quantum chemistry programs can dramatically reduce the time required for electronic structure calculations, yet most existing implementations either retrofit GPU kernels onto legacy CPU codebases or optimize individual kernels without addressing workflow-level integration overhead. We present GANSU (GPU Accelerated Numerical Simulation Utility), an open-source quantum chemistry framework written entirely in CUDA/C++ that integrates GPU-accelerated kernels for electron repulsion integrals, Fock matrix construction, and post-Hartree–Fock (post-HF) methods into a unified, GPU-resident execution pipeline. The key design principle is to eliminate host–device data transfers between computational stages by keeping all intermediate data, including density matrices, integral buffers, and Fock matrix replicas, on the GPU throughout the self-consistent field (SCF) iteration, combined with runtime-selectable integral strategies (stored ERI, resolution-of-the-identity, and Direct-SCF) that adapt to system size and available memory. On an NVIDIA H200 GPU, GANSU achieves end-to-end speedups of up to 52× over PySCF for SCF, 45× for MP2 on molecules with up to 470 basis functions, and 44× for FCI, while outperforming GPU4PySCF by up to 34× for FCI, across a range of molecular systems with up to 650 basis functions. The framework further provides analytical energy gradients and geometry optimization with nine algorithms, all operating within the same GPU-resident data flow. These results demonstrate that workflow-aware kernel integration, not just kernel-level optimization, is essential for realizing the full potential of GPU acceleration in scientific computing. GANSU is publicly available under the BSD-3-Clause license.

Eng—Advances in Engineering•Apr 28, 2026•1 citation
The Hartree-Fock problem provides the conceptual and mathematical underpinning of a large portion of quantum chemistry. As efforts in quantum technology aim to enhance computational chemistry algorithms, the Hartree-Fock method, central to many other numerical approaches, is a natural target for quantum enhanced algorithms. While quantum computers and quantum simulation offer many prospects for the future of modern chemistry, the non-deterministic polynomial-complete Hartree-Fock problem is not a likely candidate. We highlight this fact from a number of perspectives including computational complexity, practical examples, and the full characterization of energy landscapes for simple systems.
The full configuration interaction (full-CI) method is capable of providing the numerically best wave functions and energies of atoms and molecules within basis sets being used, although it is intractable for classical computers. Quantum computers can perform full-CI calculations in polynomial time against the system size by adopting a quantum phase estimation algorithm (QPEA). In the QPEA, the preparation of initial guess wave functions having sufficiently large overlap with the exact wave function is recommended. The Hartree-Fock (HF) wave function is a good initial guess only for closed shell singlet molecules and high-spin molecules carrying no spin-β unpaired electrons, around their equilibrium geometry, and thus, the construction of multiconfigurational wave functions without performing post-HF calculations on classical computers is highly desired for applying the method to a wide variety of chemistries and physics. In this work, we propose a method to construct multiconfigurational initial guess wave functions suitable for QPEA-based full-CI calculations on quantum computers, by utilizing diradical characters computed from spin-projected UHF wave functions. The proposed approach drastically improves the wave function overlap, particularly in molecules with intermediate diradical characters.
GPU-accelerated quantum chemistry programs can dramatically reduce the time required for electronic structure calculations, yet most existing implementations either retrofit GPU kernels onto legacy CPU codebases or optimize individual kernels without addressing workflow-level integration overhead. We present GANSU (GPU Accelerated Numerical Simulation Utility), an open-source quantum chemistry framework written entirely in CUDA/C++ that integrates GPU-accelerated kernels for electron repulsion integrals, Fock matrix construction, and post-Hartree–Fock (post-HF) methods into a unified, GPU-resident execution pipeline. The key design principle is to eliminate host–device data transfers between computational stages by keeping all intermediate data, including density matrices, integral buffers, and Fock matrix replicas, on the GPU throughout the self-consistent field (SCF) iteration, combined with runtime-selectable integral strategies (stored ERI, resolution-of-the-identity, and Direct-SCF) that adapt to system size and available memory. On an NVIDIA H200 GPU, GANSU achieves end-to-end speedups of up to 52× over PySCF for SCF, 45× for MP2 on molecules with up to 470 basis functions, and 44× for FCI, while outperforming GPU4PySCF by up to 34× for FCI, across a range of molecular systems with up to 650 basis functions. The framework further provides analytical energy gradients and geometry optimization with nine algorithms, all operating within the same GPU-resident data flow. These results demonstrate that workflow-aware kernel integration, not just kernel-level optimization, is essential for realizing the full potential of GPU acceleration in scientific computing. GANSU is publicly available under the BSD-3-Clause license.