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:0809.1170 · Physical Review B

Density functional theory and quantum computation

Frank Gaitan, Franco Nori

Published May 26, 2009• 17 citations
arXivHTMLPDF

Abstract

This paper establishes the applicability of density functional theory methods to quantum computing systems. We show that ground state and time-dependent density functional theory can be applied to quantum computing systems by proving the Hohenberg-Kohn and Runge-Gross theorems for a fermionic representation of an $N$ qubit system. As a first demonstration of this approach, time-dependent density functional theory is used to determine the minimum energy gap $\ensuremath{\Delta}(N)$ arising when the quantum adiabatic evolution algorithm is used to solve instances of the nondeterministic-polynomial-complete problem MAXCUT. It is known that the computational efficiency of this algorithm is largely determined by the large-$N$ scaling behavior of $\ensuremath{\Delta}(N)$, and so determining this behavior is of fundamental significance. As density functional theory has been used to study quantum systems with $N\ensuremath{\sim}{10}^{3}$ interacting degrees of freedom, the approach introduced in this paper raises the realistic prospect of evaluating the gap $\ensuremath{\Delta}(N)$ for systems with $N\ensuremath{\sim}{10}^{3}$ qubits. Although the calculation of $\ensuremath{\Delta}(N)$ serves to illustrate how density functional theory methods can be applied to problems in quantum computing, the approach has a much broader range and shows promise as a means for determining the properties of very large quantum computing systems.

DOI
10.1103/physrevb.79.205117

Related papers

Density Functional Theory and Quantum Computation

Frank Gaitan, Franco Nori

This chapter shows how density functional theory (DFT) can be applied to quantum computing systems. It begins by showing how the N-qubit system can be transformed into a system of N lattice fermions. This transformation is illustrated by using it to rewrite the dynamics of the quantum adiabatic evolution (QAE) algorithm applied to the NP-Complete Problem MAXCUT, which results in an interacting fermion system. This justifies the application of ground state DFT (GS-DFT) and time-dependent DFT (TD-DFT) to the dynamics of the interacting fermion system. The linear response of the interacting fermions is determined using TD-DFT, which is then used to obtain the energy gap for the MAXCUT dynamics. This approach would allow evaluation of the minimum gap for N ∼ 103 qubits.

Advances in chemical physics•Feb 14, 2014•1 citation

Computational complexity of time-dependent density functional theory

J D Whitfield, M-H Yung, D G Tempel +2 more

Time-dependent density functional theory (TDDFT) is rapidly emerging as a premier method for solving dynamical many-body problems in physics and chemistry. The mathematical foundations of TDDFT are established through the formal existence of a fictitious non-interacting system (known as the Kohn–Sham system), which can reproduce the one-electron reduced probability density of the actual system. We build upon these works and show that on the interior of the domain of existence, the Kohn–Sham system can be efficiently obtained given the time-dependent density. We introduce a V -representability parameter which diverges at the boundary of the existence domain and serves to quantify the numerical difficulty of constructing the Kohn–Sham potential. For bounded values of V -representability, we present a polynomial time quantum algorithm to generate the time-dependent Kohn–Sham potential with controllable error bounds.

arXiv:1310.1428•New Journal of Physics•Aug 15, 2014•18 citations

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

Time-Dependent Density Functional Theory for Open Quantum Systems and Quantum Computation

David G. Tempel

First-principles electronic structure theory explains properties of atoms, molecules and solids from underlying physical principles without input from empirical parameters. Time-dependent density functional theory (TDDFT) has emerged as arguably the most widely used first-principles method for describing the time-dependent quantum mechanics of many-electron systems. In this thesis, we will show how the fundamental principles of TDDFT can be extended and applied in two novel directions: The theory of open quantum systems (OQS) and quantum computation (QC). In the first part of this thesis, we prove theorems that establish the foundations of TDDFT for open quantum systems (OQS-TDDFT). OQS-TDDFT allows for a first principles description of non-equilibrium systems, in which the electronic degrees of freedom undergo relaxation and decoherence due to coupling with a thermal environment, such as a vibrational or photon bath. We then discuss properties of functionals in OQS-TDDFT and investigate how these differ from functionals in conventional TDDFT using an exactly solvable model system. Next, we formulate OQS-TDDFT in the linear-response regime, which gives access to environmentally broadened excitation spectra. Lastly, we present a hybrid approach in which TDDFT can be used to construct master equations from first-principles for describing energy transfer in condensed phase systems. In the second part of this thesis, we prove that the theorems of TDDFT can be extended to a class of qubit Hamiltonians that are universal for quantum computation. TDDFT applied to universal Hamiltonians implies that single-qubit expectation values can be used as the basic variables in quantum computation and information theory, rather than wavefunctions. This offers the possibility of simplifying computations by using the principles of TDDFT similar to how it is applied in electronic structure theory. Lastly, we discuss a related result; the computational complexity of TDDFT.

•Aug 10, 2012•2 citations

Density-Functional Theory for Time-Dependent Systems

Erich Runge, Eberhard K. U. Gross

A density-functional formalism comparable to the Hohenberg-Kohn-Sham theory of the ground state is developed for arbitrary time-dependent systems. It is proven that the single-particle potential $v(\stackrel{\ensuremath{\rightarrow}}{\mathrm{r}}t)$ leading to a given $v$-representable density $n(\stackrel{\ensuremath{\rightarrow}}{\mathrm{r}}t)$ is uniquely determined so that the corresponding map $v\ensuremath{\rightarrow}n$ is invertible. On the basis of this theorem, three schemes are derived to calculate the density: a set of hydrodynamical equations, a stationary action principle, and an effective single-particle Schr\"odinger equation.

Physical Review Letters•Mar 19, 1984•9,078 citations

Quantum Computation by Adiabatic Evolution

Edward Farhi, Jeffrey Goldstone, Sam Gutmann +1 more

We give a quantum algorithm for solving instances of the satisfiability problem, based on adiabatic evolution. The evolution of the quantum state is governed by a time-dependent Hamiltonian that interpolates between an initial Hamiltonian, whose ground state is easy to construct, and a final Hamiltonian, whose ground state encodes the satisfying assignment. To ensure that the system evolves to the desired final ground state, the evolution time must be big enough. The time required depends on the minimum energy difference between the two lowest states of the interpolating Hamiltonian. We are unable to estimate this gap in general. We give some special symmetric cases of the satisfiability problem where the symmetry allows us to estimate the gap and we show that, in these cases, our algorithm runs in polynomial time.

arXiv:quant-ph/0001106•Jan 28, 2000•2,419 citations
This paper establishes the applicability of density functional theory methods to quantum computing systems. We show that ground state and time-dependent density functional theory can be applied to quantum computing systems by proving the Hohenberg-Kohn and Runge-Gross theorems for a fermionic representation of an NNN qubit system. As a first demonstration of this approach, time-dependent density functional theory is used to determine the minimum energy gap \ensuremathΔ(N)\ensuremath{\Delta}(N)\ensuremathΔ(N) arising when the quantum adiabatic evolution algorithm is used to solve instances of the nondeterministic-polynomial-complete problem MAXCUT. It is known that the computational efficiency of this algorithm is largely determined by the large-NNN scaling behavior of \ensuremathΔ(N)\ensuremath{\Delta}(N)\ensuremathΔ(N), and so determining this behavior is of fundamental significance. As density functional theory has been used to study quantum systems with N\ensuremath∼103N\ensuremath{\sim}{10}^{3}N\ensuremath∼103 interacting degrees of freedom, the approach introduced in this paper raises the realistic prospect of evaluating the gap \ensuremathΔ(N)\ensuremath{\Delta}(N)\ensuremathΔ(N) for systems with N\ensuremath∼103N\ensuremath{\sim}{10}^{3}N\ensuremath∼103 qubits. Although the calculation of \ensuremathΔ(N)\ensuremath{\Delta}(N)\ensuremathΔ(N) serves to illustrate how density functional theory methods can be applied to problems in quantum computing, the approach has a much broader range and shows promise as a means for determining the properties of very large quantum computing systems.
This chapter shows how density functional theory (DFT) can be applied to quantum computing systems. It begins by showing how the N-qubit system can be transformed into a system of N lattice fermions. This transformation is illustrated by using it to rewrite the dynamics of the quantum adiabatic evolution (QAE) algorithm applied to the NP-Complete Problem MAXCUT, which results in an interacting fermion system. This justifies the application of ground state DFT (GS-DFT) and time-dependent DFT (TD-DFT) to the dynamics of the interacting fermion system. The linear response of the interacting fermions is determined using TD-DFT, which is then used to obtain the energy gap for the MAXCUT dynamics. This approach would allow evaluation of the minimum gap for N ∼ 103 qubits.
Time-dependent density functional theory (TDDFT) is rapidly emerging as a premier method for solving dynamical many-body problems in physics and chemistry. The mathematical foundations of TDDFT are established through the formal existence of a fictitious non-interacting system (known as the Kohn–Sham system), which can reproduce the one-electron reduced probability density of the actual system. We build upon these works and show that on the interior of the domain of existence, the Kohn–Sham system can be efficiently obtained given the time-dependent density. We introduce a V -representability parameter which diverges at the boundary of the existence domain and serves to quantify the numerical difficulty of constructing the Kohn–Sham potential. For bounded values of V -representability, we present a polynomial time quantum algorithm to generate the time-dependent Kohn–Sham potential with controllable error bounds.
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.
First-principles electronic structure theory explains properties of atoms, molecules and solids from underlying physical principles without input from empirical parameters. Time-dependent density functional theory (TDDFT) has emerged as arguably the most widely used first-principles method for describing the time-dependent quantum mechanics of many-electron systems. In this thesis, we will show how the fundamental principles of TDDFT can be extended and applied in two novel directions: The theory of open quantum systems (OQS) and quantum computation (QC). In the first part of this thesis, we prove theorems that establish the foundations of TDDFT for open quantum systems (OQS-TDDFT). OQS-TDDFT allows for a first principles description of non-equilibrium systems, in which the electronic degrees of freedom undergo relaxation and decoherence due to coupling with a thermal environment, such as a vibrational or photon bath. We then discuss properties of functionals in OQS-TDDFT and investigate how these differ from functionals in conventional TDDFT using an exactly solvable model system. Next, we formulate OQS-TDDFT in the linear-response regime, which gives access to environmentally broadened excitation spectra. Lastly, we present a hybrid approach in which TDDFT can be used to construct master equations from first-principles for describing energy transfer in condensed phase systems. In the second part of this thesis, we prove that the theorems of TDDFT can be extended to a class of qubit Hamiltonians that are universal for quantum computation. TDDFT applied to universal Hamiltonians implies that single-qubit expectation values can be used as the basic variables in quantum computation and information theory, rather than wavefunctions. This offers the possibility of simplifying computations by using the principles of TDDFT similar to how it is applied in electronic structure theory. Lastly, we discuss a related result; the computational complexity of TDDFT.
A density-functional formalism comparable to the Hohenberg-Kohn-Sham theory of the ground state is developed for arbitrary time-dependent systems. It is proven that the single-particle potential $v(\stackrel{\ensuremath{\rightarrow}}{\mathrm{r}}t)$ leading to a given vvv-representable density $n(\stackrel{\ensuremath{\rightarrow}}{\mathrm{r}}t)$ is uniquely determined so that the corresponding map $v\ensuremath{\rightarrow}n$ is invertible. On the basis of this theorem, three schemes are derived to calculate the density: a set of hydrodynamical equations, a stationary action principle, and an effective single-particle Schr\"odinger equation.
We give a quantum algorithm for solving instances of the satisfiability problem, based on adiabatic evolution. The evolution of the quantum state is governed by a time-dependent Hamiltonian that interpolates between an initial Hamiltonian, whose ground state is easy to construct, and a final Hamiltonian, whose ground state encodes the satisfying assignment. To ensure that the system evolves to the desired final ground state, the evolution time must be big enough. The time required depends on the minimum energy difference between the two lowest states of the interpolating Hamiltonian. We are unable to estimate this gap in general. We give some special symmetric cases of the satisfiability problem where the symmetry allows us to estimate the gap and we show that, in these cases, our algorithm runs in polynomial time.