2:30 PM–5:30 PM, Monday, March 13, 2006
Baltimore Convention Center - 324
Sponsoring Unit:
DCOMP
Chair: Francois Gygi, University of California, Davis
Abstract ID: BAPS.2006.MAR.D27.5
3:42 PM–4:18 PM
Alan Aspuru-Guzik
(UC Berkeley)
The calculation time for the energy of atoms and molecules scales exponentially with system size on a classical computer, but polynomially using quantum algorithms. We demonstrate that such algorithms can be applied to problems of chemical interest using modest numbers of quantum bits. Calculations of the H$_{2}$O and LiH molecular ground-state energies have been carried out on a quantum computer simulator using a recursive phase estimation algorithm. The recursive algorithm reduces the number of quantum bits required for the read-out register from approximately twenty to four. Mappings of the molecular wave function to the quantum bits are described. An adiabatic method for the preparation of a good approximate ground-state wave function is described and demonstrated for stretched H$_{2}$. The number of quantum bits required scales linearly with the number of basis functions used and the number of gates required grows polynomially with the number of quantum bits.
To cite this abstract, use the following reference: http://meetings.aps.org/link/BAPS.2006.MAR.D27.5