Quantum chemistry algorithms for efficient quantum computing

Quantum chemistry is definitely one of the most promising application areas of near term quantum computers. The exponentially large Hilbert space of molecular systems can be efficiently mapped into the spin configuration space of available quantum computers offering a unique opportunity for the solution of interesting electronic structure problems with unprecedented accuracy. To achieve this goal, new quantum algorithms need to be develop that are able to best exploit the potential of quantum speed-up. While this effort should target the design of quantum algorithms for the future fault-tolerant quantum hardware, there is pressing need to develop algorithms, which can be implemented in present-day non-fault tolerant quantum hardware with limited coherence time. In this talk, we will discuss (i) ways to derive efficient trial wavefunctions based on known quantum chemistry solutions (like e.g., Moller-Plesset perturbation theory and Unitary Coupled Cluster), (ii) schemes to map states to available quantum computer architectures, and (iii) procedures to reduce the overall circuit depths in quantum chemistry calculations and experiments. These methods will be applied to a set of model systems (e.g., the Hubbard model) and molecules.