Randomizing multi-product formulas for Hamiltonian simulation

TL;DR

This paper introduces a randomized sampling framework for quantum Hamiltonian simulation that combines multi-product formulas with reduced circuit depth, enabling efficient simulation on early quantum computers with rigorous performance guarantees.

Contribution

It unites randomized compiling with multi-product formulas, proposing new algorithms that reduce circuit depth and improve simulation efficiency for quantum systems.

Findings

Achieves exponential error reduction with circuit depth

Reduces circuit complexity by avoiding amplitude amplification

Demonstrates effectiveness on fermionic and Sachdev-Ye-Kitaev models

Abstract

Quantum simulation, the simulation of quantum processes on quantum computers, suggests a path forward for the efficient simulation of problems in condensed-matter physics, quantum chemistry, and materials science. While the majority of quantum simulation algorithms are deterministic, a recent surge of ideas has shown that randomization can greatly benefit algorithmic performance. In this work, we introduce a scheme for quantum simulation that unites the advantages of randomized compiling on the one hand and higher-order multi-product formulas, as they are used for example in linear-combination-of-unitaries (LCU) algorithms or quantum error mitigation, on the other hand. In doing so, we propose a framework of randomized sampling that is expected to be useful for programmable quantum simulators and present two new multi-product formula algorithms tailored to it. Our framework reduces the circuit depth by circumventing the need for oblivious amplitude amplification required by the implementation of multi-product formulas using standard LCU methods, rendering it especially useful for early quantum computers used to estimate the dynamics of quantum systems instead of performing full-fledged quantum phase estimation. Our algorithms achieve a simulation error that shrinks exponentially with the circuit depth. To corroborate their functioning, we prove rigorous performance bounds as well as the concentration of the randomized sampling procedure. We demonstrate the functioning of the approach for several physically meaningful examples of Hamiltonians, including fermionic systems and the Sachdev-Ye-Kitaev model, for which the method provides a favorable scaling in the effort.