Orchestrating multi-level magic state distillation: a dynamic pipeline architecture

• URL: http://arxiv.org/abs/2509.24402v1
• Date: Mon, 29 Sep 2025 07:49:40 GMT
• Title: Orchestrating multi-level magic state distillation: a dynamic pipeline architecture
• Abstract summary: A magic state distillation factory consumes many low-fidelity input magic states and produces fewer, higher-fidelity states.<n>To reach high fidelities, multiple distillation factories are typically chained together into a multi-level pipeline.<n>We introduce a novel dynamic pipeline architecture to optimize the resource usage of distillation pipelines.
• Score: 0.8021197489470756
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Practical quantum computation requires high-fidelity instruction executions on qubits. Among them, Clifford instructions are relatively easy to perform, while non-Clifford instructions require the use of magic states. This makes magic state distillation a central procedure in fault-tolerant quantum computing. A magic state distillation factory consumes many low-fidelity input magic states and produces fewer, higher-fidelity states. To reach high fidelities, multiple distillation factories are typically chained together into a multi-level pipeline, consuming significant quantum computational resources. Our work optimizes the resource usage of distillation pipelines by introducing a novel dynamic pipeline architecture. Observing that distillation pipelines consume magic states in a burst-then-steady pattern, we develop dynamic factory scheduling and resource allocation techniques that go beyond existing static pipeline organizations. Dynamic pipelines reduce the qubit cost by 16%-70% for large-scale quantum applications and achieve average reductions of 26%-37% in qubit-time volume on generated distillation benchmarks compared to state-of-the-art static architectures. By significantly reducing the resource overhead of this building block, our work accelerates progress towards the practical realization of fault-tolerant quantum computers.

Related papers

• Towards Continuous Profiling and Optimization of Quantum-Classical Pipelines [3.3978978857739204]
  We present LLQM (Low-Level Quantum Machine), a profiling-driven meta-framework for quantum-classical pipelines.<n>We show that continuous profiling exposes bottlenecks and enables hardware-, fidelity-, and workload-aware runtime optimizations.
  arXiv  Detail & Related papers  (2026-09-05T02:19:19Z)
• Distilling Magic States in the Bicycle Architecture [2.0424354398563294]
  Magic State Distillation is considered to be one of the promising methods for supplying the non-Clifford resources required to achieve universal fault tolerance.<n> Conventional MSD protocols implemented in surface codes often require multiple code blocks and lattice surgery rounds, resulting in substantial qubit overhead, especially at low target error rates.
  arXiv  Detail & Related papers  (2026-02-24T04:57:42Z)
• 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)
• 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)
• Continual Low-Rank Scaled Dot-product Attention [67.11704350478475]
  We introduce a new formulation of the Scaled-product Attention based on the Nystr"om approximation that is suitable for Continual Inference.<n>In experiments on Online Audio Classification and Online Action Detection tasks, the proposed Continual Scaled Dot-product Attention can lower the number of operations by up to three orders of magnitude.
  arXiv  Detail & Related papers  (2024-12-04T11:05:01Z)
• Surpassing the fundamental limits of distillation with catalysts [2.107610564835429]
  We show that quantum catalysts can help surpass previously known fundamental limitations on distillation overhead. In particular, in context of magic state distillation, our result indicates that the code-based low-overhead distillation protocols can be promoted to the one-shot setting. We demonstrate that enables a spacetime trade-off between overhead and success probability.
  arXiv  Detail & Related papers  (2024-10-18T15:41:52Z)
• Realistic Cost to Execute Practical Quantum Circuits using Direct Clifford+T Lattice Surgery Compilation [0.618727087412292]
  We report a resource estimation pipeline that explicitly compiles quantum circuits expressed using the Clifford+T gate set into a surface code lattice surgery instruction set. The cadence of magic state requests from the compiled circuit enables the optimization of magic state distillation and storage requirements in a post-hoc analysis.
  arXiv  Detail & Related papers  (2023-11-17T18:15:36Z)
• On-Chip Hardware-Aware Quantization for Mixed Precision Neural Networks [52.97107229149988]
  We propose an On-Chip Hardware-Aware Quantization framework, performing hardware-aware mixed-precision quantization on deployed edge devices. For efficiency metrics, we built an On-Chip Quantization Aware pipeline, which allows the quantization process to perceive the actual hardware efficiency of the quantization operator. For accuracy metrics, we propose Mask-Guided Quantization Estimation technology to effectively estimate the accuracy impact of operators in the on-chip scenario.
  arXiv  Detail & Related papers  (2023-09-05T04:39:34Z)
• Q-DETR: An Efficient Low-Bit Quantized Detection Transformer [50.00784028552792]
  We find that the bottlenecks of Q-DETR come from the query information distortion through our empirical analyses. We formulate our DRD as a bi-level optimization problem, which can be derived by generalizing the information bottleneck (IB) principle to the learning of Q-DETR. We introduce a new foreground-aware query matching scheme to effectively transfer the teacher information to distillation-desired features to minimize the conditional information entropy.
  arXiv  Detail & Related papers  (2023-04-01T08:05:14Z)
• Virtual quantum resource distillation [0.29998889086656577]
  Distillation, or purification, is central to the practical use of quantum resources in noisy settings. We show that virtual resource distillation provides considerable advantages over standard notions of distillation. We consider applications to coherence, entanglement, and magic distillation, and an explicit example in quantum teleportation.
  arXiv  Detail & Related papers  (2023-03-02T04:15:52Z)
• Where Is My Training Bottleneck? Hidden Trade-Offs in Deep Learning Preprocessing Pipelines [77.45213180689952]
  Preprocessing pipelines in deep learning aim to provide sufficient data throughput to keep the training processes busy. We introduce a new perspective on efficiently preparing datasets for end-to-end deep learning pipelines. We obtain an increased throughput of 3x to 13x compared to an untuned system.
  arXiv  Detail & Related papers  (2022-02-17T14:31:58Z)
• ALF: Autoencoder-based Low-rank Filter-sharing for Efficient Convolutional Neural Networks [63.91384986073851]
  We propose the autoencoder-based low-rank filter-sharing technique technique (ALF) ALF shows a reduction of 70% in network parameters, 61% in operations and 41% in execution time, with minimal loss in accuracy.
  arXiv  Detail & Related papers  (2020-07-27T09:01:22Z)
• 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.