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

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.

References in corpus (21)

• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Surface codes: Towards practical large-scale quantum computation
• Good Quantum Error-Correcting Codes Exist
• A Theory of Fault-Tolerant Quantum Computation
• Fault-tolerant quantum computation with high threshold in two dimensions
• Efficient long distance quantum communication
• High threshold universal quantum computation on the surface code
• ProjectQ: An Open Source Software Framework for Quantum Computing
• Overhead and noise threshold of fault-tolerant quantum error correction
• The Impact of Quantum Computing on Present Cryptography
• Layered architecture for quantum computing
• Optimal Resources for Topological 2D Stabilizer Codes: Comparative Study
• Single-shot fault-tolerant quantum error correction
• ScaffCC: Scalable Compilation and Analysis of Quantum Programs
• Multilevel distillation of magic states for quantum computing
• Quantum Circuit Placement
• Distributed Quantum Computation Architecture Using Semiconductor Nanophotonics
• Surface code implementation of block code state distillation
• Two-step approach to scheduling quantum circuits
• Mapping of Lattice Surgery-based Quantum Circuits on Surface Code Architectures
• On the Use of Shor States for the [7,1,3] Quantum Error Correcting Code