University of Cambridge > > Isaac Newton Institute Seminar Series > A variational eigenvalue solver on a quantum processor

A variational eigenvalue solver on a quantum processor

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Mustapha Amrani.

Mathematical Challenges in Quantum Information

Co-authors: Alberto Peruzzo (University of Sydney), Peter Shadbolt (University of Bristol), Man-Hong Yung (Tsinghua University), Xiao-Qi Zhou (University of Bristol), Peter Love (Haverford College), Alan Aspuru-Guzik (Harvard University), Jeremy O’Brien (University of Bristol)

Quantum computers promise to efficiently solve important problems that are intractable on a conventional computer. For quantum systems, where the dimension of the problem space grows exponentially, finding the eigenvalues of certain operators is one such intractable problem and remains a fundamental challenge. The quantum phase estimation algorithm can efficiently find the eigenvalue of a given eigenvector but requires fully coherent evolution. We present an alternative approach that greatly reduces the requirements for coherent evolution and we combine this method with a new approach to state preparation based on ans”atze and classical optimization. We have implemented the algorithm by combining a small-scale photonic quantum processor with a conventional computer. We experimentally demonstrate the feasibility of this approach with an example from quantum chemistry: calculating the ground state molecular energy for He-H+, to within chemical accuracy. The proposed appro ach, by drastically reducing the coherence time requirements, enhances the potential of the quantum resources available today and in the near future.

This talk is part of the Isaac Newton Institute Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2023, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity