Computational Complexity in Quantum Chemistry
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.
Chemical Physics Letters, Volume 464, Issue 4-6, 2008, pages 262-264.
NOTICE: this is the author’s version of a work that was accepted for publication in . Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in PUBLICATION, [VOL464, ISSUE4-6, (2008)] DOI#10.1016/j.cplett.2008.09.026
Rassolov,A.V.& Garashchuk,S. (2008). Computational complexity in quantum chemistry. Chemical Physics Letters, 464(4-6), 262-264.