On the Constant Depth Implementation of Pauli Exponentials

2024/08/15 by Moflic, Ioana, Paler, Alexandru · 1 citation
#FOS: Physical sciences #Quantum Physics (quant-ph)

paper · doi:10.48550/arxiv.2408.08265

Abstract

We decompose, under the very restrictive linear nearest-neighbour connectivity, Z^{⊗ n} 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 practical fault-tolerant lattice surgery computations, to expressing arbitrary stabilizer circuits via two-body interactions only and parallel decoding of quantum error-correcting computations.

Cited by

• Space-Time Optimisations for Early Fault-Tolerant Quantum Computation

Related

• Decomposition Algorithm of an Arbitrary Pauli Exponential through a Quantum Circuit
• Polylogarithmic-depth controlled-NOT gates without ancilla qubits
• Low-depth Circuit Implementation of Parity Constraints for Quantum Optimization
• Depth reduction for quantum Clifford circuits through Pauli measurements
• Zassenhaus Expansion in Solving the Schrödinger Equation