Abstract: ABSTRACT: Quantum computers can in principle simulate quantum physics
exponentially faster than their classical counterparts, however subtle
caveats and technical hurdles remain.  In modern simulations, density
functional theory (DFT) is the most widely used computational algorithm;
thus, it is natural to compare quantum computation against DFT.  In this
talk, I will offer this contrast by presenting my work on the quantum
computational complexity of ground state and time-dependent density
functional theory.  I will also discuss pragmatic steps toward making
quantum simulation useful and competitive amongst today’s technologies.