4.6 Article

Randomizing multi-product formulas for Hamiltonian simulation

Journal

QUANTUM
Volume 6, Issue -, Pages -

Publisher

VEREIN FORDERUNG OPEN ACCESS PUBLIZIERENS QUANTENWISSENSCHAF
DOI: 10.22331/q-2022-09-19-806

Keywords

-

Funding

  1. DFG [EI 519/21-1]
  2. European Union [817482]
  3. BMWK
  4. BMBF
  5. Einstein Foundation (Einstein Research Unit on Quantum Devices)
  6. ARC Centre of Excellence for Quantum Computation and Communication Technology (CQC2T) [CE170100012]
  7. Munich Quantum Valley

Ask authors/readers for more resources

This article introduces a new quantum simulation approach that combines the advantages of randomized compiling and higher-order multi-product formulas, proposing a framework for programmable quantum simulators and two new multi-product formula algorithms. This framework reduces circuit depth, especially suitable for early quantum computers.
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.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.6
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available