Computational complexity of time-dependent density functional theory

14Citations
Citations of this article
59Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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. © 2014 IOP Publishing Ltd and Deutsche Physikalische Gesellschaft.

Cite

CITATION STYLE

APA

Whitfield, J. D., Yung, M. H., Tempel, D. G., Boixo, S., & Aspuru-Guzik, A. (2014). Computational complexity of time-dependent density functional theory. New Journal of Physics, 16. https://doi.org/10.1088/1367-2630/16/8/083035

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free