Computational complexity of time-dependent density functional theory
Open accessThe DOI matches its Crossref record; 35 of the 35 references it cites were found in a registry or an index.
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“while the scaling of the number of classical bits needed to store a wave function of N quantum systems grows as O (exp( N )), the scaling of quantum bits needed to store this wave function is 1 O ( N ).”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [230]
Experimental — accuracy not yet measured
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
Density-Functional Theory for Time-Dependent Systems
Runge, E., & Gross, E. K. U. (1984) · Physical Review Letters · doi:10.1103/physrevlett.52.997 · Cited by 8,914 · cited 1×
“This mapping exists via the Runge–Gross theorem [11] which shows that, apart from a gauge degree of freedom represented by spatially homogeneous variations, the potential is bijectively related to the density.”
MethodLloyd, S. (1996) · Science · doi:10.1126/science.273.5278.1073 · Cited by 3,088 · cited 1×
“Quantum computers have long been considered as a tool for simulating quantum physics [5–7, 26, 27].”
MethodLevy, M. (1979) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.76.12.6062 · Cited by 1,969
Dreuw, A., Weisman, J. L., & Head-Gordon, M. (2003) · The Journal of Chemical Physics · doi:10.1063/1.1590951 · Cited by 1,569
Strengths and Weaknesses of Quantum Computing
Bennett, C. H., Bernstein, E., Brassard, G., & Vazirani, U. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539796300933 · Cited by 1,470 · cited 1×
“On the other hand, in the worst case, quantum computers are not expected to solve all NP (nondeterministic polynomial time) problems efficiently [8].”
BackgroundSimulated Quantum Computation of Molecular Energies
Aspuru-Guzik, A., Dutoi, A. D., Love, P. J., & Head-Gordon, M. (2005) · Science · doi:10.1126/science.1113479 · Cited by 1,418
Self-citationClassical and Quantum Computation
Kitaev, A., Shen, A., & Vyalyi, M. (2002) · Graduate Studies in Mathematics · doi:10.1090/gsm/047 · Cited by 1,387
Feynman, R. P. (1985) · Optics News · doi:10.1364/on.11.2.000011 · Cited by 1,023
Propagators for the time-dependent Kohn–Sham equations
Castro, A., Marques, M. A. L., & Rubio, A. (2004) · The Journal of Chemical Physics · doi:10.1063/1.1774980 · Cited by 599
Research works printed but not linked: 4
- Petersilka M, 1999, Laser Phys., 9, 1
- 10.1002/9781118742631.ch03/summary · doi:10.1002/9781118742631.ch03/summary
- Horn R A, 2005, Matrix Analysis
- Lindelöf M E, 1894, Sances Acad. Sci., 116, 454
Cited by
Quantum computational chemistry
McArdle, S., Endo, S., Aspuru-Guzik, A., Benjamin, S. C., & Yuan, X. (2020) · Reviews of Modern Physics · doi:10.1103/revmodphys.92.015003 · Cited by 1,621
Self-citationQuantum Chemistry in the Age of Quantum Computing
Cao, Y., Romero, J., Olson, J. P., Degroote, M., Johnson, P. D., Kieferová, M., Kivlichan, I. D., Menke, T., Peropadre, B., Sawaya, N. P. D., et al. (2019) · Chemical Reviews · doi:10.1021/acs.chemrev.8b00803 · Cited by 1,560
Self-citationQuantum information processing with superconducting circuits: a review
Wendin, G. (2017) · Reports on Progress in Physics · doi:10.1088/1361-6633/aa7e1a · Cited by 890
Plasmonic hot carrier dynamics in solid-state and chemical systems for energy conversion
Narang, P., Sundararaman, R., & Atwater, H. A. (2016) · Nanophotonics · doi:10.1515/nanoph-2016-0007 · Cited by 297
Metadata
- Authors
- Whitfield, J. D., Yung, M.-H., Tempel, D. G., Boixo, S., & Aspuru-Guzik, A.
- Affiliations
- University of Vienna (AT)
- Harvard University (US)
- Google (United States) (US)
- Corresponding author
- Whitfield, J D
- Venue
- New Journal of Physics
- Publisher
- IOP Publishing
- Published
- 2014-08-15
- Volume
- 16
- Issue
- 8
- Pages
- 083035
- ISSN
- 1367-2630 (ISSN-L)
- OpenAlex
- W2128064831
- Cited by
- 15
- References
- 35
- Citations by year
- 2026: 1 · 2025: 1 · 2024: 3 · 2023: 2 · 2021: 2 · 2020: 3 · 2019: 1 · 2017: 1 · 2016: 1
- FWCI
- 0.33
- Type
- journal article
- Language
- en
- Open access
- gold
- doi.org
- Licence
- cc-by
- iopscience.iop.org/info/page/text-and-data-mining (tdm)
- creativecommons.org/licenses/by/3.0/ (vor)
- Locations
- New Journal of Physics (publishedVersion, cc-by)
- arXiv (Cornell University) (submittedVersion)
- Phaidra (Universität Wien) (submittedVersion, cc-by-nc-nd)
- DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion)
- arXiv (Cornell University)
- Funders
- National Science Foundation (1152291)
- European Commission (239937)
- National Natural Science Foundation of China (61061130540, 61033001)
- National Key Research and Development Program of China (61033001, 2011CBA00301, 2011CBA00300)
- Division of Chemistry (CHE-1152291)
- Topics
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Advanced Chemical Physics Studies
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
- Keywords
- time-dependent density functional theory, computational complexity, v-representability, quantum algorithms, polynomial-time algorithms, many-body dynamics, time-dependent density
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Computational complexity of time-dependent density functional theory. https://app.cochat.ai/papers/10.1088/1367-2630/16/8/083035
- The paper
- 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. https://doi.org/10.1088/1367-2630/16/8/083035
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.