Scheduling Lattice Surgery with Magic State Cultivation

• URL: http://arxiv.org/abs/2512.06484v1
• Date: Sat, 06 Dec 2025 16:16:20 GMT
• Title: Scheduling Lattice Surgery with Magic State Cultivation
• Authors: Steven Hofmeyr, Mathias Weiden, Justin Kalloor, John Kubiatowicz, Costin Iancu,
• Abstract summary: 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.
• Score: 1.4558867025190718
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Fault-tolerant quantum computation using surface codes relies on efficient scheduling of non-Clifford operations, realized via the injection of magic states produced through a probabilistic process that dominates spacetime costs. Existing scheduling approaches use dedicated bus qubits for routing and separate peripheral ancilla qubit factories for magic state preparation, leading to inefficient resource utilization. With the advent of magic state cultivation, preparation qubits can be placed anywhere within the surface code architecture. We introduce Pure Magic scheduling, which dynamically re-purposes magic state cultivation qubits for routing operations, eliminating dedicated bus infrastructure. By interrupting cultivation when qubits are needed for routing, Pure Magic naturally favors shorter cultivation times while ensuring no ancilla qubit remains idle. Our evaluation across 17 benchmark circuits improves scheduling efficiency by 19% to 223% compared to traditional bus routing and decreases average magic state preparation time by 2.6x to 9.7x. Benefits scale with circuit parallelism, making Pure Magic particularly valuable for highly parallel quantum algorithms. The Pure Magic architecture represents a paradigm shift from static to dynamic, demand-driven scheduling in fault-tolerant quantum architectures.

Related papers

• Magic state cultivation on a superconducting quantum processor [108.15404500422814]
  We present an experimental study of magic state cultivation on a superconducting quantum processor.<n>Cultivation reduces the error by a factor of 40, with a state fidelity of 0.9999(1).
  arXiv  Detail & Related papers  (2025-12-15T21:29:40Z)
• 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)
• Unlocking early fault-tolerant quantum computing with mitigated magic dilution [41.95227943686519]
  We introduce mitigated magic dilution (MMD) as an approach to synthesise small-angle rotations.<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)
• Scalable LLM Math Reasoning Acceleration with Low-rank Distillation [57.922185576872444]
  We propose a resource-efficient distillation method to recover lost capabilities from deploying efficient inference methods.<n>With original weights unperturbed, roughly 1% of additional parameters, and only 20K synthetic training samples, we are able to recover much if not all of the math capabilities lost.
  arXiv  Detail & Related papers  (2025-05-08T17:51:24Z)
• Locality-aware Pauli-based computation for local magic state preparation [0.9002260638342727]
  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.
  arXiv  Detail & Related papers  (2025-04-16T13:54:03Z)
• 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)
• 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)
• Encoding a magic state with beyond break-even fidelity [1.449788466039287]
  We propose and implement a scheme to prepare a magic state on a superconducting qubit array using error correction. We find that our scheme produces better magic states than those we can prepare using the individual qubits of the device. Our prototype will be invaluable in the future as it can reduce the number of physical qubits needed to produce high-fidelity magic states.
  arXiv  Detail & Related papers  (2023-05-23T01:19:53Z)
• Adaptable Butterfly Accelerator for Attention-based NNs via Hardware and Algorithm Co-design [66.39546326221176]
  Attention-based neural networks have become pervasive in many AI tasks. The use of the attention mechanism and feed-forward network (FFN) demands excessive computational and memory resources. This paper proposes a hardware-friendly variant that adopts a unified butterfly sparsity pattern to approximate both the attention mechanism and the FFNs.
  arXiv  Detail & Related papers  (2022-09-20T09:28:26Z)
• Time-Sliced Quantum Circuit Partitioning for Modular Architectures [67.85032071273537]
  Current quantum computer designs will not scale. To scale beyond small prototypes, quantum architectures will likely adopt a modular approach with clusters of tightly connected quantum bits and sparser connections between clusters. We exploit this clustering and the statically-known control flow of quantum programs to create tractable partitionings which map quantum circuits to modular physical machines one time slice at a time.
  arXiv  Detail & Related papers  (2020-05-25T17:58:44Z)
• Very low overhead fault-tolerant magic state preparation using redundant ancilla encoding and flag qubits [1.2891210250935146]
  We introduce a new concept which we call redundant ancilla encoding. We show that our scheme can produce magic states using an order of magnitude fewer qubits and space-time overhead.
  arXiv  Detail & Related papers  (2020-03-06T06:24:02Z)

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.