Lanczos recursion on a quantum computer for the Green's function and ground state

Thomas E. Baker
Phys. Rev. A 103, 032404 – Published 4 March 2021

Abstract

A state-preserving quantum counting algorithm is used to obtain coefficients of a Lanczos recursion from a single ground-state wave function on the quantum computer. This is used to compute the continued fraction representation of an interacting Green's function for use in condensed matter, particle physics, and other areas. The wave function does not need to be reprepared at each iteration. The quantum algorithm represents an exponential reduction in memory over known classical methods. An extension of the method to determining the ground state is also discussed.

  • Figure
  • Figure
  • Received 12 August 2020
  • Revised 26 January 2021
  • Accepted 18 February 2021

DOI:https://doi.org/10.1103/PhysRevA.103.032404

©2021 American Physical Society

Physics Subject Headings (PhySH)

Quantum Information, Science & Technology

Authors & Affiliations

Thomas E. Baker

  • Institut quantique & Département de physique, Université de Sherbrooke, Sherbrooke, Québec J1K 2R1 Canada and Department of Physics, University of York, Heslington,York YO10 5DD, United Kingdom

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 103, Iss. 3 — March 2021

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review A

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×