MagiCFirm: A Runtime for Magic-State Cultivation with Algorithm-Hardware Co-Design
Abstract
Magic-state cultivation offers a promising alternative for lowering the cost of non-Clifford operations in fault-tolerant quantum computing (FTQC). However, realizing cultivation in practice exposes two challenges: (i) the lack of an open-source classical runtime layer between logical software and physical control, and (ii) the latency constraints on protocol-specific decisions that determine magic-state readiness. To address these challenges, we adopt an algorithm--hardware co-design approach. At the algorithm level, we develop a two-stage early-escape scheme that identifies an informative subset of detectors offline, constructs a compact decoding problem, and performs partial decoding in parallel with complete decoding at runtime, allowing high-confidence attempts to advance before full decoding completes. At the hardware level, we present MagiCFirm, a configurable runtime that combines offline-compiled microprograms with dedicated datapaths for detector construction, event processing, and protocol control, enabling end-to-end execution of magic-state cultivation. Across evaluated configurations, MagiCFirm reduces wall-clock magic-state preparation time by up to 39.3% at matched logical error rate. For a representative magic-state-bound workload, this translates to an estimated 11% reduction in overall application runtime.
Related
- A Noise-Aware Quantum Algorithm for Credit Valuation Adjustments on Real Quantum Hardware
- Leveraging Industrial Foundation Models at the Edge of Particle Physics Detectors via Distillation Learning and Hardware Co-design
- Trial-space co-design for quantum simulation on noisy hardware
- Quantum-hardware spectral co-design framework for multifrequency Rydberg electrometry
- Hardware-Aware Design and Layout Selection in Quantum Reservoir Computing for Insurance Claims Forecasting
BibTeX
@misc{xu2026magicfirm,
title = {{MagiCFirm: A Runtime for Magic-State Cultivation with Algorithm-Hardware Co-Design}},
author = {Jubo Xu and Abbas B. Ziad and Prakash Murali and Hongxiang Fan},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.29267},
eprint = {2609.29267},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.29267},
}
RIS
TY - UNPB
TI - MagiCFirm: A Runtime for Magic-State Cultivation with Algorithm-Hardware Co-Design
AU - Jubo Xu
AU - Abbas B. Ziad
AU - Prakash Murali
AU - Hongxiang Fan
PY - 2026
DA - 2026/09/24
PB - arXiv
DO - 10.48550/arxiv.2609.29267
UR - https://arxiv.org/abs/2609.29267
AB - Magic-state cultivation offers a promising alternative for lowering the cost of non-Clifford operations in fault-tolerant quantum computing (FTQC). However, realizing cultivation in practice exposes two challenges: (i) the lack of an open-source classical runtime layer between logical software and physical control, and (ii) the latency constraints on protocol-specific decisions that determine magic-state readiness. To address these challenges, we adopt an algorithm--hardware co-design approach. At the algorithm level, we develop a two-stage early-escape scheme that identifies an informative subset of detectors offline, constructs a compact decoding problem, and performs partial decoding in parallel with complete decoding at runtime, allowing high-confidence attempts to advance before full decoding completes. At the hardware level, we present MagiCFirm, a configurable runtime that combines offline-compiled microprograms with dedicated datapaths for detector construction, event processing, and protocol control, enabling end-to-end execution of magic-state cultivation. Across evaluated configurations, MagiCFirm reduces wall-clock magic-state preparation time by up to 39.3% at matched logical error rate. For a representative magic-state-bound workload, this translates to an estimated 11% reduction in overall application runtime.
ER -