CoChat

Computational complexity of time-dependent density functional theory

Open access
Whitfield, J D, Yung, M-H, Tempel, D G, Boixo, S, Aspuru-Guzik, A · 2014 · New Journal of Physics

The 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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1088/1367-2630/16/8/083035

Cites

35 of 35 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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?

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

Show all 35 references

Research works printed but not linked: 4

  1. Petersilka M, 1999, Laser Phys., 9, 1
  2. 10.1002/9781118742631.ch03/summary · doi:10.1002/9781118742631.ch03/summary
  3. Horn R A, 2005, Matrix Analysis
  4. Lindelöf M E, 1894, Sances Acad. Sci., 116, 454

Cited by

See all 15

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
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
Licence
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.