  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 and therefore the analysis because they usually use a
non-structured code. To overcome this problem, we propose a fast mapping by
using the hierarchical assembly code which is much more compact than the
non-structured code. During the mapping process, the necessary modules and
their interconnection can be dynamically mapped by using the communication bus
at the cost of additional qubits. In our study, the proposed method works very
fast such as 1 hour than 1500 days for Shor algorithm to factorize 512-bit
integer. Meanwhile, since the hierarchical assembly code has high degree of
locality, it has shorter SWAP chains and hence it does not increase the quantum
computation time than expected.
