PauliComposer: Compute Tensor Products of Pauli Matrices Efficiently

TL;DR

PauliComposer presents an efficient algorithm for tensor products of Pauli matrices, significantly accelerating quantum computations and optimizing Pauli basis decomposition in quantum simulations.

Contribution

The paper introduces a specialized algorithm that speeds up tensor product calculations of Pauli matrices, outperforming existing methods.

Findings

Remarkable acceleration over state-of-the-art techniques

Optimized method for Pauli basis decomposition

Enhanced efficiency in quantum simulation calculations

Abstract

We introduce a simple algorithm that efficiently computes tensor products of Pauli matrices. This is done by tailoring the calculations to this specific case, which allows to avoid unnecessary calculations. The strength of this strategy is benchmarked against state-of-the-art techniques, showing a remarkable acceleration. As a side product, we provide an optimized method for one key calculus in quantum simulations: the Pauli basis decomposition of Hamiltonians.