ﻻ يوجد ملخص باللغة العربية
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.78times 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.
Photonic quantum computing is one of the leading approaches to universal quantum computation. However, large-scale implementation of photonic quantum computing has been hindered by its intrinsic difficulties, such as probabilistic entangling gates fo
Considering the large-scale quantum computer, it is important to know how much quantum computational resources is necessary precisely and quickly. Unfortunately the previous methods so far cannot support a large-scale quantum computing practically an
Building a quantum computer that surpasses the computational power of its classical counterpart is a great engineering challenge. Quantum software optimizations can provide an accelerated pathway to the first generation of quantum computing applicati
Fault-tolerant schemes can use error correction to make a quantum computation arbitrarily ac- curate, provided that errors per physical component are smaller than a certain threshold and in- dependent of the computer size. However in current experime
We give precise quantum resource estimates for Shors algorithm to compute discrete logarithms on elliptic curves over prime fields. The estimates are derived from a simulation of a Toffoli gate network for controlled elliptic curve point addition, im