@techreport{oai:ipsj.ixsq.nii.ac.jp:00217642,
 author = {Makoto, Nakai and Rodney, Van Meter and Makoto, Nakai and Rodney, Van Meter},
 issue = {20},
 month = {Mar},
 note = {Task allocation is one of the essential procedures in distributed computing and this will be also true for distributed quantum computing, which is a promising approach to achieve large-scale quantum computing. Total execution time and the stability in the entire system are the two main optimization criteria for this problem, but existing works for distributed qubit allocation only deal with the latter. This work proposes the heuristic algorithm to decide how each qubit on the given quantum circuit should be allocated on quantum processors with different execution time in order to minimize the total execution time. The performance of the proposed scheme is also evaluated by a simple numerical simulation., Task allocation is one of the essential procedures in distributed computing and this will be also true for distributed quantum computing, which is a promising approach to achieve large-scale quantum computing. Total execution time and the stability in the entire system are the two main optimization criteria for this problem, but existing works for distributed qubit allocation only deal with the latter. This work proposes the heuristic algorithm to decide how each qubit on the given quantum circuit should be allocated on quantum processors with different execution time in order to minimize the total execution time. The performance of the proposed scheme is also evaluated by a simple numerical simulation.},
 title = {Distributed Qubit Allocation that Minimizes the Total Execution Time for Heterogeneous Quantum Computing},
 year = {2022}
}