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:2307.07067

Implementation of the Density-functional Theory on Quantum Computers with Linear Scaling with respect to the Number of Atoms

Taehee Ko, Xiantao Li, Chunhao Wang

Published Jul 13, 2023• 3 citations
arXivHTMLPDF

Abstract

Density-functional theory (DFT) has revolutionized computer simulations in chemistry and material science. A faithful implementation of the theory requires self-consistent calculations. However, this effort involves repeatedly diagonalizing the Hamiltonian, for which a classical algorithm typically requires a computational complexity that scales cubically with respect to the number of electrons. This limits DFT's applicability to large-scale problems with complex chemical environments and microstructures. This article presents a quantum algorithm that has a linear scaling with respect to the number of atoms, which is much smaller than the number of electrons. Our algorithm leverages the quantum singular value transformation (QSVT) to generate a quantum circuit to encode the density-matrix, and an estimation method for computing the output electron density. In addition, we present a randomized block coordinate fixed-point method to accelerate the self-consistent field calculations by reducing the number of components of the electron density that needs to be estimated. The proposed framework is accompanied by a rigorous error analysis that quantifies the function approximation error, the statistical fluctuation, and the iteration complexity. In particular, the analysis of our self-consistent iterations takes into account the measurement noise from the quantum circuit. These advancements offer a promising avenue for tackling large-scale DFT problems, enabling simulations of complex systems that were previously computationally infeasible.

DOI
10.48550/arxiv.2307.07067

Related papers

Ground-State Energy and Related Properties Estimation in Quantum Chemistry with Linear Dependence on the Number of Atoms

Taehee Ko, Xiantao Li, Chunhao Wang

At the heart of quantum chemistry and materials science lies the critical task of estimating ground-state properties. We present a quantum algorithm for this task by quantizing the density-functional theory (DFT). A key aspect of imple-menting DFT faithfully is the requirement for self-consistent calculations, which involve repeated di-agonalizations of the Hamiltonian. This procedure, however, creates a significant bottleneck, as a classical algorithm generally demands a computational complexity that grows cubically with the number of electrons, restricting the scalability of DFT for tackling large-scale problems that involve complex chemical environments and microstructures. This article presents the first quantum algorithm that has provided substantial speedup for the ground state computation, by improving the complexity to one with a linear scaling with the number of atoms. The algorithm leverages the exponential speedup by the quantum singular value transformation to generate a quantum circuit to encode the density-matrix, followed by an efficient estimation method for the output electron density, which constitutes a simple hybrid approach for achieving self-consistency. Moreover, the algorithm produces the ground state Hamiltonian, from which the ground state energy and band structures can be efficiently computed. The proposed framework is accompanied by a rigorous error analysis that establishes the convergence and quantifies various sources of error and the overall computational complexity. The combination of effi-ciency and precision opens new avenues for exploring large-scale physical systems.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 15, 2024•1 citation

Quantum algorithms for density functional theory with minimal readout

Yuansheng Zhao, Hirofumi Nishi, Taichi Kosugi +5 more

While quantum computers have shown significant promise for electronic structure calculations, their potential to accelerate density functional theory (DFT) calculations remains unclear. In this work, we present a qubit-efficient encoding scheme for wavefunctions in Kohn--Sham (KS) DFT, together with a quantum algorithm that computes all occupied orbitals simultaneously. We further show that our algorithm is particularly well suited to the Harris functional, enabling the total energy to be evaluated with a potential exponential speedup over classical approaches by entirely avoiding the costly readout of the electronic density. In addition, we propose a second method for achieving self-consistent DFT calculations using multiple copies of the wavefunction, which likewise circumvents density readout. The applicability of our algorithms is demonstrated through several numerical examples, and their efficiency is compared with that of existing approaches.

quant-pharXiv:2605.29774•May 29, 2026•0 citations

Hybrid HPC-Quantum Simulations: DFT-Quantum Embedding for Molecular Systems

Namrata Manglani, Samrit Maity, Shashank Sharma +4 more

Scientific simulations demand methods combining scalability with predictive accuracy. Density Functional Theory (DFT) on High-Performance Computing (HPC) enables large-scale electronic-structure simulations but is limited by approximations affecting strongly correlated systems and band-gap predictions. Quantum computing offers a pathway to address this, though current Noisy Intermediate-Scale Quantum (NISQ) hardware remains constrained by qubit resources, noise, and execution cost. This work presents a hybrid DFT-Quantum Embedding (QDFT) framework integrating classical HPC-based DFT with a quantum electronic-structure solver. Large systems are partitioned to isolate a chemically relevant active space, treated via the Variational Quantum Eigensolver (VQE), while the remaining degrees of freedom are described by DFT. The framework incorporates active-space selection, embedded Hamiltonian construction, symmetry preservation, operator mapping, self-consistent density updating, and modular classical-quantum coupling. We focus on noiseless quantum simulation to systematically evaluate accuracy, convergence, active-space dependence, computational cost, and HPC scalability without hardware noise. Detailed profiling identifies computational bottlenecks and highlights limitations of CPU-based quantum simulation. A QPU runtime-estimation methodology is additionally developed to assess execution requirements on actual quantum hardware. Results demonstrate quantum embedding's potential to improve selected electronic-structure properties while retaining classical HPC's scalability. Noisy quantum simulation and QPU execution remain key future directions, providing a pathway toward practical, scalable HPC-quantum hybrid simulations as hardware matures.

quant-pharXiv:2608.12884•Aug 14, 2026•0 citations

Quantum HF/DFT-embedding algorithms for electronic structure calculations: Scaling up to complex molecular systems

Max Rossmannek, Panagiotis Kl. Barkoutsos, Pauline J. Ollitrault +1 more

In the near future, material and drug design may be aided by quantum computer assisted simulations. These have the potential to target chemical systems intractable by the most powerful classical computers. However, the resources offered by contemporary quantum computers are still limited, restricting the simulations to very simple molecules. In order to rapidly scale up to more interesting molecular systems, we propose the embedding of the quantum electronic structure calculation into a classically computed environment obtained at the Hartree-Fock (HF) or density functional theory (DFT) level of theory. This result is achieved by constructing an effective Hamiltonian that incorporates a mean field potential describing the action of the inactive electrons on a selected Active Space (AS). The ground state of the AS Hamiltonian is then determined by means of the variational quantum eigensolver algorithm. We show that with the proposed HF and DFT embedding schemes, we can obtain significant energy corrections to the reference HF and DFT calculations for a number of simple molecules in their strongly correlated limit (the dissociation regime) as well as for systems of the size of the oxirane molecule.

arXiv:2009.01872•The Journal of Chemical Physics•Mar 15, 2021•62 citations

Quantum algorithms for electronic structure beyond ground state energies

Emiel Koridon

Quantum chemistry models atoms and molecules using quantum mechanics, with the electronic structure problem at its core. This problem, which determines the energy and properties of electrons in a molecule, is exponentially hard to solve exactly on classical computers. To approximate solutions, effective models introduce layers of simplifications. However, these approximations can fail for strongly correlated systems, necessitating alternative approaches. Quantum computers, capable of processing quantum information natively, offer a promising path to simulate molecular systems beyond classical reach, with potential applications in catalysis, materials science, and photochemistry. Despite rapid advancements in quantum hardware, practical quantum computations remain challenging due to limited resources. This thesis optimizes quantum resource usage in computational chemistry, introducing novel embedding techniques and exploring applications beyond ground-state energies. Chapter 1 establishes the foundation by reviewing quantum chemistry methods, from Hartree-Fock and Density Functional Theory (DFT) to active space approaches. It also provides an introduction to quantum computing for chemistry, focusing on near-term algorithms. The following chapters present novel methods aimed at reducing quantum resource requirements and tackling problems classical methods struggle with. Chapter 2 introduces a technique to reduce the $\lambda$-norm of the electronic structure Hamiltonian, a key measure of quantum resource demand. By transforming molecular orbitals, this method enhances sampling efficiency in Noisy Intermediate-Scale Quantum (NISQ) algorithms and reduces runtime in Fault-Tolerant Quantum Computing (FTQC). Localized orbitals outperform canonical ones, and an orbital-optimization scheme is proposed to minimize the $\lambda$-norm. Benchmarks on hydrogen chains, FeMoco, and Ruthenium complexes demonstrate its effectiveness. Chapter 3 presents the FragPT2 framework for simulating large systems with multiple interacting fragments. This method embeds each fragment in the mean field of others and applies multi-reference perturbation theory to capture inter-fragment correlations such as dispersion and charge transfer efficiently. The approach reduces computational overhead and enables scalable simulations, as shown in applications to \ce{N2} dimers, aromatic dimers, and butadiene. Chapter 4 focuses on photochemical systems, where multiple electronic states must be treated equally. The state-averaged orbital-optimized variational quantum eigensolver (SAOOVQE) is extended with analytical energy gradients and non-adiabatic couplings, enabling geometry optimizations and simulations of non-adiabatic dynamics on quantum hardware. This is demonstrated by locating the conical intersection in formaldimine, highlighting SAOOVQE’s potential for studying photoisomerization in biomolecules. Building on this, Chapter 5 develops a quantum algorithm to detect conical intersections, where the Born-Oppenheimer approximation breaks down. These intersections are characterized by a discrete Berry phase (0 or $\pi$), representing their topological nature. The algorithm extracts this phase as a single bit of information, ensuring resilience to noise. Analytical proof and numerical validation using a toy molecular model illustrate its effectiveness for studying light-perception biochemistry and related photochemical processes. Finally, Chapter 6 explores machine learning density functionals trained on noisy quantum data. While DFT is computationally efficient, its accuracy depends on approximated exchange-correlation functionals. This work proposes a neural network-based approach to learn the exact functional from quantum data, showing that training on noisy outputs from NISQ devices can mitigate sampling errors. Applications to the Fermi-Hubbard model and other systems demonstrate its potential to generalize and provide accurate results under noise. This thesis advances quantum computational chemistry by optimizing quantum resource usage, developing new embedding strategies, and expanding the scope of quantum simulations beyond ground-state properties. These contributions pave the way for practical quantum algorithms that could revolutionize molecular simulations in the near future.

•Apr 4, 2025•0 citations

Dynamical mean field theory for real materials on a quantum computer

Johannes Selisko, Maximilian Amsler, Christopher Wever +6 more

Quantum computers (QC) could harbor the potential to significantly advance materials simulations, particularly at the atomistic scale involving strongly correlated fermionic systems, where an accurate description of quantum many-body effects scales unfavorably with size. While a full-scale treatment of condensed matter systems with currently available noisy quantum computers remains elusive, quantum embedding schemes like dynamical mean-field theory (DMFT) allow the mapping of an effective, reduced subspace Hamiltonian to available devices to improve the accuracy of ab initio calculations such as density functional theory (DFT). Here, we report on the development of a hybrid quantum-classical DFT + DMFT simulation framework which relies on a quantum impurity solver based on the Lehmann representation of the impurity Green’s function. Hardware experiments with up to 14 qubits on the IBM Quantum system are conducted, using advanced error mitigation methods and a novel calibration scheme for an improved zero-noise extrapolation to effectively reduce adverse effects from inherent noise on current quantum devices. We showcase the utility of our quantum DFT + DMFT workflow by assessing the correlation effects on the electronic structure of a real material, Ca 2 CuO 2 Cl 2 , which is mapped to an effective single-band Hubbard Hamiltonian and the subsequently derived Anderson impurity model solved with up to 6 bath sites on available quantum hardware. Further, we carefully benchmark our quantum results with respect to exact reference solutions and experimental spectroscopy measurements. While challenges remain to scale our approach to larger, multi-orbital and multi-site systems with more bath sites, the present work marks an important milestone towards achieving utility-scale quantum computation in materials simulation.

arXiv:2404.09527•npj Computational Materials•Oct 31, 2025•5 citations
Density-functional theory (DFT) has revolutionized computer simulations in chemistry and material science. A faithful implementation of the theory requires self-consistent calculations. However, this effort involves repeatedly diagonalizing the Hamiltonian, for which a classical algorithm typically requires a computational complexity that scales cubically with respect to the number of electrons. This limits DFT's applicability to large-scale problems with complex chemical environments and microstructures. This article presents a quantum algorithm that has a linear scaling with respect to the number of atoms, which is much smaller than the number of electrons. Our algorithm leverages the quantum singular value transformation (QSVT) to generate a quantum circuit to encode the density-matrix, and an estimation method for computing the output electron density. In addition, we present a randomized block coordinate fixed-point method to accelerate the self-consistent field calculations by reducing the number of components of the electron density that needs to be estimated. The proposed framework is accompanied by a rigorous error analysis that quantifies the function approximation error, the statistical fluctuation, and the iteration complexity. In particular, the analysis of our self-consistent iterations takes into account the measurement noise from the quantum circuit. These advancements offer a promising avenue for tackling large-scale DFT problems, enabling simulations of complex systems that were previously computationally infeasible.
At the heart of quantum chemistry and materials science lies the critical task of estimating ground-state properties. We present a quantum algorithm for this task by quantizing the density-functional theory (DFT). A key aspect of imple-menting DFT faithfully is the requirement for self-consistent calculations, which involve repeated di-agonalizations of the Hamiltonian. This procedure, however, creates a significant bottleneck, as a classical algorithm generally demands a computational complexity that grows cubically with the number of electrons, restricting the scalability of DFT for tackling large-scale problems that involve complex chemical environments and microstructures. This article presents the first quantum algorithm that has provided substantial speedup for the ground state computation, by improving the complexity to one with a linear scaling with the number of atoms. The algorithm leverages the exponential speedup by the quantum singular value transformation to generate a quantum circuit to encode the density-matrix, followed by an efficient estimation method for the output electron density, which constitutes a simple hybrid approach for achieving self-consistency. Moreover, the algorithm produces the ground state Hamiltonian, from which the ground state energy and band structures can be efficiently computed. The proposed framework is accompanied by a rigorous error analysis that establishes the convergence and quantifies various sources of error and the overall computational complexity. The combination of effi-ciency and precision opens new avenues for exploring large-scale physical systems.
While quantum computers have shown significant promise for electronic structure calculations, their potential to accelerate density functional theory (DFT) calculations remains unclear. In this work, we present a qubit-efficient encoding scheme for wavefunctions in Kohn--Sham (KS) DFT, together with a quantum algorithm that computes all occupied orbitals simultaneously. We further show that our algorithm is particularly well suited to the Harris functional, enabling the total energy to be evaluated with a potential exponential speedup over classical approaches by entirely avoiding the costly readout of the electronic density. In addition, we propose a second method for achieving self-consistent DFT calculations using multiple copies of the wavefunction, which likewise circumvents density readout. The applicability of our algorithms is demonstrated through several numerical examples, and their efficiency is compared with that of existing approaches.
Scientific simulations demand methods combining scalability with predictive accuracy. Density Functional Theory (DFT) on High-Performance Computing (HPC) enables large-scale electronic-structure simulations but is limited by approximations affecting strongly correlated systems and band-gap predictions. Quantum computing offers a pathway to address this, though current Noisy Intermediate-Scale Quantum (NISQ) hardware remains constrained by qubit resources, noise, and execution cost. This work presents a hybrid DFT-Quantum Embedding (QDFT) framework integrating classical HPC-based DFT with a quantum electronic-structure solver. Large systems are partitioned to isolate a chemically relevant active space, treated via the Variational Quantum Eigensolver (VQE), while the remaining degrees of freedom are described by DFT. The framework incorporates active-space selection, embedded Hamiltonian construction, symmetry preservation, operator mapping, self-consistent density updating, and modular classical-quantum coupling. We focus on noiseless quantum simulation to systematically evaluate accuracy, convergence, active-space dependence, computational cost, and HPC scalability without hardware noise. Detailed profiling identifies computational bottlenecks and highlights limitations of CPU-based quantum simulation. A QPU runtime-estimation methodology is additionally developed to assess execution requirements on actual quantum hardware. Results demonstrate quantum embedding's potential to improve selected electronic-structure properties while retaining classical HPC's scalability. Noisy quantum simulation and QPU execution remain key future directions, providing a pathway toward practical, scalable HPC-quantum hybrid simulations as hardware matures.
In the near future, material and drug design may be aided by quantum computer assisted simulations. These have the potential to target chemical systems intractable by the most powerful classical computers. However, the resources offered by contemporary quantum computers are still limited, restricting the simulations to very simple molecules. In order to rapidly scale up to more interesting molecular systems, we propose the embedding of the quantum electronic structure calculation into a classically computed environment obtained at the Hartree-Fock (HF) or density functional theory (DFT) level of theory. This result is achieved by constructing an effective Hamiltonian that incorporates a mean field potential describing the action of the inactive electrons on a selected Active Space (AS). The ground state of the AS Hamiltonian is then determined by means of the variational quantum eigensolver algorithm. We show that with the proposed HF and DFT embedding schemes, we can obtain significant energy corrections to the reference HF and DFT calculations for a number of simple molecules in their strongly correlated limit (the dissociation regime) as well as for systems of the size of the oxirane molecule.
Quantum chemistry models atoms and molecules using quantum mechanics, with the electronic structure problem at its core. This problem, which determines the energy and properties of electrons in a molecule, is exponentially hard to solve exactly on classical computers. To approximate solutions, effective models introduce layers of simplifications. However, these approximations can fail for strongly correlated systems, necessitating alternative approaches. Quantum computers, capable of processing quantum information natively, offer a promising path to simulate molecular systems beyond classical reach, with potential applications in catalysis, materials science, and photochemistry. Despite rapid advancements in quantum hardware, practical quantum computations remain challenging due to limited resources. This thesis optimizes quantum resource usage in computational chemistry, introducing novel embedding techniques and exploring applications beyond ground-state energies. Chapter 1 establishes the foundation by reviewing quantum chemistry methods, from Hartree-Fock and Density Functional Theory (DFT) to active space approaches. It also provides an introduction to quantum computing for chemistry, focusing on near-term algorithms. The following chapters present novel methods aimed at reducing quantum resource requirements and tackling problems classical methods struggle with. Chapter 2 introduces a technique to reduce the λ\lambdaλ-norm of the electronic structure Hamiltonian, a key measure of quantum resource demand. By transforming molecular orbitals, this method enhances sampling efficiency in Noisy Intermediate-Scale Quantum (NISQ) algorithms and reduces runtime in Fault-Tolerant Quantum Computing (FTQC). Localized orbitals outperform canonical ones, and an orbital-optimization scheme is proposed to minimize the λ\lambdaλ-norm. Benchmarks on hydrogen chains, FeMoco, and Ruthenium complexes demonstrate its effectiveness. Chapter 3 presents the FragPT2 framework for simulating large systems with multiple interacting fragments. This method embeds each fragment in the mean field of others and applies multi-reference perturbation theory to capture inter-fragment correlations such as dispersion and charge transfer efficiently. The approach reduces computational overhead and enables scalable simulations, as shown in applications to \ce{N2} dimers, aromatic dimers, and butadiene. Chapter 4 focuses on photochemical systems, where multiple electronic states must be treated equally. The state-averaged orbital-optimized variational quantum eigensolver (SAOOVQE) is extended with analytical energy gradients and non-adiabatic couplings, enabling geometry optimizations and simulations of non-adiabatic dynamics on quantum hardware. This is demonstrated by locating the conical intersection in formaldimine, highlighting SAOOVQE’s potential for studying photoisomerization in biomolecules. Building on this, Chapter 5 develops a quantum algorithm to detect conical intersections, where the Born-Oppenheimer approximation breaks down. These intersections are characterized by a discrete Berry phase (0 or π\piπ), representing their topological nature. The algorithm extracts this phase as a single bit of information, ensuring resilience to noise. Analytical proof and numerical validation using a toy molecular model illustrate its effectiveness for studying light-perception biochemistry and related photochemical processes. Finally, Chapter 6 explores machine learning density functionals trained on noisy quantum data. While DFT is computationally efficient, its accuracy depends on approximated exchange-correlation functionals. This work proposes a neural network-based approach to learn the exact functional from quantum data, showing that training on noisy outputs from NISQ devices can mitigate sampling errors. Applications to the Fermi-Hubbard model and other systems demonstrate its potential to generalize and provide accurate results under noise. This thesis advances quantum computational chemistry by optimizing quantum resource usage, developing new embedding strategies, and expanding the scope of quantum simulations beyond ground-state properties. These contributions pave the way for practical quantum algorithms that could revolutionize molecular simulations in the near future.
Quantum computers (QC) could harbor the potential to significantly advance materials simulations, particularly at the atomistic scale involving strongly correlated fermionic systems, where an accurate description of quantum many-body effects scales unfavorably with size. While a full-scale treatment of condensed matter systems with currently available noisy quantum computers remains elusive, quantum embedding schemes like dynamical mean-field theory (DMFT) allow the mapping of an effective, reduced subspace Hamiltonian to available devices to improve the accuracy of ab initio calculations such as density functional theory (DFT). Here, we report on the development of a hybrid quantum-classical DFT + DMFT simulation framework which relies on a quantum impurity solver based on the Lehmann representation of the impurity Green’s function. Hardware experiments with up to 14 qubits on the IBM Quantum system are conducted, using advanced error mitigation methods and a novel calibration scheme for an improved zero-noise extrapolation to effectively reduce adverse effects from inherent noise on current quantum devices. We showcase the utility of our quantum DFT + DMFT workflow by assessing the correlation effects on the electronic structure of a real material, Ca 2 CuO 2 Cl 2 , which is mapped to an effective single-band Hubbard Hamiltonian and the subsequently derived Anderson impurity model solved with up to 6 bath sites on available quantum hardware. Further, we carefully benchmark our quantum results with respect to exact reference solutions and experimental spectroscopy measurements. While challenges remain to scale our approach to larger, multi-orbital and multi-site systems with more bath sites, the present work marks an important milestone towards achieving utility-scale quantum computation in materials simulation.