New random compiler for Hamiltonians via Markov Chains

TL;DR

None

Contribution

None

Abstract

Many quantum algorithms, such as adiabatic algorithms (e.g. AQC) and phase randomisation, require simulating Hamiltonian evolution. In addition, the simulation of physical systems is an important objective in its own right. In many cases, the Hamiltonian is complex at first sight, but can be decomposed as a linear combination of simple ones; for instance, a sum of local Hamiltonians for Ising models or a sum of time-independent Hamiltonians with time-dependent coefficients (which is typically the case for adiabatic algorithms). In this paper we develop a new compiler, similar to the first order randomized Trotter, or qDRIFT, but with an arguably simpler framework. It is more versatile as it supports a large class of randomisation schemes and as well as time-dependent weights. We first present the model and derive its governing equations. We then define and analyze the simulation error for a sum of two Hamiltonians, and generalize it to a sum of $Q$ Hamiltonians. We prove that the number of gates necessary to simulate the weighted sum of $Q$ Hamiltonians of magnitude $C$ during a time $T$ with an error less than $\epsilon_0$ grows as $\tilde{\mathcal{O}}\left(C^2T^2\epsilon_0^{-1}\right)$.