Integrated Analysis of Performance and Resource of Large-Scale Quantum Computing

TL;DR

This paper presents an integrated analysis method for evaluating the performance and resource requirements of large-scale quantum computing systems, considering algorithms, error correction, and device architecture.

Contribution

It introduces a comprehensive framework that maps quantum algorithms from physical qubits to system architecture, enabling more accurate and practical resource analysis.

Findings

Shor's algorithm for 512-bit factorization requires approximately 878,000 hours.

The method can analyze optimal fault-tolerance parameters like concatenation level and code distance.

Supports dynamic, real-world quantum computer performance evaluation.

Abstract

To see the feasibility of a large-scale quantum computing, it is required to accurately analyze the performance and the quantum resource. However, most of the analysis reported so far have focused on the statistical examination, i.e., simply calculating the performance and resource based on individual data, and even worse usually only a few components have been considered. In this work, to achieve more exact analysis, we propose an integrated analysis method for a practical quantum computing model with three components (\textit{algorithm}, \textit{error correction} and \textit{device}) under a realistic quantum computer system architecture. To implement the above method, we develop a quantum computing framework composed of three functional layers: compile, system and building block. This framework can support, for the first time, the mapping of quantum algorithm from physical qubit level to system architecture level with a given fault-tolerant scheme. Therefore, the proposed method can measure the effect of dynamic situation when the quantum computer practically runs. By using our method, we found that Shor algorithm to factorize 512-bit integer requires $8.78\times 10^ 5$ hours. We also show how the proposed method can be used for analyzing optimal concatenation level and code distance of fault-tolerant quantum computing.