Simulating sparse Hamiltonians with star decompositions

TL;DR

This paper introduces an improved quantum algorithm for simulating sparse Hamiltonians by decomposing them into star-structured components, resulting in better query complexity than previous methods.

Contribution

It presents a novel decomposition technique into star graphs and an efficient simulation algorithm with reduced complexity for sparse Hamiltonians.

Findings

Achieves lower query complexity than previous algorithms.

Decomposes sparse Hamiltonians into star-structured components.

Provides an efficient simulation method for quantum systems.

Abstract

We present an efficient algorithm for simulating the time evolution due to a sparse Hamiltonian. In terms of the maximum degree d and dimension N of the space on which the Hamiltonian H acts for time t, this algorithm uses (d^2(d+log* N)||Ht||)^{1+o(1)} queries. This improves the complexity of the sparse Hamiltonian simulation algorithm of Berry, Ahokas, Cleve, and Sanders, which scales like (d^4(log* N)||Ht||)^{1+o(1)}. To achieve this, we decompose a general sparse Hamiltonian into a small sum of Hamiltonians whose graphs of non-zero entries have the property that every connected component is a star, and efficiently simulate each of these pieces.