Computation of Operator Exponentials Using the Dunford–Cauchy Integral
AI Breakdown
Get a structured breakdown of this paper — what it's about, the core idea, and key takeaways for the field.
Abstract
We consider an \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$n$$\end{document}-qubit quantum system with a Hamiltonian, defined by an expansion in the Pauli basis, and propose a new algorithm for classical computing the exponential of the Hamiltonian. The algorithm is based on the representation of the exponential by the Dunford–Cauchy integral, followed by an efficient computation of the resolvent, and is suitable for Hamiltonians that are sparse in the Pauli basis. The practical efficiency of the algorithm is demonstrated by two illustrative examples.