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

Chinese Physics B

Differentiable programming and density matrix based Hartree–Fock method*

Hong-Bin Ren, Lei Wang, Xi Dai

Published Mar 16, 2021• 2 citations
Publisher

Abstract

Differentiable programming is an emerging programming paradigm that allows people to take derivative of an output of arbitrary code snippet with respect to its input. It is the workhorse behind several well known deep learning frameworks, and has attracted significant attention in scientific machine learning community. In this paper, we introduce and implement a density matrix based Hartree–Fock method that naturally fits into the demands of this paradigm, and demonstrate it by performing fully variational ground state calculation on several representative chemical molecules.

DOI
10.1088/1674-1056/abeeed

Related papers

Automatic Differentiation in Quantum Chemistry with Applications to Fully Variational Hartree–Fock

Teresa Tamayo-Mendoza, Christoph Kreisbeck, Roland H. Lindh +1 more

Abstract Automatic differentiation (AD) is a powerful tool that allows calculating derivatives of implemented algorithms with respect to all of their parameters up to machine precision, without the need to explicitly add any additional functions. Thus, AD has great potential in quantum chemistry, where gradients are omnipresent but also difficult to obtain, and researchers typically spend a considerable amount of time finding suitable analytical forms when implementing derivatives. Here, we demonstrate that AD can be used to compute gradients with respect to any parameter throughout a complete quantum chemistry method. We present DiffiQult, a Hartree–Fock implementation, entirely differentiated with the use of AD tools. DiffiQult is a software package written in plain Python with minimal deviation from standard code which illustrates the capability of AD to save human effort and time in implementations of exact gradients in quantum chemistry. We leverage the obtained gradients to optimize the parameters of one-particle basis sets in the context of the floating Gaussian framework.

arXiv:1711.08127•ACS Central Science•May 9, 2018•105 citations

Differentiable quantum computational chemistry with PennyLane

Juan Miguel Arrazola, Soran Jahangiri, Alain Delgado +15 more

This work describes the theoretical foundation for all quantum chemistry functionality in PennyLane, a quantum computing software library specializing in quantum differentiable programming. We provide an overview of fundamental concepts in quantum chemistry, including the basic principles of the Hartree-Fock method. A flagship feature in PennyLane is the differentiable Hartree-Fock solver, allowing users to compute exact gradients of molecular Hamiltonians with respect to nuclear coordinates and basis set parameters. PennyLane provides specialized operations for quantum chemistry, including excitation gates as Givens rotations and templates for quantum chemistry circuits. Moreover, built-in simulators exploit sparse matrix techniques for representing molecular Hamiltonians that lead to fast simulation for quantum chemistry applications. In combination with PennyLane's existing methods for constructing, optimizing, and executing circuits, these methods allow users to implement a wide range of quantum algorithms for quantum chemistry. We discuss how PennyLane can be used to implement variational algorithms for calculating ground-state energies, excited-state energies, and energy derivatives, all of which can be differentiated with respect to both circuit and Hamiltonian parameters. We provide an example workflow describing how to jointly optimize circuit parameters, nuclear coordinates, and basis set parameters for quantum chemistry algorithms. We discuss a functionality for reducing the number of qubits by using symmetries and explain how PennyLane can be used to estimate quantum resources needed to implement several quantum algorithms. By combining insights from quantum computing, computational chemistry, and machine learning, PennyLane is the first library for differentiable quantum computational chemistry.

arXiv:2111.09967•Nov 18, 2021•42 citations

Differentiable Programming Tensor Networks

Haijun Liao, Jin-Guo Liu, Lei Wang +1 more

Differentiable programming is a fresh programming paradigm which composes parameterized algorithmic components and optimizes them using gradient search.The concept emerges from deep learning but is not limited to training neural networks.We present the theory and practice of programming tensor network algorithms in a fully differentiable way.By formulating the tensor network algorithm as a computation graph, one can compute higher-order derivatives of the program accurately and efficiently using automatic differentiation.We present essential techniques to differentiate through the tensor networks contraction algorithms, including numerical stable differentiation for tensor decompositions and efficient backpropagation through fixed-point iterations.As a demonstration, we compute the specific heat of the Ising model directly by taking the second-order derivative of the free energy obtained in the tensor renormalization group calculation.Next, we perform gradient-based variational optimization of infinite projected entangled pair states for the quantum antiferromagnetic Heisenberg model and obtain state-ofthe-art variational energy and magnetization with moderate efforts.Differentiable programming removes laborious human efforts in deriving and implementing analytical gradients for tensor network programs, which opens the door to more innovations in tensor network algorithms and applications.

arXiv:1903.09650•Physical Review X•Sep 5, 2019•283 citations

QUANTUM DEEP LEARNING FRAMEWORK FOR ACCURATE MOLECULAR GROUND-STATE ENERGY PREDICTION IN COMPLEX CHEMICAL SYSTEMS

Giribabu Sadineni, Rama Chaithanya Tanguturi

Correct prediction of the molecular ground-state energy is a fundamental problem in quantum chemistry, materials science and drug screening and discovery which directly impacts the understanding of the stability and chemical behavior of molecules. For complex molecular systems, traditional computational techniques like the Hartree-Fock and the Density Functional Theory (DFT) can be very costly. The improvement of molecular energy prediction efficiency and accuracy has recently opened new possibilities thanks to the progress in quantum computation and deep learning. In this paper, a hybrid Quantum Deep Learning Framework for Accurate Molecular Ground-State Energy Prediction in Complex Chemical Systems combining Variational Quantum Algorithms and Deep Neural Network Architectures is proposed. The framework builds molecular Hamiltonians, optimizes the quantum state with the Variational Quantum Eigensolver (VQE), and builds quantum-generated features for deep learning-based energy estimation. Performance measures used for the evaluation of the proposed model are Root Mean Square Error (RMSE), Mean Absolute Error (MAE) and Coefficient of Determination (R²). The proposed Quantum Deep Learning Framework has shown Root Mean Squared Error (RMSE), Mean Absolute Error (MAE), and R2 values equal to 0.042, 0.031, and 0.989 correspondingly, which proves higher performance from the standpoint of prediction. Prediction precision of the developed approach reaches 98.9% and exceeds that of all other methods known, including VQE, ADAPT-VQE, FermiNet, and Deep Schrödinger. Besides that, the proposed approach showed faster convergence, lower prediction variance, and higher computational efficiency during the molecular energies' prediction process. The results suggest that the proposed hybrid quantum-classical approach is promising and efficient for ground-state energy prediction of molecules, as well as useful in computational chemistry, materials discovery, and molecular design, and is scalable.

•Jun 30, 2026•0 citations

Density-matrix functional theory for the N-particle ground state

Gil Zumbach, Klaus Maschke

We discuss the one-particle density-matrix functional theory for the N-particle ground-state problem. Using the variational principle we obtain a set of self-consistent equations which could be useful for practical calculations. The derived relation between the eigenvalues of the density matrix and the chemical potential agrees with that of Gilbert. The present theory is compared with the Kohn–Sham and the Hartree–Fock approach to the ground state problem. It is found that both approaches can be obtained from the present theory under certain assumptions.

The Journal of Chemical Physics•Jun 15, 1985•72 citations

Differentiable programming of isometric tensor networks

Chenhua Geng, Hong-Ye Hu, Yijian Zou

Abstract Differentiable programming is a new programming paradigm which enables large scale optimization through automatic calculation of gradients also known as auto-differentiation. This concept emerges from deep learning, and has also been generalized to tensor network optimizations. Here, we extend the differentiable programming to tensor networks with isometric constraints with applications to multiscale entanglement renormalization ansatz (MERA) and tensor network renormalization (TNR). By introducing several gradient-based optimization methods for the isometric tensor network and comparing with Evenbly–Vidal method, we show that auto-differentiation has a better performance for both stability and accuracy. We numerically tested our methods on 1D critical quantum Ising spin chain and 2D classical Ising model. We calculate the ground state energy for the 1D quantum model and internal energy for the classical model, and scaling dimensions of scaling operators and find they all agree with the theory well.

arXiv:2110.03898•Machine Learning Science and Technology•Jan 6, 2022•15 citations
Differentiable programming is an emerging programming paradigm that allows people to take derivative of an output of arbitrary code snippet with respect to its input. It is the workhorse behind several well known deep learning frameworks, and has attracted significant attention in scientific machine learning community. In this paper, we introduce and implement a density matrix based Hartree–Fock method that naturally fits into the demands of this paradigm, and demonstrate it by performing fully variational ground state calculation on several representative chemical molecules.
Abstract Automatic differentiation (AD) is a powerful tool that allows calculating derivatives of implemented algorithms with respect to all of their parameters up to machine precision, without the need to explicitly add any additional functions. Thus, AD has great potential in quantum chemistry, where gradients are omnipresent but also difficult to obtain, and researchers typically spend a considerable amount of time finding suitable analytical forms when implementing derivatives. Here, we demonstrate that AD can be used to compute gradients with respect to any parameter throughout a complete quantum chemistry method. We present DiffiQult, a Hartree–Fock implementation, entirely differentiated with the use of AD tools. DiffiQult is a software package written in plain Python with minimal deviation from standard code which illustrates the capability of AD to save human effort and time in implementations of exact gradients in quantum chemistry. We leverage the obtained gradients to optimize the parameters of one-particle basis sets in the context of the floating Gaussian framework.
This work describes the theoretical foundation for all quantum chemistry functionality in PennyLane, a quantum computing software library specializing in quantum differentiable programming. We provide an overview of fundamental concepts in quantum chemistry, including the basic principles of the Hartree-Fock method. A flagship feature in PennyLane is the differentiable Hartree-Fock solver, allowing users to compute exact gradients of molecular Hamiltonians with respect to nuclear coordinates and basis set parameters. PennyLane provides specialized operations for quantum chemistry, including excitation gates as Givens rotations and templates for quantum chemistry circuits. Moreover, built-in simulators exploit sparse matrix techniques for representing molecular Hamiltonians that lead to fast simulation for quantum chemistry applications. In combination with PennyLane's existing methods for constructing, optimizing, and executing circuits, these methods allow users to implement a wide range of quantum algorithms for quantum chemistry. We discuss how PennyLane can be used to implement variational algorithms for calculating ground-state energies, excited-state energies, and energy derivatives, all of which can be differentiated with respect to both circuit and Hamiltonian parameters. We provide an example workflow describing how to jointly optimize circuit parameters, nuclear coordinates, and basis set parameters for quantum chemistry algorithms. We discuss a functionality for reducing the number of qubits by using symmetries and explain how PennyLane can be used to estimate quantum resources needed to implement several quantum algorithms. By combining insights from quantum computing, computational chemistry, and machine learning, PennyLane is the first library for differentiable quantum computational chemistry.
Differentiable programming is a fresh programming paradigm which composes parameterized algorithmic components and optimizes them using gradient search.The concept emerges from deep learning but is not limited to training neural networks.We present the theory and practice of programming tensor network algorithms in a fully differentiable way.By formulating the tensor network algorithm as a computation graph, one can compute higher-order derivatives of the program accurately and efficiently using automatic differentiation.We present essential techniques to differentiate through the tensor networks contraction algorithms, including numerical stable differentiation for tensor decompositions and efficient backpropagation through fixed-point iterations.As a demonstration, we compute the specific heat of the Ising model directly by taking the second-order derivative of the free energy obtained in the tensor renormalization group calculation.Next, we perform gradient-based variational optimization of infinite projected entangled pair states for the quantum antiferromagnetic Heisenberg model and obtain state-ofthe-art variational energy and magnetization with moderate efforts.Differentiable programming removes laborious human efforts in deriving and implementing analytical gradients for tensor network programs, which opens the door to more innovations in tensor network algorithms and applications.
Correct prediction of the molecular ground-state energy is a fundamental problem in quantum chemistry, materials science and drug screening and discovery which directly impacts the understanding of the stability and chemical behavior of molecules. For complex molecular systems, traditional computational techniques like the Hartree-Fock and the Density Functional Theory (DFT) can be very costly. The improvement of molecular energy prediction efficiency and accuracy has recently opened new possibilities thanks to the progress in quantum computation and deep learning. In this paper, a hybrid Quantum Deep Learning Framework for Accurate Molecular Ground-State Energy Prediction in Complex Chemical Systems combining Variational Quantum Algorithms and Deep Neural Network Architectures is proposed. The framework builds molecular Hamiltonians, optimizes the quantum state with the Variational Quantum Eigensolver (VQE), and builds quantum-generated features for deep learning-based energy estimation. Performance measures used for the evaluation of the proposed model are Root Mean Square Error (RMSE), Mean Absolute Error (MAE) and Coefficient of Determination (R²). The proposed Quantum Deep Learning Framework has shown Root Mean Squared Error (RMSE), Mean Absolute Error (MAE), and R2 values equal to 0.042, 0.031, and 0.989 correspondingly, which proves higher performance from the standpoint of prediction. Prediction precision of the developed approach reaches 98.9% and exceeds that of all other methods known, including VQE, ADAPT-VQE, FermiNet, and Deep Schrödinger. Besides that, the proposed approach showed faster convergence, lower prediction variance, and higher computational efficiency during the molecular energies' prediction process. The results suggest that the proposed hybrid quantum-classical approach is promising and efficient for ground-state energy prediction of molecules, as well as useful in computational chemistry, materials discovery, and molecular design, and is scalable.
We discuss the one-particle density-matrix functional theory for the N-particle ground-state problem. Using the variational principle we obtain a set of self-consistent equations which could be useful for practical calculations. The derived relation between the eigenvalues of the density matrix and the chemical potential agrees with that of Gilbert. The present theory is compared with the Kohn–Sham and the Hartree–Fock approach to the ground state problem. It is found that both approaches can be obtained from the present theory under certain assumptions.
Abstract Differentiable programming is a new programming paradigm which enables large scale optimization through automatic calculation of gradients also known as auto-differentiation. This concept emerges from deep learning, and has also been generalized to tensor network optimizations. Here, we extend the differentiable programming to tensor networks with isometric constraints with applications to multiscale entanglement renormalization ansatz (MERA) and tensor network renormalization (TNR). By introducing several gradient-based optimization methods for the isometric tensor network and comparing with Evenbly–Vidal method, we show that auto-differentiation has a better performance for both stability and accuracy. We numerically tested our methods on 1D critical quantum Ising spin chain and 2D classical Ising model. We calculate the ground state energy for the 1D quantum model and internal energy for the classical model, and scaling dimensions of scaling operators and find they all agree with the theory well.