Sparse-rank factorization methods in quantum physics

ORAL

Abstract

Lanczos-based algorithms have been demonstrated to play a pivotal role in quantum computing and classical methods. I review the development of these methods for a variety of physical systems and new implementations. I also review new use cases of these algorithms.

*T.E.B. is grateful to the US-UK Fulbright Commission for financial support and being hosted by the University of York. This research was undertaken in part thanks to funding from the Bureau of Education and Cultural Affairs from the United States Department of State. T.E.B. is grateful for support from the University of Victoria's start-up grant from the Faculty of Science.

–

Publication: [1] T.E. Baker, "Lanczos recursion on a quantum computer for the Green's function and ground state" Phys. Rev. A 103, 032404 (2021) [arXiv: 2008.05593]
[2] T.E. Baker, A. Foley, and D. Se ´ne ´chal Direct solution of multiple excitations in a matrix product state with block Lanczos submitted (2021) [arxiv: 2109.08181]
[3] T.E. Baker, Block "Lanczos method for excited states on a quantum computer" submitted (2021) [arxiv: 2109.14114]
[4] T.E. Baker, in preparation

Presenters

  • Thomas E Baker

    • University of Victoria

Authors

  • Thomas E Baker

    • University of Victoria