Optimizing Multi-level Magic State Factories for Fault-Tolerant Quantum Architectures

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Silva, Allyson, Scherer, Artur, Webb, Zak, Khalid, Abdullah, Kulchytskyy, Bohdan, Kramer, Mia, Nguyen, Kevin, Kong, Xiangzhou, Dagnew, Gebremedhin A., Wang, Yumeng, Nguyen, Huy Anh, Gabbassov, Einar, Olfert, Katiemarie, Ronagh, Pooya
Format: Preprint
Published: 2024
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866916662570123264
author Silva, Allyson
Scherer, Artur
Webb, Zak
Khalid, Abdullah
Kulchytskyy, Bohdan
Kramer, Mia
Nguyen, Kevin
Kong, Xiangzhou
Dagnew, Gebremedhin A.
Wang, Yumeng
Nguyen, Huy Anh
Gabbassov, Einar
Olfert, Katiemarie
Ronagh, Pooya
author_facet Silva, Allyson
Scherer, Artur
Webb, Zak
Khalid, Abdullah
Kulchytskyy, Bohdan
Kramer, Mia
Nguyen, Kevin
Kong, Xiangzhou
Dagnew, Gebremedhin A.
Wang, Yumeng
Nguyen, Huy Anh
Gabbassov, Einar
Olfert, Katiemarie
Ronagh, Pooya
contents 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 ($β$).
format Preprint
id arxiv_https___arxiv_org_abs_2411_04270
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Optimizing Multi-level Magic State Factories for Fault-Tolerant Quantum Architectures
Silva, Allyson
Scherer, Artur
Webb, Zak
Khalid, Abdullah
Kulchytskyy, Bohdan
Kramer, Mia
Nguyen, Kevin
Kong, Xiangzhou
Dagnew, Gebremedhin A.
Wang, Yumeng
Nguyen, Huy Anh
Gabbassov, Einar
Olfert, Katiemarie
Ronagh, Pooya
Quantum Physics
Hardware Architecture
Optimization and Control
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 ($β$).
title Optimizing Multi-level Magic State Factories for Fault-Tolerant Quantum Architectures
topic Quantum Physics
Hardware Architecture
Optimization and Control
url https://arxiv.org/abs/2411.04270