Locality-aware Pauli-based computation for local magic state preparation
arXiv:2504.12091 · doi:10.1109/QCE65121.2025.00078
Abstract
Magic state distillation, a process for preparing magic states needed to implement non-Clifford gates fault-tolerantly, 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.
11 pages, 26 figures
References in corpus (18)
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Universal Quantum Computation with ideal Clifford gates and noisy ancillas
- How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits
- Surface code quantum computing by lattice surgery
- A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
- Quantum Supremacy and the Complexity of Random Circuit Sampling
- Q#: Enabling scalable quantum computing and development with a high-level domain-specific language
- Magic State Distillation: Not as Costly as You Think
- Quipper: A Scalable Quantum Programming Language
- Universal quantum computing with twist-free and temporally encoded lattice surgery
- Surface code compilation via edge-disjoint paths
- Shorter quantum circuits via single-qubit gate approximation
- Inplace Access to the Surface Code Y Basis
- Efficient Magic State Distillation by Zero-Level Distillation
- Resource Optimized Quantum Architectures for Surface Code Implementations of Magic-State Distillation
- Realistic Cost to Execute Practical Quantum Circuits using Direct Clifford+T Lattice Surgery Compilation
- Mitigating errors in logical qubits
- Leveraging Zero-Level Distillation to Generate High-Fidelity Magic States