Computational Complexity in Quantum Chemistry
Document Type
Article
Abstract
Different areas of quantum chemistry encounter exponential complexity of the underlying exact wavefunctions. The suggested solutions are specific to each subdivision. On the other hand, recent developments in quantum computing theory prove that a general ground state search problem with two-body Hamiltonians cannot be solved in polynomial time. We suggest that a quantum chemical problem of the ground state energy search, with particles coupled via non-relativistic Coulomb operator, is also non-polynomial in time with respect to the system size. The consequences of this are explored, with an emphasis on the complexity of the quantum potential in quantum trajectory approach.
Digital Object Identifier (DOI)
https://doi.org/10.1016/j.cplett.2008.09.026
Publication Info
Published in Chemical Physics Letters, Volume 464, Issue 4-6, 2008, pages 262-264.
© Chemical Physics Letters 2008, Elsevier B.V.
APA Citation
Rassolov, V., & Garashchuk, S. (2008). Computational Complexity in Quantum Chemistry. Chemical Physics Letters, 464(4–6), 262–264. https://doi.org/10.1016/j.cplett.2008.09.026
Rights
© Chemical Physics Letters 2008, Elsevier B.V.