Litcius/Paper detail

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

Thomas E. Baker

2021Physical review. A/Physical review, A29 citationsDOIOpen Access PDF

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.

Topics & Concepts

Lanczos resamplingRecursion (computer science)Wave functionGround stateQuantum algorithmFunction (biology)QuantumQuantum computerPhysicsMathematicsQuantum mechanicsApplied mathematicsStatistical physicsAlgorithmEvolutionary biologyEigenvalues and eigenvectorsBiologyQuantum Computing Algorithms and ArchitectureQuantum and electron transport phenomenaQuantum many-body systems