On the Constant Depth Implementation of Pauli Exponentials

We decompose for the first time, under the very restrictive linear nearest-neighbour connectivity, ZZ…Z exponentials of arbitrary length into circuits of constant depth using O(n) ancillae and two-body XX and ZZ interactions. Consequently, a similar method works for arbitrary Pauli exponentials. We prove the correctness of our approach, after introducing novel rewrite rules for circuits which benefit from qubit recycling. The decomposition has a wide variety of applications ranging from the efficient implementation of fault-tolerant lattice surgery computations, to expressing arbitrary stabilizer circuits via two-body interactions only, and to reducing the depth of NISQ computations, such as VQE.