Locality-Aware Pauli-Based Computation for Local Magic State Preparation

Abstract

Magic state distillation, a process for preparing magic states needed to implement non-Clifford gates faulttolerantly, plays a crucial role in fault-tolerant quantum computation. Historically, it has been a major bottleneck, leading to the pursuit of computation schemes optimized for slow magic state preparation. Recent advances in magic state distillation have significantly reduced the overhead, enabling the simultaneous preparation of many magic states. However, the magic state transfer cost prevents the conventional layout from efficiently utilizing them, highlighting the need for an alternative scheme optimized for highly parallel quantum algorithms. In this study, we propose locality-aware Pauli-based computation, a novel compilation scheme that distills magic states in the computation area, aiming to reduce execution time by minimizing magic state transfer costs and improving locality. Numerical experiments on random circuit sampling and 2D Ising Hamiltonian simulation demonstrate that our scheme significantly reduces execution time-while incurring little or no additional spatial overhead-compared to sequential Pauli-based computation, a conventional computation scheme, and scales favorably with increasing qubit count.