A variational eigenvalue solver on a quantum processor

Duration: 54 mins 7 secs

Share this media item:

Embed this media item:

<iframe width="_width_" height="_height_" src="https://sms.cam.ac.uk/media/1606752/embed" frameborder="0" scrolling="no" allowfullscreen></iframe>

Choose size:

About this item

Available Formats

About this item

Description:	McClean, J (Harvard University) Thursday 28 November 2013, 10:00-11:00


Created:	2013-11-29 11:40
Collection:	Mathematical Challenges in Quantum Information
Publisher:	Isaac Newton Institute
Copyright:	McClean, J
Language:	eng (English)


Abstract:	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.

Abstract:

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.

Available Formats

Format	Quality	Bitrate	Size
MPEG-4 Video	640x360	1.94 Mbits/sec	788.02 MB	View	Download
WebM	640x360	710.46 kbits/sec	281.69 MB	View	Download
iPod Video	480x270	521.98 kbits/sec	206.90 MB	View	Download
MP3	44100 Hz	249.78 kbits/sec	99.10 MB	Listen	Download
Auto *	(Allows browser to choose a format it supports)