Optimizing Multi-level Magic State Factories for Fault-Tolerant Quantum Architectures
Abstract
We propose a novel technique for optimizing a modular fault-tolerant quantum computing architecture, taking into account any desired space-time trade-offs between the number of physical qubits and the fault-tolerant execution time of a quantum algorithm. We consider a concept architecture comprising a dedicated zone as a multi-level magic state factory and a core processor for efficient logical operations, forming a supply chain network for production and consumption of magic states. Using a heuristic algorithm, we solve the multi-objective optimization problem of minimizing space and time subject to a user-defined error budget for the success of the computation, taking the performance of various fault-tolerant protocols into account. As an application, we show that physical quantum resource estimation reduces to a simple model involving a small number of key parameters, namely, the circuit volume, the error prefactors () and error suppression rates () of the fault-tolerant protocols, the reaction time (), and an allowed slowdown factor ().
Cite
@article{arxiv.2411.04270,
title = {Optimizing Multi-level Magic State Factories for Fault-Tolerant Quantum Architectures},
author = {Allyson Silva and Artur Scherer and Zak Webb and Abdullah Khalid and Bohdan Kulchytskyy and Mia Kramer and Kevin Nguyen and Xiangzhou Kong and Gebremedhin A. Dagnew and Yumeng Wang and Huy Anh Nguyen and Einar Gabbassov and Katiemarie Olfert and Pooya Ronagh},
journal= {arXiv preprint arXiv:2411.04270},
year = {2025}
}
Comments
25 pages, 9 figures