A variational eigenvalue solver on a photonic quantum processor

Other free copies

• Cornell University (arxiv.org)Preprint · PDF
• Office of Scientific and Technical Information (osti.gov)Preprint · PDF
• European Bioinformatics Institute (ncbi.nlm.nih.gov)Preprint · Web page
• Harvard University (nrs.harvard.edu)Preprint · Web page
• RMIT University (doi.org)Preprint · Web page
• Figshare (United Kingdom) (figshare.com)Preprint · Web page
• The University of Western Australia (scopus.com)Preprint · Web page
• Cornell University (doi.org)Free copy · Web page

Abstract

Quantum computers promise to efficiently solve important problems that are intractable on a conventional computer. For quantum systems, where the physical dimension grows exponentially, finding the eigenvalues of certain operators is one such intractable problem and remains a fundamental challenge. The quantum phase estimation algorithm efficiently finds the eigenvalue of a given eigenvector but requires fully coherent evolution. Here we present an alternative approach that greatly reduces the requirements for coherent evolution and combine this method with a new approach to state preparation based on ansätze and classical optimization. We implement the algorithm by combining a highly reconfigurable 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+. The proposed approach drastically reduces the coherence time requirements, enhancing the potential of quantum resources available today and in the near future. Quantum computers promise to efficiently solve problems that would be practically impossible with a normal computer. Peruzzo et al. develop a variational computation approach that uses any available quantum resources and, with a photonic quantum processing unit, find the ground-state molecular energy of He–H+.