PIRSA:20110045

Video URL

https://pirsa.org/20110045

Strategies for solving the Fermi-Hubbard model on near-term quantum computers

Montanaro, A. (2020). Strategies for solving the Fermi-Hubbard model on near-term quantum computers. Perimeter Institute for Theoretical Physics. https://pirsa.org/20110045

Montanaro, Ashley. Strategies for solving the Fermi-Hubbard model on near-term quantum computers. Perimeter Institute for Theoretical Physics, Nov. 04, 2020, https://pirsa.org/20110045 

          @misc{ scivideos_PIRSA:20110045,
            doi = {10.48660/20110045},
            url = {https://pirsa.org/20110045},
            author = {Montanaro, Ashley},
            keywords = {Quantum Information},
            language = {en},
            title = {Strategies for solving the Fermi-Hubbard model on near-term quantum computers},
            publisher = {Perimeter Institute for Theoretical Physics},
            year = {2020},
            month = {nov},
            note = {PIRSA:20110045 see, \url{https://scivideos.org/index.php/pirsa/20110045}}
          }

Ashley Montanaro University of Bristol

Talk numberPIRSA:20110045
DOI10.48660/20110045
Source RepositoryPIRSA
Collection
Talk Type Scientific Series
Subject

Abstract

The Fermi-Hubbard model is of fundamental importance in condensed-matter physics, yet is extremely challenging to solve numerically. Finding the ground state of the Hubbard model using variational methods has been predicted to be one of the first applications of near-term quantum computers. In this talk, I will discuss recent work which carried out a detailed analysis and optimisation of the complexity of variational quantum algorithms for finding the ground state of the Hubbard model, including extensive numerical experiments for systems with up to 12 sites. The depth complexities we find are substantially lower than previous work. If our numerical results on small lattice sizes are representative of the somewhat larger lattices accessible to near-term quantum hardware, they suggest that optimising over quantum circuits with a gate depth less than a thousand could be sufficient to solve instances of the Hubbard model beyond the capacity of classical exact diagonalisation. I will also discuss a proof-of-principle implementation on Rigetti quantum computing hardware.

The talk is based on joint work with Chris Cade, Lana Mineh and Stasja Stanisic ( arXiv:1912.06007 , arXiv:2006.01179 ).