Locality-aware Pauli-based computation for local magic state preparation

• URL: http://arxiv.org/abs/2504.12091v2
• Date: Thu, 21 Aug 2025 08:30:20 GMT
• Title: Locality-aware Pauli-based computation for local magic state preparation
• Authors: Yutaka Hirano, Keisuke Fujii,
• Abstract summary: Magic state distillation is a process for preparing magic states needed to implement non-Clifford gates fault-tolerantly.<n>Recent advances in magic state distillation have significantly reduced the overhead, enabling the simultaneous preparation of many magic states.<n>We propose locality-aware Pauli-based computation, a novel compilation scheme that distills magic states in the area computation.
• Score: 0.9002260638342727
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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.

Related papers

• Efficient simulation of logical magic state preparation protocols [0.0]
  We introduce a method for simulating logical magic state preparation protocols under the standard circuit-level noise model.<n>We provide a proof-of-principle numerical simulation that prepares a magic state using such logical Clifford measurements.
  arXiv  Detail & Related papers  (2025-12-29T19:00:05Z)
• Scheduling Lattice Surgery with Magic State Cultivation [1.4558867025190718]
  Fault-tolerant quantum computation using surface codes relies on efficient scheduling of non-Clifford operations.<n>We introduce Pure Magic scheduling, which dynamically re-purposes magic state cultivation qubits for routing operations.<n>Our evaluation across 17 benchmark circuits improves scheduling efficiency by 19% to 223% compared to traditional bus routing.
  arXiv  Detail & Related papers  (2025-12-06T16:16:20Z)
• The Fast for the Curious: How to accelerate fault-tolerant quantum applications [101.46859364118622]
  We evaluate strategies for reducing the run time of fault-tolerant quantum computations.<n>We discuss how the co-design of hardware, fault tolerance, and algorithmic subroutines can reduce run times.
  arXiv  Detail & Related papers  (2025-10-30T02:27:55Z)
• An efficient algorithm to compute entanglement in states with low magic [11.189994857052634]
  Efficient extraction of entanglement can inform our understanding of dynamical quantum processes.<n>We develop an efficient classical algorithm to compute the von Neumann entropy and entanglement spectrum for such states.
  arXiv  Detail & Related papers  (2025-10-07T18:00:01Z)
• Unlocking early fault-tolerant quantum computing with mitigated magic dilution [47.23243191431113]
  We introduce mitigated magic dilution (MMD) as an approach to synthesise small-angle rotations.<n>We employ quantum error mitigation techniques to sample logical circuits given noisy encoded magic states.<n>This work paves the way for early fault-tolerant demonstrations on devices supporting millions of quantum operations.
  arXiv  Detail & Related papers  (2025-05-15T17:19:19Z)
• Experimental Demonstration of Logical Magic State Distillation [62.77974948443222]
  We present the experimental realization of magic state distillation with logical qubits on a neutral-atom quantum computer.<n>Our approach makes use of a dynamically reconfigurable architecture to encode and perform quantum operations on many logical qubits in parallel.
  arXiv  Detail & Related papers  (2024-12-19T18:38:46Z)
• Optimizing Multi-level Magic State Factories for Fault-Tolerant Quantum Architectures [0.8453577061453568]
  We consider a concept architecture comprising a dedicated zone as a multi-level magic state factory and a core processor for efficient logical operations. We show that physical quantum resource estimation reduces to a simple model involving a small number of key parameters.
  arXiv  Detail & Related papers  (2024-11-06T21:25:34Z)
• ExpertFlow: Optimized Expert Activation and Token Allocation for Efficient Mixture-of-Experts Inference [41.41316718220569]
  ExpertFlow is designed to enhance inference efficiency by accommodating flexible routing and enabling efficient expert scheduling between CPU and GPU. Our experiments demonstrate that ExpertFlow achieves up to 93.72% GPU memory savings and enhances inference speed by 2 to 10 times compared to baseline methods.
  arXiv  Detail & Related papers  (2024-10-23T15:24:54Z)
• MagicPool: Dealing with Magic State Distillation Failures on Large-Scale Fault-Tolerant Quantum Computer [0.9976140705777456]
  We propose a pool of magic states to reduce the additional run-time delay. We run simulations of quantum circuits to verify the magnitude of the run-time delay. The results show that the run-time delay is amplified by parallel processing, and pooling effectively reduces the run-time delay with a small spatial cost.
  arXiv  Detail & Related papers  (2024-07-10T06:36:26Z)
• Evaluation of phase shifts for non-relativistic elastic scattering using quantum computers [39.58317527488534]
  This work reports the development of an algorithm that makes it possible to obtain phase shifts for generic non-relativistic elastic scattering processes on a quantum computer.
  arXiv  Detail & Related papers  (2024-07-04T21:11:05Z)
• Handbook for Quantifying Robustness of Magic [0.0]
  Robustness of magic (RoM) characterizes the degree of usefulness of a given quantum state for non-Clifford operation. We present efficient novel algorithms to compute the RoM. We numerically demonstrate our state-of-the-art results for copies of magic states and partially disentangled quantum states.
  arXiv  Detail & Related papers  (2023-11-02T16:15:00Z)
• Single-ancilla ground state preparation via Lindbladians [4.328210085579236]
  We design a quantum algorithm for ground state preparation in the early fault tolerant regime. As a Monte Carlo-style quantum algorithm, our method features a Lindbladian where the target state is stationary. Our algorithm can be implemented using just one ancilla qubit and efficiently simulated on a quantum computer.
  arXiv  Detail & Related papers  (2023-08-30T00:11:19Z)
• A Reorder Trick for Decision Diagram Based Quantum Circuit Simulation [0.4358626952482686]
  We study two classes of quantum circuits on which the state-of-the-art decision diagram based simulators failed to perform well in terms of simulation time. We propose a simple and powerful reorder trick to boost the simulation of such quantum circuits.
  arXiv  Detail & Related papers  (2022-11-14T04:55:25Z)
• Quantum algorithm for stochastic optimal stopping problems with applications in finance [60.54699116238087]
  The famous least squares Monte Carlo (LSM) algorithm combines linear least square regression with Monte Carlo simulation to approximately solve problems in optimal stopping theory. We propose a quantum LSM based on quantum access to a process, on quantum circuits for computing the optimal stopping times, and on quantum techniques for Monte Carlo.
  arXiv  Detail & Related papers  (2021-11-30T12:21:41Z)
• Ps and Qs: Quantization-aware pruning for efficient low latency neural network inference [56.24109486973292]
  We study the interplay between pruning and quantization during the training of neural networks for ultra low latency applications. We find that quantization-aware pruning yields more computationally efficient models than either pruning or quantization alone for our task.
  arXiv  Detail & Related papers  (2021-02-22T19:00:05Z)
• Continuous-time dynamics and error scaling of noisy highly-entangling quantum circuits [58.720142291102135]
  We simulate a noisy quantum Fourier transform processor with up to 21 qubits. We take into account microscopic dissipative processes rather than relying on digital error models. We show that depending on the dissipative mechanisms at play, the choice of input state has a strong impact on the performance of the quantum algorithm.
  arXiv  Detail & Related papers  (2021-02-08T14:55:44Z)
• Community detection using fast low-cardinality semidefinite programming [94.4878715085334]
  We propose a new low-cardinality algorithm that generalizes the local update to maximize a semidefinite relaxation derived from Leiden-k-cut. This proposed algorithm is scalable, outperforms state-of-the-art algorithms, and outperforms in real-world time with little additional cost.
  arXiv  Detail & Related papers  (2020-12-04T15:46:30Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.